/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:15:24,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:15:24,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:15:24,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:15:24,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:15:24,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:15:24,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:15:24,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:15:24,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:15:24,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:15:24,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:15:24,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:15:24,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:15:24,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:15:24,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:15:24,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:15:24,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:15:24,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:15:24,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:15:24,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:15:24,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:15:24,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:15:24,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:15:24,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:15:24,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:15:24,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:15:24,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:15:24,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:15:24,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:15:24,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:15:24,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:15:24,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:15:24,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:15:24,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:15:24,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:15:24,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:15:24,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:15:24,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:15:24,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:15:24,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:15:24,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:15:24,116 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:15:24,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:15:24,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:15:24,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:15:24,132 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:15:24,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:15:24,132 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:24,132 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:15:24,132 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:15:24,132 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:15:24,133 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:24,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:15:24,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:15:24,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:15:24,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:15:24,134 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:15:24,135 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:15:24,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:15:24,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:15:24,135 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:15:24,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:15:24,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:15:24,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:15:24,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:15:24,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:15:24,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:15:24,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:15:24,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:15:24,319 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:15:24,320 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:15:24,321 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:15:24,377 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_3X99hs/tmp/72bb5b668d864318a28be4a0c5ccac2e/FLAGfa84de532 [2020-07-01 13:15:24,726 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:15:24,727 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:15:24,727 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:15:24,733 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_3X99hs/tmp/72bb5b668d864318a28be4a0c5ccac2e/FLAGfa84de532 [2020-07-01 13:15:25,113 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_3X99hs/tmp/72bb5b668d864318a28be4a0c5ccac2e [2020-07-01 13:15:25,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:15:25,126 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:15:25,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:25,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:15:25,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:15:25,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e171996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:15:25,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:15:25,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,411 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:15:25,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,448 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:15:25,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25 WrapperNode [2020-07-01 13:15:25,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:25,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:15:25,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:15:25,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:15:25,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:15:25,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:15:25,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:15:25,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:15:25,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:15:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:15:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:15:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:15:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:15:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:15:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:15:26,034 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:15:26,034 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:15:26,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:26 BoogieIcfgContainer [2020-07-01 13:15:26,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:15:26,040 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:15:26,040 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:15:26,042 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:15:26,043 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:26" (1/1) ... [2020-07-01 13:15:26,061 INFO L313 BlockEncoder]: Initial Icfg 88 locations, 94 edges [2020-07-01 13:15:26,063 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:15:26,063 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:15:26,064 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:15:26,064 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:26,066 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:15:26,067 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:15:26,068 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:15:26,101 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:15:26,166 INFO L200 BlockEncoder]: SBE split 51 edges [2020-07-01 13:15:26,173 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:15:26,175 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:26,209 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:15:26,212 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:15:26,214 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:15:26,214 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:26,215 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:15:26,215 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:15:26,216 INFO L313 BlockEncoder]: Encoded RCFG 80 locations, 166 edges [2020-07-01 13:15:26,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:26 BasicIcfg [2020-07-01 13:15:26,216 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:15:26,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:15:26,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:15:26,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:15:26,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:15:25" (1/4) ... [2020-07-01 13:15:26,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d874322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:26, skipping insertion in model container [2020-07-01 13:15:26,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/4) ... [2020-07-01 13:15:26,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d874322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:26, skipping insertion in model container [2020-07-01 13:15:26,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:26" (3/4) ... [2020-07-01 13:15:26,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d874322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:26, skipping insertion in model container [2020-07-01 13:15:26,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:26" (4/4) ... [2020-07-01 13:15:26,225 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:26,236 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:15:26,244 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2020-07-01 13:15:26,258 INFO L251 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2020-07-01 13:15:26,281 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:15:26,281 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:15:26,282 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:26,282 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:26,282 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:26,282 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:15:26,282 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:26,282 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:15:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-07-01 13:15:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:15:26,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:15:26,306 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 208562, now seen corresponding path program 1 times [2020-07-01 13:15:26,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738977533] [2020-07-01 13:15:26,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:26,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738977533] [2020-07-01 13:15:26,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:26,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547578632] [2020-07-01 13:15:26,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:26,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:26,515 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2020-07-01 13:15:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,835 INFO L93 Difference]: Finished difference Result 158 states and 299 transitions. [2020-07-01 13:15:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:26,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:15:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,850 INFO L225 Difference]: With dead ends: 158 [2020-07-01 13:15:26,851 INFO L226 Difference]: Without dead ends: 80 [2020-07-01 13:15:26,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-01 13:15:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-01 13:15:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-01 13:15:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2020-07-01 13:15:26,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 3 [2020-07-01 13:15:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,897 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2020-07-01 13:15:26,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2020-07-01 13:15:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:15:26,898 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:15:26,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:15:26,900 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash 208841, now seen corresponding path program 1 times [2020-07-01 13:15:26,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824623] [2020-07-01 13:15:26,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:26,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824623] [2020-07-01 13:15:26,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:26,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142080851] [2020-07-01 13:15:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:26,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:26,986 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand 3 states. [2020-07-01 13:15:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,190 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2020-07-01 13:15:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:15:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,192 INFO L225 Difference]: With dead ends: 80 [2020-07-01 13:15:27,192 INFO L226 Difference]: Without dead ends: 75 [2020-07-01 13:15:27,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-01 13:15:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-01 13:15:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-01 13:15:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 125 transitions. [2020-07-01 13:15:27,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 125 transitions. Word has length 3 [2020-07-01 13:15:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,202 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 125 transitions. [2020-07-01 13:15:27,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 125 transitions. [2020-07-01 13:15:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:15:27,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:15:27,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:15:27,203 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash 208839, now seen corresponding path program 1 times [2020-07-01 13:15:27,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166207658] [2020-07-01 13:15:27,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:27,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166207658] [2020-07-01 13:15:27,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:27,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420408257] [2020-07-01 13:15:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:27,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:27,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,262 INFO L87 Difference]: Start difference. First operand 75 states and 125 transitions. Second operand 3 states. [2020-07-01 13:15:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,423 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2020-07-01 13:15:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:15:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,425 INFO L225 Difference]: With dead ends: 75 [2020-07-01 13:15:27,425 INFO L226 Difference]: Without dead ends: 70 [2020-07-01 13:15:27,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-01 13:15:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-01 13:15:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-01 13:15:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2020-07-01 13:15:27,432 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 115 transitions. Word has length 3 [2020-07-01 13:15:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,432 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-07-01 13:15:27,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 115 transitions. [2020-07-01 13:15:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:15:27,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:15:27,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:15:27,434 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 6471649, now seen corresponding path program 1 times [2020-07-01 13:15:27,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376893795] [2020-07-01 13:15:27,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:27,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376893795] [2020-07-01 13:15:27,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:27,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309886397] [2020-07-01 13:15:27,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:27,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,490 INFO L87 Difference]: Start difference. First operand 70 states and 115 transitions. Second operand 3 states. [2020-07-01 13:15:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,633 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2020-07-01 13:15:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:15:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,634 INFO L225 Difference]: With dead ends: 70 [2020-07-01 13:15:27,634 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 13:15:27,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 13:15:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-01 13:15:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 13:15:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 99 transitions. [2020-07-01 13:15:27,641 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 99 transitions. Word has length 4 [2020-07-01 13:15:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,641 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 99 transitions. [2020-07-01 13:15:27,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 99 transitions. [2020-07-01 13:15:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:15:27,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:15:27,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:15:27,642 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 6471651, now seen corresponding path program 1 times [2020-07-01 13:15:27,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646954299] [2020-07-01 13:15:27,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:27,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646954299] [2020-07-01 13:15:27,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:27,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384067675] [2020-07-01 13:15:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,675 INFO L87 Difference]: Start difference. First operand 62 states and 99 transitions. Second operand 3 states. [2020-07-01 13:15:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,766 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2020-07-01 13:15:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:15:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,768 INFO L225 Difference]: With dead ends: 70 [2020-07-01 13:15:27,768 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 13:15:27,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 13:15:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-01 13:15:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 13:15:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2020-07-01 13:15:27,773 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 4 [2020-07-01 13:15:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,774 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2020-07-01 13:15:27,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2020-07-01 13:15:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:15:27,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:15:27,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:15:27,775 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash 6471652, now seen corresponding path program 1 times [2020-07-01 13:15:27,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824978356] [2020-07-01 13:15:27,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:27,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824978356] [2020-07-01 13:15:27,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:27,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717140611] [2020-07-01 13:15:27,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:27,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:27,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,832 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2020-07-01 13:15:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,959 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2020-07-01 13:15:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:15:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,961 INFO L225 Difference]: With dead ends: 62 [2020-07-01 13:15:27,961 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 13:15:27,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 13:15:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-01 13:15:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 13:15:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2020-07-01 13:15:27,967 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 4 [2020-07-01 13:15:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,967 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2020-07-01 13:15:27,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2020-07-01 13:15:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:15:27,968 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:15:27,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:15:27,968 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 200618546, now seen corresponding path program 1 times [2020-07-01 13:15:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410115728] [2020-07-01 13:15:27,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410115728] [2020-07-01 13:15:28,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533264935] [2020-07-01 13:15:28,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,022 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand 3 states. [2020-07-01 13:15:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,111 INFO L93 Difference]: Finished difference Result 54 states and 83 transitions. [2020-07-01 13:15:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:15:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,112 INFO L225 Difference]: With dead ends: 54 [2020-07-01 13:15:28,113 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 13:15:28,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 13:15:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-01 13:15:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 13:15:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2020-07-01 13:15:28,117 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 5 [2020-07-01 13:15:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,117 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2020-07-01 13:15:28,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2020-07-01 13:15:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:15:28,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:15:28,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:15:28,118 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash 200618548, now seen corresponding path program 1 times [2020-07-01 13:15:28,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258244537] [2020-07-01 13:15:28,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258244537] [2020-07-01 13:15:28,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501748454] [2020-07-01 13:15:28,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,148 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand 3 states. [2020-07-01 13:15:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,220 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2020-07-01 13:15:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:15:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,221 INFO L225 Difference]: With dead ends: 54 [2020-07-01 13:15:28,221 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 13:15:28,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 13:15:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-01 13:15:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 13:15:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2020-07-01 13:15:28,226 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 5 [2020-07-01 13:15:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,226 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2020-07-01 13:15:28,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2020-07-01 13:15:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:15:28,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:15:28,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:15:28,227 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash 200618549, now seen corresponding path program 1 times [2020-07-01 13:15:28,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910216132] [2020-07-01 13:15:28,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910216132] [2020-07-01 13:15:28,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726529903] [2020-07-01 13:15:28,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,273 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 3 states. [2020-07-01 13:15:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,361 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2020-07-01 13:15:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:15:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,363 INFO L225 Difference]: With dead ends: 52 [2020-07-01 13:15:28,363 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 13:15:28,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 13:15:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 13:15:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 13:15:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2020-07-01 13:15:28,368 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 5 [2020-07-01 13:15:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,368 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2020-07-01 13:15:28,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2020-07-01 13:15:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:15:28,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:15:28,369 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1924203077, now seen corresponding path program 1 times [2020-07-01 13:15:28,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997459692] [2020-07-01 13:15:28,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997459692] [2020-07-01 13:15:28,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787537411] [2020-07-01 13:15:28,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,408 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand 3 states. [2020-07-01 13:15:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,489 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2020-07-01 13:15:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:15:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,491 INFO L225 Difference]: With dead ends: 50 [2020-07-01 13:15:28,491 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:15:28,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:15:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 13:15:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 13:15:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2020-07-01 13:15:28,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 6 [2020-07-01 13:15:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,496 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2020-07-01 13:15:28,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2020-07-01 13:15:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:15:28,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:15:28,497 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1924203079, now seen corresponding path program 1 times [2020-07-01 13:15:28,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15875884] [2020-07-01 13:15:28,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15875884] [2020-07-01 13:15:28,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737548068] [2020-07-01 13:15:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,533 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand 3 states. [2020-07-01 13:15:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,609 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2020-07-01 13:15:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:15:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,610 INFO L225 Difference]: With dead ends: 47 [2020-07-01 13:15:28,610 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 13:15:28,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 13:15:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 13:15:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:15:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2020-07-01 13:15:28,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 6 [2020-07-01 13:15:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,615 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2020-07-01 13:15:28,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2020-07-01 13:15:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:15:28,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:15:28,616 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash -479251211, now seen corresponding path program 1 times [2020-07-01 13:15:28,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786845153] [2020-07-01 13:15:28,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786845153] [2020-07-01 13:15:28,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692846545] [2020-07-01 13:15:28,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,645 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand 3 states. [2020-07-01 13:15:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,690 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2020-07-01 13:15:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:15:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,692 INFO L225 Difference]: With dead ends: 48 [2020-07-01 13:15:28,692 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 13:15:28,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 13:15:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 13:15:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:15:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2020-07-01 13:15:28,696 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 7 [2020-07-01 13:15:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,697 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2020-07-01 13:15:28,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2020-07-01 13:15:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:15:28,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:15:28,698 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash -479251210, now seen corresponding path program 1 times [2020-07-01 13:15:28,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736960801] [2020-07-01 13:15:28,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736960801] [2020-07-01 13:15:28,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867250330] [2020-07-01 13:15:28,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,742 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 3 states. [2020-07-01 13:15:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,803 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2020-07-01 13:15:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:15:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,804 INFO L225 Difference]: With dead ends: 44 [2020-07-01 13:15:28,804 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:15:28,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:15:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:15:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:15:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2020-07-01 13:15:28,808 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 7 [2020-07-01 13:15:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,808 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2020-07-01 13:15:28,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2020-07-01 13:15:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:15:28,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:15:28,809 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash -479251213, now seen corresponding path program 1 times [2020-07-01 13:15:28,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987914449] [2020-07-01 13:15:28,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987914449] [2020-07-01 13:15:28,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:28,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:28,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056871266] [2020-07-01 13:15:28,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:28,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,849 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand 3 states. [2020-07-01 13:15:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,911 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2020-07-01 13:15:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:28,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:15:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,912 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:15:28,913 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:15:28,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:15:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:15:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:15:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:15:28,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 13:15:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,914 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:15:28,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:15:28,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:15:28,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:15:28,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:15:28,973 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,973 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:15:28,974 INFO L268 CegarLoopResult]: For program point L19-4(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point L19-6(lines 19 27) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point L25-1(lines 19 27) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:15:28,978 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,979 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,980 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L22-6(lines 22 26) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L18-3(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,981 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:15:28,982 INFO L268 CegarLoopResult]: For program point L18-4(line 18) no Hoare annotation was computed. [2020-07-01 13:15:28,982 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:15:28,982 INFO L268 CegarLoopResult]: For program point L18-6(lines 18 29) no Hoare annotation was computed. [2020-07-01 13:15:28,982 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:15:28,982 INFO L264 CegarLoopResult]: At program point L18-8(lines 17 29) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~flag_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 0 ULTIMATE.start_test_fun_~flag_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~flag_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:15:28,983 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:15:28,983 INFO L268 CegarLoopResult]: For program point L18-9(lines 18 29) no Hoare annotation was computed. [2020-07-01 13:15:28,983 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:15:28,983 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:15:28,986 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:15:28,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:28,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:28,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:15:28,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:28,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:28,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:15:29,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:29 BasicIcfg [2020-07-01 13:15:29,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:15:29,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:15:29,010 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:15:29,013 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:15:29,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:29,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:15:25" (1/5) ... [2020-07-01 13:15:29,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251806bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:29, skipping insertion in model container [2020-07-01 13:15:29,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:29,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/5) ... [2020-07-01 13:15:29,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251806bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:29, skipping insertion in model container [2020-07-01 13:15:29,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:29,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:26" (3/5) ... [2020-07-01 13:15:29,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251806bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:29, skipping insertion in model container [2020-07-01 13:15:29,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:29,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:26" (4/5) ... [2020-07-01 13:15:29,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251806bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:29, skipping insertion in model container [2020-07-01 13:15:29,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:29,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:29" (5/5) ... [2020-07-01 13:15:29,018 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:29,040 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:15:29,040 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:15:29,040 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:29,040 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:29,040 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:29,040 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:15:29,040 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:29,040 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:15:29,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2020-07-01 13:15:29,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-07-01 13:15:29,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:29,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:29,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,058 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:15:29,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2020-07-01 13:15:29,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-07-01 13:15:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:29,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,068 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue [177] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 16#L-1true [301] L-1-->L13: Formula: (let ((.cse2 (store |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet23_1|) (= v_ULTIMATE.start_test_fun_~flag_1 1) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 4) |v_#length_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|)) (= v_ULTIMATE.start_test_fun_~flag_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet22_1|) (= (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet21_1|) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_ULTIMATE.start_test_fun_#in~flag_1| |v_ULTIMATE.start_main_#t~nondet24_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= v_ULTIMATE.start_test_fun_~flag_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem18=|v_ULTIMATE.start_test_fun_#t~mem18_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_main_#t~ret25=|v_ULTIMATE.start_main_#t~ret25_1|, ULTIMATE.start_test_fun_~flag_ref~0.offset=v_ULTIMATE.start_test_fun_~flag_ref~0.offset_1, ULTIMATE.start_test_fun_~flag=v_ULTIMATE.start_test_fun_~flag_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~mem20=|v_ULTIMATE.start_test_fun_#t~mem20_1|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_1|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_~flag_ref~0.base=v_ULTIMATE.start_test_fun_~flag_ref~0.base_1, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_test_fun_#t~malloc4.base=|v_ULTIMATE.start_test_fun_#t~malloc4.base_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem17=|v_ULTIMATE.start_test_fun_#t~mem17_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~malloc4.offset=|v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|, ULTIMATE.start_test_fun_#t~mem19=|v_ULTIMATE.start_test_fun_#t~mem19_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~short16=|v_ULTIMATE.start_test_fun_#t~short16_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_1|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_#in~flag=|v_ULTIMATE.start_test_fun_#in~flag_1|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem18, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~short11, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_main_#t~ret25, ULTIMATE.start_test_fun_~flag_ref~0.offset, ULTIMATE.start_test_fun_~flag, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~mem20, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_~flag_ref~0.base, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_test_fun_#t~malloc4.base, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem17, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~malloc4.offset, ULTIMATE.start_test_fun_#t~mem19, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~short16, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_#in~flag, ULTIMATE.start_test_fun_~c~0.base] 80#L13true [216] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_7|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_7|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 79#L13-1true [213] L13-1-->L14: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 25#L14true [153] L14-->L15: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 29#L15true [160] L15-->L16: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~flag_ref~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~flag_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~flag_ref~0.offset_3) (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~flag_ref~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~flag_ref~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~flag_ref~0.base_3) v_ULTIMATE.start_test_fun_~flag_ref~0.offset_3 v_ULTIMATE.start_test_fun_~flag_4)))) InVars {ULTIMATE.start_test_fun_~flag=v_ULTIMATE.start_test_fun_~flag_4, ULTIMATE.start_test_fun_~flag_ref~0.offset=v_ULTIMATE.start_test_fun_~flag_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~flag_ref~0.base=v_ULTIMATE.start_test_fun_~flag_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~flag=v_ULTIMATE.start_test_fun_~flag_4, ULTIMATE.start_test_fun_~flag_ref~0.offset=v_ULTIMATE.start_test_fun_~flag_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~flag_ref~0.base=v_ULTIMATE.start_test_fun_~flag_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 50#L16true [183] L16-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_9|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 18#L18-8true [2020-07-01 13:15:29,069 INFO L796 eck$LassoCheckResult]: Loop: 18#L18-8true [144] L18-8-->L18: Formula: (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 10#L18true [133] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_21|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 9#L18-1true [334] L18-1-->L18-2: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_2|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 6#L18-2true [129] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 21#L18-6true [148] L18-6-->L19: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 38#L19true [171] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 36#L19-1true [346] L19-1-->L19-2: Formula: (and (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_3|) (not |v_ULTIMATE.start_test_fun_#t~short11_2|)) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short11] 34#L19-2true [168] L19-2-->L19-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short11_5|) InVars {ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_5|} OutVars{ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_5|} AuxVars[] AssignedVars[] 47#L19-6true [181] L19-6-->L20: Formula: |v_ULTIMATE.start_test_fun_#t~short11_7| InVars {ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_7|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~short11=|v_ULTIMATE.start_test_fun_#t~short11_6|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~short11] 59#L20true [193] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 57#L20-1true [190] L20-1-->L20-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_17|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 56#L20-2true [406] L20-2-->L25-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_19 4) (select |v_#length_55| v_ULTIMATE.start_test_fun_~y_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_19) (= (select |v_#valid_67| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) 1) (= (store |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_27 (store (select |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) v_ULTIMATE.start_test_fun_~y_ref~0.offset_19 (* |v_ULTIMATE.start_test_fun_#t~mem12_6| |v_ULTIMATE.start_test_fun_#t~mem13_6|))) |v_#memory_int_36|)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_37|, #length=|v_#length_55|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_36|, #length=|v_#length_55|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, #memory_int] 24#L25-1true [149] L25-1-->L28: Formula: (and (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem19_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_28|, #length=|v_#length_45|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem19=|v_ULTIMATE.start_test_fun_#t~mem19_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem19] 72#L28true [407] L28-->L18-8: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_56| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= 1 (select |v_#valid_68| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_39| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_39| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem19_6| 1))) |v_#memory_int_38|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_39|, #length=|v_#length_56|, ULTIMATE.start_test_fun_#t~mem19=|v_ULTIMATE.start_test_fun_#t~mem19_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_38|, #length=|v_#length_56|, ULTIMATE.start_test_fun_#t~mem19=|v_ULTIMATE.start_test_fun_#t~mem19_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem19] 18#L18-8true [2020-07-01 13:15:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 150589974, now seen corresponding path program 1 times [2020-07-01 13:15:29,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384646655] [2020-07-01 13:15:29,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:29,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384646655] [2020-07-01 13:15:29,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:29,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105784077] [2020-07-01 13:15:29,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,095 INFO L82 PathProgramCache]: Analyzing trace with hash 52782196, now seen corresponding path program 1 times [2020-07-01 13:15:29,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942602682] [2020-07-01 13:15:29,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:29,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942602682] [2020-07-01 13:15:29,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751527308] [2020-07-01 13:15:29,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:15:29,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:29,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:29,110 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2020-07-01 13:15:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,299 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2020-07-01 13:15:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:29,302 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:15:29,306 INFO L168 Benchmark]: Toolchain (without parser) took 4179.58 ms. Allocated memory was 514.9 MB in the beginning and 637.5 MB in the end (delta: 122.7 MB). Free memory was 436.2 MB in the beginning and 575.6 MB in the end (delta: -139.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:15:29,307 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:15:29,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.95 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 435.5 MB in the beginning and 533.6 MB in the end (delta: -98.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.25 ms. Allocated memory is still 565.7 MB. Free memory was 533.6 MB in the beginning and 531.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,308 INFO L168 Benchmark]: Boogie Preprocessor took 27.96 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 529.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,309 INFO L168 Benchmark]: RCFGBuilder took 516.43 ms. Allocated memory is still 565.7 MB. Free memory was 529.3 MB in the beginning and 495.1 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,310 INFO L168 Benchmark]: BlockEncodingV2 took 176.45 ms. Allocated memory is still 565.7 MB. Free memory was 495.1 MB in the beginning and 476.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,310 INFO L168 Benchmark]: TraceAbstraction took 2791.85 ms. Allocated memory was 565.7 MB in the beginning and 601.4 MB in the end (delta: 35.7 MB). Free memory was 475.1 MB in the beginning and 420.6 MB in the end (delta: 54.5 MB). Peak memory consumption was 90.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:29,311 INFO L168 Benchmark]: BuchiAutomizer took 293.79 ms. Allocated memory was 601.4 MB in the beginning and 637.5 MB in the end (delta: 36.2 MB). Free memory was 420.6 MB in the beginning and 575.6 MB in the end (delta: -155.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:15:29,314 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 88 locations, 94 edges - StatisticsResult: Encoded RCFG 80 locations, 166 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.95 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 435.5 MB in the beginning and 533.6 MB in the end (delta: -98.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 45.25 ms. Allocated memory is still 565.7 MB. Free memory was 533.6 MB in the beginning and 531.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.96 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 529.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 516.43 ms. Allocated memory is still 565.7 MB. Free memory was 529.3 MB in the beginning and 495.1 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 176.45 ms. Allocated memory is still 565.7 MB. Free memory was 495.1 MB in the beginning and 476.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2791.85 ms. Allocated memory was 565.7 MB in the beginning and 601.4 MB in the end (delta: 35.7 MB). Free memory was 475.1 MB in the beginning and 420.6 MB in the end (delta: 54.5 MB). Peak memory consumption was 90.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 293.79 ms. Allocated memory was 601.4 MB in the beginning and 637.5 MB in the end (delta: 36.2 MB). Free memory was 420.6 MB in the beginning and 575.6 MB in the end (delta: -155.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 13:15:29,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,326 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,326 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:15:29,326 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,326 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,327 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:15:29,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:29,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[flag_ref]) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && \valid[z_ref] == 1) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 0 == flag_ref) && 1 == \valid[y_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[flag_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 44 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 253 SDtfs, 1118 SDslu, 8 SDs, 0 SdLazy, 924 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 69 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:15:21.857 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_3X99hs/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:15:29.554 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check