/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_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:43:27,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:43:27,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:43:27,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:43:27,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:43:27,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:43:27,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:43:27,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:43:27,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:43:27,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:43:27,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:43:27,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:43:27,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:43:27,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:43:27,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:43:27,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:43:27,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:43:27,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:43:27,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:43:27,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:43:27,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:43:27,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:43:27,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:43:27,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:43:27,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:43:27,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:43:27,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:43:27,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:43:27,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:43:27,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:43:27,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:43:27,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:43:27,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:43:27,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:43:27,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:43:27,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:43:27,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:43:27,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:43:27,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:43:27,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:43:27,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:43:27,531 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:43:27,546 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:43:27,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:43:27,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:43:27,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:43:27,548 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:43:27,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:43:27,549 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:43:27,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:43:27,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:43:27,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:43:27,550 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:43:27,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:43:27,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:43:27,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:43:27,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:43:27,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:43:27,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:43:27,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:43:27,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:43:27,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:43:27,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:43:27,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:43:27,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:43:27,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:43:27,553 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:43:27,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:43:27,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:43:27,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:43:27,884 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:43:27,885 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:43:27,885 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-07-20 05:43:27,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0894e378e/ecbbd469a0c4469d9993792ab46d4d5e/FLAG7716fb40e [2020-07-20 05:43:28,462 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:43:28,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-07-20 05:43:28,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0894e378e/ecbbd469a0c4469d9993792ab46d4d5e/FLAG7716fb40e [2020-07-20 05:43:28,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0894e378e/ecbbd469a0c4469d9993792ab46d4d5e [2020-07-20 05:43:28,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:43:28,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:43:28,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:28,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:43:28,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:43:28,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:28" (1/1) ... [2020-07-20 05:43:28,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539a3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:28, skipping insertion in model container [2020-07-20 05:43:28,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:28" (1/1) ... [2020-07-20 05:43:28,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:43:28,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:43:29,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:29,034 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:43:29,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:29,067 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:43:29,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29 WrapperNode [2020-07-20 05:43:29,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:29,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:43:29,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:43:29,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:43:29,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (1/1) ... [2020-07-20 05:43:29,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:43:29,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:43:29,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:43:29,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:43:29,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (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:43:29,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:43:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:43:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-20 05:43:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-20 05:43:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:43:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:43:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:43:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-20 05:43:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-20 05:43:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:43:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:43:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:43:29,481 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:43:29,481 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 05:43:29,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:29 BoogieIcfgContainer [2020-07-20 05:43:29,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:43:29,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:43:29,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:43:29,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:43:29,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:43:28" (1/3) ... [2020-07-20 05:43:29,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42006b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:29, skipping insertion in model container [2020-07-20 05:43:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:29" (2/3) ... [2020-07-20 05:43:29,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42006b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:29, skipping insertion in model container [2020-07-20 05:43:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:29" (3/3) ... [2020-07-20 05:43:29,518 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-07-20 05:43:29,547 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:43:29,556 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:43:29,571 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:43:29,607 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:43:29,608 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:43:29,608 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:43:29,608 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:43:29,608 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:43:29,608 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:43:29,608 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:43:29,609 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:43:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-20 05:43:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 05:43:29,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:29,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:29,636 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-20 05:43:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:29,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612880352] [2020-07-20 05:43:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:29,887 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:43:29,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612880352] [2020-07-20 05:43:29,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:29,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:29,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958944167] [2020-07-20 05:43:29,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:29,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:29,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:29,915 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-20 05:43:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:30,023 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-20 05:43:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:30,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 05:43:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:30,038 INFO L225 Difference]: With dead ends: 44 [2020-07-20 05:43:30,038 INFO L226 Difference]: Without dead ends: 30 [2020-07-20 05:43:30,045 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:43:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-20 05:43:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-20 05:43:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:43:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:43:30,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-20 05:43:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:30,101 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:43:30,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:43:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:43:30,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:30,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:30,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:43:30,105 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-20 05:43:30,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:30,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332637087] [2020-07-20 05:43:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,172 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:43:30,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332637087] [2020-07-20 05:43:30,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:30,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:30,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231864764] [2020-07-20 05:43:30,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:30,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:30,177 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-20 05:43:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:30,244 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-20 05:43:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:30,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:43:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:30,247 INFO L225 Difference]: With dead ends: 36 [2020-07-20 05:43:30,247 INFO L226 Difference]: Without dead ends: 32 [2020-07-20 05:43:30,249 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:43:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-20 05:43:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-20 05:43:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:43:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:43:30,259 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-20 05:43:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:30,260 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:43:30,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:43:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 05:43:30,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:30,262 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:43:30,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:43:30,263 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-20 05:43:30,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:30,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719555637] [2020-07-20 05:43:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:30,439 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:43:30,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719555637] [2020-07-20 05:43:30,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032297721] [2020-07-20 05:43:30,440 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1258ac3 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:43:30,490 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1258ac3 issued 3 check-sat command(s) [2020-07-20 05:43:30,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:30,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:30,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:30,585 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:43:30,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:30,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-20 05:43:30,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062709675] [2020-07-20 05:43:30,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 05:43:30,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 05:43:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-20 05:43:30,588 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-20 05:43:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:30,815 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-20 05:43:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:43:30,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-20 05:43:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:30,817 INFO L225 Difference]: With dead ends: 58 [2020-07-20 05:43:30,817 INFO L226 Difference]: Without dead ends: 34 [2020-07-20 05:43:30,819 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:43:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-20 05:43:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-20 05:43:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-20 05:43:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-20 05:43:30,828 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-20 05:43:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:30,829 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-20 05:43:30,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 05:43:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-20 05:43:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:43:30,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:30,831 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:43:31,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 05:43:31,047 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-20 05:43:31,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:31,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163561142] [2020-07-20 05:43:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,178 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:43:31,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163561142] [2020-07-20 05:43:31,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760062380] [2020-07-20 05:43:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4562fa0 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:43:31,210 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4562fa0 issued 3 check-sat command(s) [2020-07-20 05:43:31,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:31,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:31,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:31,250 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:43:31,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:31,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 05:43:31,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138548388] [2020-07-20 05:43:31,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:43:31,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:31,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:43:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:43:31,253 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-20 05:43:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:31,441 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-20 05:43:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 05:43:31,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 05:43:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:31,446 INFO L225 Difference]: With dead ends: 54 [2020-07-20 05:43:31,446 INFO L226 Difference]: Without dead ends: 50 [2020-07-20 05:43:31,447 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:43:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-20 05:43:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-20 05:43:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 05:43:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-20 05:43:31,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-20 05:43:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:31,460 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-20 05:43:31,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:43:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-20 05:43:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 05:43:31,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:31,463 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:43:31,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:31,680 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:31,680 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-20 05:43:31,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:31,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666689359] [2020-07-20 05:43:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:31,832 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:43:31,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666689359] [2020-07-20 05:43:31,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137241411] [2020-07-20 05:43:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a78c7ae 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:43:31,874 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a78c7ae issued 3 check-sat command(s) [2020-07-20 05:43:31,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:31,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:43:31,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:31,942 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:43:31,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:31,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-20 05:43:31,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24271096] [2020-07-20 05:43:31,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 05:43:31,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:31,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 05:43:31,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:43:31,946 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-20 05:43:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:32,242 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-20 05:43:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 05:43:32,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 05:43:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:32,246 INFO L225 Difference]: With dead ends: 108 [2020-07-20 05:43:32,246 INFO L226 Difference]: Without dead ends: 66 [2020-07-20 05:43:32,248 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:43:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-20 05:43:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-20 05:43:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 05:43:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-20 05:43:32,264 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-20 05:43:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:32,264 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-20 05:43:32,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 05:43:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-20 05:43:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:43:32,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:32,269 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:43:32,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:32,483 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-20 05:43:32,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:32,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618657584] [2020-07-20 05:43:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:32,623 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:43:32,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618657584] [2020-07-20 05:43:32,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143519843] [2020-07-20 05:43:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@68d2984e 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:43:32,658 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@68d2984e issued 3 check-sat command(s) [2020-07-20 05:43:32,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:32,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:43:32,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:32,730 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:43:32,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:32,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-20 05:43:32,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416527886] [2020-07-20 05:43:32,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 05:43:32,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 05:43:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:43:32,732 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-20 05:43:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:33,139 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-20 05:43:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 05:43:33,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-20 05:43:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:33,144 INFO L225 Difference]: With dead ends: 180 [2020-07-20 05:43:33,144 INFO L226 Difference]: Without dead ends: 120 [2020-07-20 05:43:33,147 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:43:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-20 05:43:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-20 05:43:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-20 05:43:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-20 05:43:33,172 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-20 05:43:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:33,173 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-20 05:43:33,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 05:43:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-20 05:43:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-20 05:43:33,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:33,177 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:43:33,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:33,391 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-20 05:43:33,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:33,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678514779] [2020-07-20 05:43:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:33,527 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:43:33,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678514779] [2020-07-20 05:43:33,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329778300] [2020-07-20 05:43:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc7879 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:43:33,583 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc7879 issued 3 check-sat command(s) [2020-07-20 05:43:33,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:33,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:43:33,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:33,712 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:43:33,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:33,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-20 05:43:33,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534064922] [2020-07-20 05:43:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 05:43:33,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 05:43:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-20 05:43:33,715 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-20 05:43:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:34,277 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-20 05:43:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 05:43:34,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-20 05:43:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:34,281 INFO L225 Difference]: With dead ends: 258 [2020-07-20 05:43:34,281 INFO L226 Difference]: Without dead ends: 158 [2020-07-20 05:43:34,283 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:43:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-20 05:43:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-20 05:43:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 05:43:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-20 05:43:34,310 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-20 05:43:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:34,310 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-20 05:43:34,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 05:43:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-20 05:43:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-20 05:43:34,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:34,315 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:43:34,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 05:43:34,530 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-20 05:43:34,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:34,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54454468] [2020-07-20 05:43:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:34,747 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:43:34,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54454468] [2020-07-20 05:43:34,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948851775] [2020-07-20 05:43:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6a951a12 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:43:34,815 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6a951a12 issued 3 check-sat command(s) [2020-07-20 05:43:34,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:43:34,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:34,942 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:43:34,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:34,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-20 05:43:34,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578240133] [2020-07-20 05:43:34,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:43:34,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:43:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-20 05:43:34,948 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-20 05:43:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:35,563 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-20 05:43:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-20 05:43:35,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-20 05:43:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:35,568 INFO L225 Difference]: With dead ends: 243 [2020-07-20 05:43:35,568 INFO L226 Difference]: Without dead ends: 110 [2020-07-20 05:43:35,574 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:43:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-20 05:43:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-20 05:43:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 05:43:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 05:43:35,606 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-20 05:43:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:35,607 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 05:43:35,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:43:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 05:43:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 05:43:35,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:35,613 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:43:35,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:35,827 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-20 05:43:35,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:35,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077141768] [2020-07-20 05:43:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:36,123 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:43:36,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077141768] [2020-07-20 05:43:36,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584408320] [2020-07-20 05:43:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1248ad06 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:43:36,176 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1248ad06 issued 3 check-sat command(s) [2020-07-20 05:43:36,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:36,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:43:36,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-07-20 05:43:36,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:36,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-20 05:43:36,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800307775] [2020-07-20 05:43:36,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 05:43:36,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 05:43:36,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-07-20 05:43:36,269 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 15 states. [2020-07-20 05:43:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:36,755 INFO L93 Difference]: Finished difference Result 172 states and 251 transitions. [2020-07-20 05:43:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-20 05:43:36,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-20 05:43:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:36,758 INFO L225 Difference]: With dead ends: 172 [2020-07-20 05:43:36,758 INFO L226 Difference]: Without dead ends: 96 [2020-07-20 05:43:36,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-07-20 05:43:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-20 05:43:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-07-20 05:43:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-20 05:43:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2020-07-20 05:43:36,770 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 123 [2020-07-20 05:43:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:36,771 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2020-07-20 05:43:36,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 05:43:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2020-07-20 05:43:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-20 05:43:36,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:36,774 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:36,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:37,000 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1830253150, now seen corresponding path program 2 times [2020-07-20 05:43:37,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:37,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915551056] [2020-07-20 05:43:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 110 proven. 86 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-07-20 05:43:37,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915551056] [2020-07-20 05:43:37,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374280608] [2020-07-20 05:43:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fab270f 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:43:37,349 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fab270f issued 3 check-sat command(s) [2020-07-20 05:43:37,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:37,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:43:37,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 78 proven. 106 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-07-20 05:43:37,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:37,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-07-20 05:43:37,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483368496] [2020-07-20 05:43:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 05:43:37,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 05:43:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-20 05:43:37,528 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 18 states. [2020-07-20 05:43:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:38,133 INFO L93 Difference]: Finished difference Result 204 states and 330 transitions. [2020-07-20 05:43:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 05:43:38,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2020-07-20 05:43:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:38,136 INFO L225 Difference]: With dead ends: 204 [2020-07-20 05:43:38,136 INFO L226 Difference]: Without dead ends: 98 [2020-07-20 05:43:38,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:43:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-20 05:43:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-07-20 05:43:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-20 05:43:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-07-20 05:43:38,149 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 137 [2020-07-20 05:43:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:38,149 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-07-20 05:43:38,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 05:43:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-07-20 05:43:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 05:43:38,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:38,152 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:38,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 05:43:38,366 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 1 times [2020-07-20 05:43:38,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:38,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646138160] [2020-07-20 05:43:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-07-20 05:43:38,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646138160] [2020-07-20 05:43:38,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683503562] [2020-07-20 05:43:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@dd6d725 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:43:38,923 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@dd6d725 issued 4 check-sat command(s) [2020-07-20 05:43:38,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:38,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:43:38,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2020-07-20 05:43:39,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:39,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2020-07-20 05:43:39,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740965980] [2020-07-20 05:43:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 05:43:39,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 05:43:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:43:39,014 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 17 states. [2020-07-20 05:43:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:39,533 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2020-07-20 05:43:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-20 05:43:39,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2020-07-20 05:43:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:39,536 INFO L225 Difference]: With dead ends: 202 [2020-07-20 05:43:39,536 INFO L226 Difference]: Without dead ends: 114 [2020-07-20 05:43:39,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:43:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-20 05:43:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-07-20 05:43:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-20 05:43:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2020-07-20 05:43:39,548 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 150 [2020-07-20 05:43:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:39,549 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2020-07-20 05:43:39,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 05:43:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2020-07-20 05:43:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 05:43:39,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:39,552 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:39,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:39,767 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 2 times [2020-07-20 05:43:39,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:39,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465786017] [2020-07-20 05:43:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@31119eb [2020-07-20 05:43:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:43:39,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:43:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:43:39,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:43:39,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:43:39,849 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:43:39,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 05:43:39,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:43:39 BoogieIcfgContainer [2020-07-20 05:43:39,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:43:39,911 INFO L168 Benchmark]: Toolchain (without parser) took 11088.22 ms. Allocated memory was 143.7 MB in the beginning and 354.4 MB in the end (delta: 210.8 MB). Free memory was 100.8 MB in the beginning and 145.6 MB in the end (delta: -44.8 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2020-07-20 05:43:39,912 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-20 05:43:39,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.09 ms. Allocated memory is still 143.7 MB. Free memory was 100.4 MB in the beginning and 90.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:43:39,914 INFO L168 Benchmark]: Boogie Preprocessor took 115.02 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 180.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-20 05:43:39,914 INFO L168 Benchmark]: RCFGBuilder took 302.69 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 166.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:43:39,915 INFO L168 Benchmark]: TraceAbstraction took 10410.79 ms. Allocated memory was 200.8 MB in the beginning and 354.4 MB in the end (delta: 153.6 MB). Free memory was 165.5 MB in the beginning and 145.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 173.5 MB. Max. memory is 7.1 GB. [2020-07-20 05:43:39,919 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.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.09 ms. Allocated memory is still 143.7 MB. Free memory was 100.4 MB in the beginning and 90.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 115.02 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 180.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.69 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 166.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10410.79 ms. Allocated memory was 200.8 MB in the beginning and 354.4 MB in the end (delta: 153.6 MB). Free memory was 165.5 MB in the beginning and 145.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 173.5 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 = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 12, TraceHistogramMax: 13, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 342 SDtfs, 493 SDslu, 2103 SDs, 0 SdLazy, 2957 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1080 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1363 ConstructedInterpolants, 0 QuantifiedInterpolants, 218669 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1326 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2426/3144 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...