/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:30:35,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:30:35,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:30:36,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:30:36,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:30:36,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:30:36,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:30:36,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:30:36,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:30:36,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:30:36,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:30:36,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:30:36,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:30:36,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:30:36,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:30:36,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:30:36,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:30:36,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:30:36,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:30:36,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:30:36,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:30:36,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:30:36,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:30:36,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:30:36,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:30:36,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:30:36,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:30:36,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:30:36,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:30:36,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:30:36,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:30:36,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:30:36,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:30:36,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:30:36,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:30:36,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:30:36,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:30:36,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:30:36,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:30:36,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:30:36,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:30:36,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:30:36,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:30:36,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:30:36,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:30:36,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:30:36,105 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:30:36,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:30:36,105 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:30:36,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:30:36,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:30:36,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:30:36,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:30:36,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:30:36,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:30:36,107 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:30:36,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:30:36,107 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:30:36,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:30:36,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:30:36,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:30:36,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:30:36,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:30:36,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:30:36,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:30:36,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:30:36,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:30:36,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:30:36,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:30:36,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:30:36,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:30:36,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:30:36,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:30:36,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:30:36,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:30:36,406 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:30:36,406 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:30:36,407 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-20 05:30:36,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/672ecfed8/78dca4801fd5494dac818fcef85bb9c7/FLAG0928b29c2 [2020-07-20 05:30:36,870 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:30:36,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-20 05:30:36,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/672ecfed8/78dca4801fd5494dac818fcef85bb9c7/FLAG0928b29c2 [2020-07-20 05:30:37,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/672ecfed8/78dca4801fd5494dac818fcef85bb9c7 [2020-07-20 05:30:37,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:30:37,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:30:37,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:30:37,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:30:37,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:30:37,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a445a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37, skipping insertion in model container [2020-07-20 05:30:37,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:30:37,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:30:37,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:30:37,474 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:30:37,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:30:37,508 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:30:37,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37 WrapperNode [2020-07-20 05:30:37,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:30:37,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:30:37,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:30:37,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:30:37,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... [2020-07-20 05:30:37,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:30:37,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:30:37,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:30:37,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:30:37,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:30:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:30:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:30:37,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-20 05:30:37,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-20 05:30:37,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:30:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:30:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:30:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-20 05:30:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-20 05:30:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:30:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:30:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:30:37,938 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:30:37,938 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 05:30:37,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:30:37 BoogieIcfgContainer [2020-07-20 05:30:37,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:30:37,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:30:37,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:30:37,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:30:37,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:30:37" (1/3) ... [2020-07-20 05:30:37,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350139c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:30:37, skipping insertion in model container [2020-07-20 05:30:37,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:30:37" (2/3) ... [2020-07-20 05:30:37,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350139c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:30:37, skipping insertion in model container [2020-07-20 05:30:37,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:30:37" (3/3) ... [2020-07-20 05:30:37,984 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2020-07-20 05:30:38,008 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:30:38,030 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:30:38,058 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:30:38,082 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:30:38,082 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:30:38,082 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:30:38,082 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:30:38,082 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:30:38,083 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:30:38,083 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:30:38,083 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:30:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-20 05:30:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 05:30:38,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:38,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:38,111 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-20 05:30:38,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:38,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084733192] [2020-07-20 05:30:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,339 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-20 05:30:38,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084733192] [2020-07-20 05:30:38,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:30:38,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:30:38,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947972689] [2020-07-20 05:30:38,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:30:38,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:30:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:30:38,365 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-20 05:30:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:38,469 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-20 05:30:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:30:38,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 05:30:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:38,481 INFO L225 Difference]: With dead ends: 44 [2020-07-20 05:30:38,482 INFO L226 Difference]: Without dead ends: 30 [2020-07-20 05:30:38,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:30:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-20 05:30:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-20 05:30:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:30:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:30:38,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-20 05:30:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:38,539 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:30:38,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:30:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:30:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:30:38,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:38,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:38,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:30:38,543 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-20 05:30:38,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:38,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550603241] [2020-07-20 05:30:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,644 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-20 05:30:38,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550603241] [2020-07-20 05:30:38,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:30:38,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:30:38,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642437693] [2020-07-20 05:30:38,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:30:38,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:30:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:30:38,654 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-20 05:30:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:38,761 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-20 05:30:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:30:38,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:30:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:38,764 INFO L225 Difference]: With dead ends: 36 [2020-07-20 05:30:38,764 INFO L226 Difference]: Without dead ends: 32 [2020-07-20 05:30:38,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:30:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-20 05:30:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-20 05:30:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:30:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:30:38,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-20 05:30:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:38,775 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:30:38,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:30:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:30:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 05:30:38,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:38,778 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:38,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:30:38,778 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-20 05:30:38,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:38,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743901233] [2020-07-20 05:30:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:30:38,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743901233] [2020-07-20 05:30:38,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328012731] [2020-07-20 05:30:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@660a5f00 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:38,950 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@660a5f00 issued 3 check-sat command(s) [2020-07-20 05:30:38,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:38,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:30:38,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:30:39,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:39,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-20 05:30:39,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975767448] [2020-07-20 05:30:39,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 05:30:39,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 05:30:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-20 05:30:39,065 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-20 05:30:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:39,344 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-20 05:30:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:30:39,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-20 05:30:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:39,346 INFO L225 Difference]: With dead ends: 58 [2020-07-20 05:30:39,347 INFO L226 Difference]: Without dead ends: 34 [2020-07-20 05:30:39,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-20 05:30:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-20 05:30:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-20 05:30:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-20 05:30:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-20 05:30:39,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-20 05:30:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:39,368 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-20 05:30:39,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 05:30:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-20 05:30:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:30:39,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:39,371 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:39,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 05:30:39,586 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-20 05:30:39,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:39,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080404232] [2020-07-20 05:30:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:30:39,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080404232] [2020-07-20 05:30:39,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9069215] [2020-07-20 05:30:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@9f65e7d No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:39,747 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@9f65e7d issued 3 check-sat command(s) [2020-07-20 05:30:39,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:39,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:30:39,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:30:39,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:39,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 05:30:39,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308520044] [2020-07-20 05:30:39,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:30:39,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:30:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:30:39,785 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-20 05:30:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:39,972 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-20 05:30:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 05:30:39,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 05:30:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:39,976 INFO L225 Difference]: With dead ends: 54 [2020-07-20 05:30:39,977 INFO L226 Difference]: Without dead ends: 50 [2020-07-20 05:30:39,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:30:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-20 05:30:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-20 05:30:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 05:30:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-20 05:30:39,991 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-20 05:30:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:39,992 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-20 05:30:39,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:30:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-20 05:30:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 05:30:39,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:39,995 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:40,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:40,210 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-20 05:30:40,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:40,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421634325] [2020-07-20 05:30:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:30:40,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421634325] [2020-07-20 05:30:40,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929557808] [2020-07-20 05:30:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42fed97 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:40,369 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42fed97 issued 3 check-sat command(s) [2020-07-20 05:30:40,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:40,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:30:40,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:30:40,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:40,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-20 05:30:40,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88876164] [2020-07-20 05:30:40,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 05:30:40,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 05:30:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:30:40,439 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-20 05:30:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:40,742 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-20 05:30:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 05:30:40,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 05:30:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:40,746 INFO L225 Difference]: With dead ends: 108 [2020-07-20 05:30:40,746 INFO L226 Difference]: Without dead ends: 66 [2020-07-20 05:30:40,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-20 05:30:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-20 05:30:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-20 05:30:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 05:30:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-20 05:30:40,762 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-20 05:30:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:40,762 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-20 05:30:40,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 05:30:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-20 05:30:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:30:40,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:40,765 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:40,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:40,980 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-20 05:30:40,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:40,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839937249] [2020-07-20 05:30:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 05:30:41,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839937249] [2020-07-20 05:30:41,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515905594] [2020-07-20 05:30:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@53538eec No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:41,184 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@53538eec issued 3 check-sat command(s) [2020-07-20 05:30:41,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:41,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:30:41,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:30:41,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:41,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-20 05:30:41,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473223937] [2020-07-20 05:30:41,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 05:30:41,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 05:30:41,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:30:41,259 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-20 05:30:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:41,653 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-20 05:30:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 05:30:41,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-20 05:30:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:41,657 INFO L225 Difference]: With dead ends: 180 [2020-07-20 05:30:41,657 INFO L226 Difference]: Without dead ends: 120 [2020-07-20 05:30:41,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-20 05:30:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-20 05:30:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-20 05:30:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-20 05:30:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-20 05:30:41,683 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-20 05:30:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:41,683 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-20 05:30:41,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 05:30:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-20 05:30:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-20 05:30:41,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:41,688 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:41,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:41,902 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:41,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:41,903 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-20 05:30:41,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:41,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726978393] [2020-07-20 05:30:41,904 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-20 05:30:42,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726978393] [2020-07-20 05:30:42,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557349409] [2020-07-20 05:30:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@123b815b No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:42,151 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@123b815b issued 3 check-sat command(s) [2020-07-20 05:30:42,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:42,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:30:42,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-20 05:30:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:42,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-20 05:30:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49100437] [2020-07-20 05:30:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 05:30:42,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 05:30:42,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-20 05:30:42,240 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-20 05:30:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:42,804 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-20 05:30:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 05:30:42,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-20 05:30:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:42,808 INFO L225 Difference]: With dead ends: 258 [2020-07-20 05:30:42,808 INFO L226 Difference]: Without dead ends: 158 [2020-07-20 05:30:42,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-20 05:30:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-20 05:30:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-20 05:30:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 05:30:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-20 05:30:42,859 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-20 05:30:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:42,860 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-20 05:30:42,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 05:30:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-20 05:30:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-20 05:30:42,867 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:42,867 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:43,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 05:30:43,073 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-20 05:30:43,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:43,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172944785] [2020-07-20 05:30:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-20 05:30:43,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172944785] [2020-07-20 05:30:43,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257198719] [2020-07-20 05:30:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f410920 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:43,440 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f410920 issued 3 check-sat command(s) [2020-07-20 05:30:43,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:43,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:30:43,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-20 05:30:43,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:43,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-20 05:30:43,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926490589] [2020-07-20 05:30:43,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:30:43,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:43,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:30:43,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-20 05:30:43,574 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-20 05:30:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:44,236 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-20 05:30:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-20 05:30:44,237 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-20 05:30:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:44,239 INFO L225 Difference]: With dead ends: 243 [2020-07-20 05:30:44,239 INFO L226 Difference]: Without dead ends: 110 [2020-07-20 05:30:44,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:30:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-20 05:30:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-20 05:30:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 05:30:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 05:30:44,258 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-20 05:30:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:44,258 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 05:30:44,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:30:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 05:30:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 05:30:44,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:44,260 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:44,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:44,476 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-20 05:30:44,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:44,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764680708] [2020-07-20 05:30:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-20 05:30:44,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764680708] [2020-07-20 05:30:44,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787960251] [2020-07-20 05:30:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e15441f No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:44,800 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e15441f issued 3 check-sat command(s) [2020-07-20 05:30:44,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:44,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 05:30:44,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-07-20 05:30:44,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:44,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-07-20 05:30:44,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350322989] [2020-07-20 05:30:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 05:30:44,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 05:30:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:30:44,957 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 17 states. [2020-07-20 05:30:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:45,653 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-20 05:30:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 05:30:45,654 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2020-07-20 05:30:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:45,656 INFO L225 Difference]: With dead ends: 217 [2020-07-20 05:30:45,657 INFO L226 Difference]: Without dead ends: 137 [2020-07-20 05:30:45,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-20 05:30:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-20 05:30:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-20 05:30:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-20 05:30:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-20 05:30:45,694 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 123 [2020-07-20 05:30:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:45,694 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-20 05:30:45,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 05:30:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-20 05:30:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-20 05:30:45,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:45,697 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:45,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:45,901 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 466415905, now seen corresponding path program 1 times [2020-07-20 05:30:45,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:45,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640527521] [2020-07-20 05:30:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 165 proven. 262 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2020-07-20 05:30:46,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640527521] [2020-07-20 05:30:46,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904564716] [2020-07-20 05:30:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@173a5c0d No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:46,512 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@173a5c0d issued 3 check-sat command(s) [2020-07-20 05:30:46,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:46,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 05:30:46,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-07-20 05:30:46,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:46,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-07-20 05:30:46,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684709257] [2020-07-20 05:30:46,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 05:30:46,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 05:30:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-20 05:30:46,706 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 18 states. [2020-07-20 05:30:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:47,515 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-20 05:30:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-20 05:30:47,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2020-07-20 05:30:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:47,521 INFO L225 Difference]: With dead ends: 263 [2020-07-20 05:30:47,521 INFO L226 Difference]: Without dead ends: 158 [2020-07-20 05:30:47,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 05:30:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-20 05:30:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-20 05:30:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-20 05:30:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-20 05:30:47,552 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 231 [2020-07-20 05:30:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:47,553 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-20 05:30:47,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 05:30:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-20 05:30:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-07-20 05:30:47,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:47,576 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:47,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 05:30:47,790 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash -80201483, now seen corresponding path program 2 times [2020-07-20 05:30:47,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:47,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885495845] [2020-07-20 05:30:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 243 proven. 571 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2020-07-20 05:30:48,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885495845] [2020-07-20 05:30:48,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556012802] [2020-07-20 05:30:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@598a9681 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:48,753 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@598a9681 issued 3 check-sat command(s) [2020-07-20 05:30:48,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:48,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:30:48,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 139 proven. 856 refuted. 0 times theorem prover too weak. 2765 trivial. 0 not checked. [2020-07-20 05:30:49,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:49,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2020-07-20 05:30:49,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523359592] [2020-07-20 05:30:49,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 05:30:49,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 05:30:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:30:49,011 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 19 states. [2020-07-20 05:30:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:49,973 INFO L93 Difference]: Finished difference Result 337 states and 597 transitions. [2020-07-20 05:30:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-20 05:30:49,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2020-07-20 05:30:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:49,984 INFO L225 Difference]: With dead ends: 337 [2020-07-20 05:30:49,984 INFO L226 Difference]: Without dead ends: 200 [2020-07-20 05:30:49,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2020-07-20 05:30:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-20 05:30:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2020-07-20 05:30:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-20 05:30:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2020-07-20 05:30:50,004 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 367 [2020-07-20 05:30:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:50,005 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2020-07-20 05:30:50,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 05:30:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2020-07-20 05:30:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2020-07-20 05:30:50,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:50,019 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 34, 32, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 15, 11, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:50,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:50,233 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -495618503, now seen corresponding path program 3 times [2020-07-20 05:30:50,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:50,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764122104] [2020-07-20 05:30:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 425 proven. 1461 refuted. 0 times theorem prover too weak. 7103 trivial. 0 not checked. [2020-07-20 05:30:52,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764122104] [2020-07-20 05:30:52,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293230467] [2020-07-20 05:30:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d91d01a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:52,563 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d91d01a issued 3 check-sat command(s) [2020-07-20 05:30:52,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:52,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 05:30:52,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 254 proven. 1547 refuted. 0 times theorem prover too weak. 7188 trivial. 0 not checked. [2020-07-20 05:30:52,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:52,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2020-07-20 05:30:52,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464130071] [2020-07-20 05:30:52,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 05:30:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 05:30:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2020-07-20 05:30:52,881 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand 22 states. [2020-07-20 05:30:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:30:54,412 INFO L93 Difference]: Finished difference Result 424 states and 800 transitions. [2020-07-20 05:30:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-20 05:30:54,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 559 [2020-07-20 05:30:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:30:54,419 INFO L225 Difference]: With dead ends: 424 [2020-07-20 05:30:54,419 INFO L226 Difference]: Without dead ends: 253 [2020-07-20 05:30:54,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2020-07-20 05:30:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-20 05:30:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 218. [2020-07-20 05:30:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-20 05:30:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 360 transitions. [2020-07-20 05:30:54,455 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 360 transitions. Word has length 559 [2020-07-20 05:30:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:30:54,455 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 360 transitions. [2020-07-20 05:30:54,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 05:30:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2020-07-20 05:30:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2020-07-20 05:30:54,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:30:54,484 INFO L422 BasicCegarLoop]: trace histogram [63, 63, 60, 60, 50, 49, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 20, 18, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:30:54,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:54,699 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:30:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:30:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1928846884, now seen corresponding path program 4 times [2020-07-20 05:30:54,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:30:54,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384292332] [2020-07-20 05:30:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:30:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:30:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 3107 proven. 2983 refuted. 0 times theorem prover too weak. 14803 trivial. 0 not checked. [2020-07-20 05:30:58,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384292332] [2020-07-20 05:30:58,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214726614] [2020-07-20 05:30:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7bd5b7f5 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:30:58,798 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7bd5b7f5 issued 3 check-sat command(s) [2020-07-20 05:30:58,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:30:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:30:58,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:30:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 700 proven. 1847 refuted. 0 times theorem prover too weak. 18346 trivial. 0 not checked. [2020-07-20 05:30:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:30:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2020-07-20 05:30:59,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22117353] [2020-07-20 05:30:59,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 05:30:59,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:30:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 05:30:59,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-07-20 05:30:59,257 INFO L87 Difference]: Start difference. First operand 218 states and 360 transitions. Second operand 22 states. [2020-07-20 05:31:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:00,705 INFO L93 Difference]: Finished difference Result 527 states and 957 transitions. [2020-07-20 05:31:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-07-20 05:31:00,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 844 [2020-07-20 05:31:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:00,712 INFO L225 Difference]: With dead ends: 527 [2020-07-20 05:31:00,713 INFO L226 Difference]: Without dead ends: 323 [2020-07-20 05:31:00,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=2558, Unknown=0, NotChecked=0, Total=2970 [2020-07-20 05:31:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-07-20 05:31:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 269. [2020-07-20 05:31:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-20 05:31:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 438 transitions. [2020-07-20 05:31:00,746 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 438 transitions. Word has length 844 [2020-07-20 05:31:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:00,747 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 438 transitions. [2020-07-20 05:31:00,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 05:31:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 438 transitions. [2020-07-20 05:31:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2020-07-20 05:31:00,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:00,766 INFO L422 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 64, 63, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 25, 24, 16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:00,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-20 05:31:00,981 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1318090551, now seen corresponding path program 5 times [2020-07-20 05:31:00,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:00,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273047354] [2020-07-20 05:31:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 34233 backedges. 1141 proven. 4104 refuted. 0 times theorem prover too weak. 28988 trivial. 0 not checked. [2020-07-20 05:31:05,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273047354] [2020-07-20 05:31:05,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442190243] [2020-07-20 05:31:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@40d4af5c No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:06,127 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@40d4af5c issued 3 check-sat command(s) [2020-07-20 05:31:06,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:06,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:31:06,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34233 backedges. 1046 proven. 2261 refuted. 0 times theorem prover too weak. 30926 trivial. 0 not checked. [2020-07-20 05:31:06,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:06,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2020-07-20 05:31:06,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270163676] [2020-07-20 05:31:06,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 05:31:06,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 05:31:06,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2020-07-20 05:31:06,945 INFO L87 Difference]: Start difference. First operand 269 states and 438 transitions. Second operand 23 states. [2020-07-20 05:31:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:08,705 INFO L93 Difference]: Finished difference Result 588 states and 1018 transitions. [2020-07-20 05:31:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-07-20 05:31:08,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1076 [2020-07-20 05:31:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:08,712 INFO L225 Difference]: With dead ends: 588 [2020-07-20 05:31:08,712 INFO L226 Difference]: Without dead ends: 333 [2020-07-20 05:31:08,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1447 GetRequests, 1389 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2020-07-20 05:31:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-07-20 05:31:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 235. [2020-07-20 05:31:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-07-20 05:31:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2020-07-20 05:31:08,747 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 1076 [2020-07-20 05:31:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:08,750 INFO L479 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2020-07-20 05:31:08,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 05:31:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2020-07-20 05:31:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2020-07-20 05:31:08,767 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:08,767 INFO L422 BasicCegarLoop]: trace histogram [93, 93, 88, 88, 74, 72, 46, 46, 46, 46, 46, 46, 46, 44, 44, 44, 44, 44, 44, 44, 28, 28, 21, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:08,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 05:31:08,983 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2088891109, now seen corresponding path program 6 times [2020-07-20 05:31:08,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:08,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790060068] [2020-07-20 05:31:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45605 backedges. 2603 proven. 6397 refuted. 0 times theorem prover too weak. 36605 trivial. 0 not checked. [2020-07-20 05:31:14,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790060068] [2020-07-20 05:31:14,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042146930] [2020-07-20 05:31:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7769fe16 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:14,780 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7769fe16 issued 3 check-sat command(s) [2020-07-20 05:31:14,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:14,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 2241 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 05:31:14,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 45605 backedges. 1193 proven. 3592 refuted. 0 times theorem prover too weak. 40820 trivial. 0 not checked. [2020-07-20 05:31:15,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:15,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 27 [2020-07-20 05:31:15,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664465672] [2020-07-20 05:31:15,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-20 05:31:15,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:15,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-20 05:31:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2020-07-20 05:31:15,510 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 27 states. [2020-07-20 05:31:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:17,523 INFO L93 Difference]: Finished difference Result 646 states and 1134 transitions. [2020-07-20 05:31:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-07-20 05:31:17,524 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1239 [2020-07-20 05:31:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:17,528 INFO L225 Difference]: With dead ends: 646 [2020-07-20 05:31:17,529 INFO L226 Difference]: Without dead ends: 295 [2020-07-20 05:31:17,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1604 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=3441, Unknown=0, NotChecked=0, Total=3906 [2020-07-20 05:31:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-07-20 05:31:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 229. [2020-07-20 05:31:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-20 05:31:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 327 transitions. [2020-07-20 05:31:17,557 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 327 transitions. Word has length 1239 [2020-07-20 05:31:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:17,558 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 327 transitions. [2020-07-20 05:31:17,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-20 05:31:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 327 transitions. [2020-07-20 05:31:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2020-07-20 05:31:17,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:17,568 INFO L422 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 55, 54, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 22, 20, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:17,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-20 05:31:17,782 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:17,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1329713436, now seen corresponding path program 7 times [2020-07-20 05:31:17,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:17,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349213573] [2020-07-20 05:31:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1608 proven. 3283 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2020-07-20 05:31:21,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349213573] [2020-07-20 05:31:21,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076074032] [2020-07-20 05:31:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e02be64 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:21,347 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e02be64 issued 4 check-sat command(s) [2020-07-20 05:31:21,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:21,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:31:21,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1476 proven. 1343 refuted. 0 times theorem prover too weak. 22409 trivial. 0 not checked. [2020-07-20 05:31:21,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:21,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 24 [2020-07-20 05:31:21,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522551200] [2020-07-20 05:31:21,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 05:31:21,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 05:31:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2020-07-20 05:31:21,776 INFO L87 Difference]: Start difference. First operand 229 states and 327 transitions. Second operand 24 states. [2020-07-20 05:31:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:23,751 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-20 05:31:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-07-20 05:31:23,751 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 926 [2020-07-20 05:31:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:23,756 INFO L225 Difference]: With dead ends: 522 [2020-07-20 05:31:23,756 INFO L226 Difference]: Without dead ends: 302 [2020-07-20 05:31:23,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=550, Invalid=3740, Unknown=0, NotChecked=0, Total=4290 [2020-07-20 05:31:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-07-20 05:31:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2020-07-20 05:31:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-07-20 05:31:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 325 transitions. [2020-07-20 05:31:23,778 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 325 transitions. Word has length 926 [2020-07-20 05:31:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:23,779 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 325 transitions. [2020-07-20 05:31:23,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 05:31:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 325 transitions. [2020-07-20 05:31:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2020-07-20 05:31:23,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:23,791 INFO L422 BasicCegarLoop]: trace histogram [74, 74, 71, 71, 59, 58, 37, 37, 37, 37, 37, 37, 37, 35, 35, 35, 35, 35, 35, 35, 24, 21, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:24,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:24,006 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430403, now seen corresponding path program 8 times [2020-07-20 05:31:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:24,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865488319] [2020-07-20 05:31:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 2570 proven. 3946 refuted. 0 times theorem prover too weak. 22636 trivial. 0 not checked. [2020-07-20 05:31:27,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865488319] [2020-07-20 05:31:27,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879381908] [2020-07-20 05:31:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@34fb95e No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:27,449 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@34fb95e issued 4 check-sat command(s) [2020-07-20 05:31:27,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:27,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 2209 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 05:31:27,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 1587 proven. 1068 refuted. 0 times theorem prover too weak. 26497 trivial. 0 not checked. [2020-07-20 05:31:28,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:28,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12] total 30 [2020-07-20 05:31:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451904972] [2020-07-20 05:31:28,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-20 05:31:28,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-20 05:31:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:31:28,055 INFO L87 Difference]: Start difference. First operand 236 states and 325 transitions. Second operand 30 states. [2020-07-20 05:31:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:30,817 INFO L93 Difference]: Finished difference Result 535 states and 772 transitions. [2020-07-20 05:31:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2020-07-20 05:31:30,823 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 994 [2020-07-20 05:31:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:30,827 INFO L225 Difference]: With dead ends: 535 [2020-07-20 05:31:30,828 INFO L226 Difference]: Without dead ends: 313 [2020-07-20 05:31:30,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1283 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2385 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=964, Invalid=7226, Unknown=0, NotChecked=0, Total=8190 [2020-07-20 05:31:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-07-20 05:31:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 253. [2020-07-20 05:31:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-20 05:31:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2020-07-20 05:31:30,859 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 994 [2020-07-20 05:31:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:30,860 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2020-07-20 05:31:30,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-20 05:31:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2020-07-20 05:31:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2020-07-20 05:31:30,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:30,883 INFO L422 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 89, 88, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 34, 34, 22, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:31,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-20 05:31:31,097 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1471629456, now seen corresponding path program 9 times [2020-07-20 05:31:31,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:31,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816476923] [2020-07-20 05:31:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3323 proven. 6811 refuted. 0 times theorem prover too weak. 56798 trivial. 0 not checked. [2020-07-20 05:31:37,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816476923] [2020-07-20 05:31:37,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584521757] [2020-07-20 05:31:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4baf8ce3 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:37,505 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4baf8ce3 issued 4 check-sat command(s) [2020-07-20 05:31:37,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:37,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 3328 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 05:31:37,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3453 proven. 2405 refuted. 0 times theorem prover too weak. 61074 trivial. 0 not checked. [2020-07-20 05:31:38,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:38,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 28 [2020-07-20 05:31:38,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295238227] [2020-07-20 05:31:38,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-20 05:31:38,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-20 05:31:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2020-07-20 05:31:38,454 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand 28 states. [2020-07-20 05:31:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:40,514 INFO L93 Difference]: Finished difference Result 604 states and 866 transitions. [2020-07-20 05:31:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-07-20 05:31:40,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1498 [2020-07-20 05:31:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:40,519 INFO L225 Difference]: With dead ends: 604 [2020-07-20 05:31:40,519 INFO L226 Difference]: Without dead ends: 354 [2020-07-20 05:31:40,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2009 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=685, Invalid=5167, Unknown=0, NotChecked=0, Total=5852 [2020-07-20 05:31:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-07-20 05:31:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 299. [2020-07-20 05:31:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-07-20 05:31:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2020-07-20 05:31:40,544 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 1498 [2020-07-20 05:31:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:40,545 INFO L479 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2020-07-20 05:31:40,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-20 05:31:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2020-07-20 05:31:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2020-07-20 05:31:40,557 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:40,557 INFO L422 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:40,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-20 05:31:40,772 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1627069240, now seen corresponding path program 10 times [2020-07-20 05:31:40,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:40,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565806233] [2020-07-20 05:31:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:31:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2639 proven. 3391 refuted. 0 times theorem prover too weak. 25606 trivial. 0 not checked. [2020-07-20 05:31:43,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565806233] [2020-07-20 05:31:43,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098483454] [2020-07-20 05:31:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@25a46d46 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:44,171 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@25a46d46 issued 4 check-sat command(s) [2020-07-20 05:31:44,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:31:44,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:31:44,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:31:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2020-07-20 05:31:44,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:31:44,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 25 [2020-07-20 05:31:44,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91715397] [2020-07-20 05:31:44,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 05:31:44,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:31:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 05:31:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2020-07-20 05:31:44,728 INFO L87 Difference]: Start difference. First operand 299 states and 393 transitions. Second operand 25 states. [2020-07-20 05:31:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:31:46,138 INFO L93 Difference]: Finished difference Result 346 states and 450 transitions. [2020-07-20 05:31:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-07-20 05:31:46,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1035 [2020-07-20 05:31:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:31:46,144 INFO L225 Difference]: With dead ends: 346 [2020-07-20 05:31:46,144 INFO L226 Difference]: Without dead ends: 328 [2020-07-20 05:31:46,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1395 GetRequests, 1336 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=455, Invalid=3205, Unknown=0, NotChecked=0, Total=3660 [2020-07-20 05:31:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-07-20 05:31:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 284. [2020-07-20 05:31:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-07-20 05:31:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 364 transitions. [2020-07-20 05:31:46,166 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 364 transitions. Word has length 1035 [2020-07-20 05:31:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:31:46,167 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 364 transitions. [2020-07-20 05:31:46,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 05:31:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2020-07-20 05:31:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 05:31:46,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:31:46,182 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:31:46,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:31:46,398 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:31:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:31:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 11 times [2020-07-20 05:31:46,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:31:46,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479868493] [2020-07-20 05:31:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@41981b42 [2020-07-20 05:31:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:31:46,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:31:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:31:46,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:31:47,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:31:47,055 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:31:47,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-20 05:31:47,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:31:47 BoogieIcfgContainer [2020-07-20 05:31:47,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:31:47,207 INFO L168 Benchmark]: Toolchain (without parser) took 69949.00 ms. Allocated memory was 140.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 852.2 MB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,208 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.66 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 94.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,209 INFO L168 Benchmark]: Boogie Preprocessor took 29.66 ms. Allocated memory is still 140.0 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,210 INFO L168 Benchmark]: RCFGBuilder took 408.05 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 93.4 MB in the beginning and 171.9 MB in the end (delta: -78.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,210 INFO L168 Benchmark]: TraceAbstraction took 69242.71 ms. Allocated memory was 206.0 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 171.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 853.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:31:47,215 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.66 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 94.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.66 ms. Allocated memory is still 140.0 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.05 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 93.4 MB in the beginning and 171.9 MB in the end (delta: -78.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69242.71 ms. Allocated memory was 206.0 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 171.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 853.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 68.9s, OverallIterations: 20, TraceHistogramMax: 110, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 784 SDtfs, 1691 SDslu, 6923 SDs, 0 SdLazy, 14139 SolverSat, 2015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12577 GetRequests, 11843 SyntacticMatches, 0 SemanticMatches, 734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10074 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 621 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 19559 NumberOfCodeBlocks, 18392 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 18311 ConstructedInterpolants, 0 QuantifiedInterpolants, 21351573 SizeOfPredicates, 125 NumberOfNonLiveVariables, 18447 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 36 InterpolantComputations, 2 PerfectInterpolantSequences, 487116/536830 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...