/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.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:53:09,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:53:09,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:53:10,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:53:10,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:53:10,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:53:10,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:53:10,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:53:10,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:53:10,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:53:10,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:53:10,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:53:10,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:53:10,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:53:10,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:53:10,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:53:10,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:53:10,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:53:10,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:53:10,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:53:10,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:53:10,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:53:10,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:53:10,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:53:10,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:53:10,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:53:10,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:53:10,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:53:10,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:53:10,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:53:10,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:53:10,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:53:10,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:53:10,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:53:10,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:53:10,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:53:10,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:53:10,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:53:10,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:53:10,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:53:10,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:53:10,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:53:10,110 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:53:10,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:53:10,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:53:10,114 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:53:10,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:53:10,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:53:10,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:53:10,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:53:10,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:53:10,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:53:10,117 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:53:10,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:53:10,118 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:53:10,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:53:10,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:53:10,119 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:53:10,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:53:10,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:53:10,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:53:10,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:53:10,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:53:10,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:53:10,120 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:53:10,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:53:10,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:53:10,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:53:10,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:53:10,651 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:53:10,652 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-09-04 21:53:10,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11813fed3/5f2259b116c2461093af60776655435a/FLAG2883b6961 [2020-09-04 21:53:11,281 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:53:11,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-09-04 21:53:11,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11813fed3/5f2259b116c2461093af60776655435a/FLAG2883b6961 [2020-09-04 21:53:11,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11813fed3/5f2259b116c2461093af60776655435a [2020-09-04 21:53:11,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:53:11,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:53:11,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:11,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:53:11,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:53:11,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:11,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb2e3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11, skipping insertion in model container [2020-09-04 21:53:11,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:11,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:53:11,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:53:11,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:11,929 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:53:11,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:11,967 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:53:11,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11 WrapperNode [2020-09-04 21:53:11,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:11,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:53:11,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:53:11,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:53:11,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:11,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... [2020-09-04 21:53:12,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:53:12,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:53:12,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:53:12,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:53:12,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:53:12,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:53:12,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:53:12,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 21:53:12,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 21:53:12,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:53:12,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:53:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:53:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 21:53:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 21:53:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:53:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:53:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:53:12,452 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:53:12,453 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:53:12,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:12 BoogieIcfgContainer [2020-09-04 21:53:12,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:53:12,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:53:12,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:53:12,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:53:12,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:53:11" (1/3) ... [2020-09-04 21:53:12,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b97a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:12, skipping insertion in model container [2020-09-04 21:53:12,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:11" (2/3) ... [2020-09-04 21:53:12,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b97a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:12, skipping insertion in model container [2020-09-04 21:53:12,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:12" (3/3) ... [2020-09-04 21:53:12,469 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-09-04 21:53:12,482 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:53:12,494 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:53:12,521 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:53:12,558 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:53:12,558 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:53:12,559 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:53:12,559 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:53:12,559 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:53:12,559 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:53:12,560 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:53:12,560 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:53:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 21:53:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:53:12,638 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:12,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:12,640 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 21:53:12,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:12,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616462218] [2020-09-04 21:53:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:12,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:12,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:53:12,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616462218] [2020-09-04 21:53:12,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:12,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:12,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783055109] [2020-09-04 21:53:12,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:12,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:12,964 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 21:53:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:13,096 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 21:53:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:13,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:53:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:13,115 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:53:13,116 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:53:13,122 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-09-04 21:53:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:53:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:53:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:13,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 21:53:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:13,196 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:13,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:53:13,200 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:13,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:13,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:53:13,201 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 21:53:13,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:13,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866773756] [2020-09-04 21:53:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:53:13,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866773756] [2020-09-04 21:53:13,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:13,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:13,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390455610] [2020-09-04 21:53:13,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:13,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:13,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:13,353 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 21:53:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:13,478 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:53:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:13,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:53:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:13,484 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:53:13,484 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:53:13,487 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-09-04 21:53:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:53:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:53:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:13,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 21:53:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:13,503 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:13,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:53:13,506 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:13,506 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-09-04 21:53:13,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:53:13,506 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 21:53:13,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:13,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [687700877] [2020-09-04 21:53:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:13,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [687700877] [2020-09-04 21:53:13,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:13,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:13,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942469260] [2020-09-04 21:53:13,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:13,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:13,701 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 21:53:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:13,817 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 21:53:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:53:13,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:53:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:13,820 INFO L225 Difference]: With dead ends: 82 [2020-09-04 21:53:13,820 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:53:13,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:53:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 21:53:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:53:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:53:13,858 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 21:53:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:13,858 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:53:13,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:53:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:53:13,863 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:13,864 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:13,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:53:13,865 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 21:53:13,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:13,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184286891] [2020-09-04 21:53:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:13,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:14,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184286891] [2020-09-04 21:53:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:14,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813450811] [2020-09-04 21:53:14,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:14,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:14,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:14,040 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 21:53:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:14,264 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 21:53:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:14,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 21:53:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:14,268 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:53:14,268 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:53:14,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:53:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:53:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 21:53:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:53:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 21:53:14,287 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 21:53:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:14,288 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 21:53:14,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 21:53:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 21:53:14,291 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:14,291 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:14,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:53:14,292 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 21:53:14,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:14,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150074376] [2020-09-04 21:53:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:53:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:14,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150074376] [2020-09-04 21:53:14,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:14,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:53:14,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820199453] [2020-09-04 21:53:14,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:53:14,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:14,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:53:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:14,483 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 21:53:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:14,599 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 21:53:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:53:14,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 21:53:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:14,603 INFO L225 Difference]: With dead ends: 130 [2020-09-04 21:53:14,603 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:53:14,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:53:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:53:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:53:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 21:53:14,647 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 21:53:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:14,647 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 21:53:14,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:53:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 21:53:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:53:14,660 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:14,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:14,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:53:14,665 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 21:53:14,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:14,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285684352] [2020-09-04 21:53:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 21:53:14,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285684352] [2020-09-04 21:53:14,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:14,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:14,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116532160] [2020-09-04 21:53:14,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:14,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:14,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:14,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:14,946 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 21:53:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:15,084 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 21:53:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:53:15,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:53:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:15,088 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:53:15,088 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:53:15,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:53:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 21:53:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 21:53:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 21:53:15,107 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 21:53:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:15,108 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 21:53:15,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 21:53:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:53:15,110 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:15,110 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:15,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:53:15,111 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 21:53:15,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:15,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [212409199] [2020-09-04 21:53:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:15,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [212409199] [2020-09-04 21:53:15,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:15,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:15,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305581867] [2020-09-04 21:53:15,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:15,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:15,252 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 21:53:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:15,526 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 21:53:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:53:15,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 21:53:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:15,530 INFO L225 Difference]: With dead ends: 118 [2020-09-04 21:53:15,530 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 21:53:15,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 21:53:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 21:53:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 21:53:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 21:53:15,589 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 21:53:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:15,590 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 21:53:15,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 21:53:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 21:53:15,594 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:15,595 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:15,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:53:15,595 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 21:53:15,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:15,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614990410] [2020-09-04 21:53:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:53:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:53:15,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614990410] [2020-09-04 21:53:15,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:15,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:15,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851699310] [2020-09-04 21:53:15,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:15,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:15,842 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 21:53:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:16,001 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 21:53:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:16,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 21:53:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:16,005 INFO L225 Difference]: With dead ends: 227 [2020-09-04 21:53:16,005 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 21:53:16,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 21:53:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 21:53:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 21:53:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 21:53:16,031 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 21:53:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:16,032 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 21:53:16,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 21:53:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:53:16,034 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:16,034 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:16,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:53:16,035 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 21:53:16,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:16,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395032682] [2020-09-04 21:53:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 21:53:16,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395032682] [2020-09-04 21:53:16,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:16,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:16,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365862770] [2020-09-04 21:53:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:16,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:16,229 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 21:53:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:16,497 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 21:53:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:53:16,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 21:53:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:16,501 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:53:16,502 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:53:16,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:53:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 21:53:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:53:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 21:53:16,531 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 21:53:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:16,531 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 21:53:16,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 21:53:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 21:53:16,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:16,535 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:16,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:53:16,535 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 21:53:16,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:16,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516216384] [2020-09-04 21:53:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-09-04 21:53:16,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516216384] [2020-09-04 21:53:16,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:16,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:16,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775998394] [2020-09-04 21:53:16,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:16,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:16,827 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 21:53:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:17,288 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 21:53:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:53:17,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 21:53:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:17,293 INFO L225 Difference]: With dead ends: 265 [2020-09-04 21:53:17,293 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:53:17,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:53:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-09-04 21:53:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 21:53:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-09-04 21:53:17,314 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 105 [2020-09-04 21:53:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:17,314 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-09-04 21:53:17,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-09-04 21:53:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-09-04 21:53:17,316 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:17,316 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 21:53:17,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:53:17,317 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1951493560, now seen corresponding path program 1 times [2020-09-04 21:53:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:17,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [882030256] [2020-09-04 21:53:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:53:17,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:53:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:53:17,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:53:17,374 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:53:17,374 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:53:17,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:53:17,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:53:17 BoogieIcfgContainer [2020-09-04 21:53:17,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:53:17,438 INFO L168 Benchmark]: Toolchain (without parser) took 5784.82 ms. Allocated memory was 137.4 MB in the beginning and 298.3 MB in the end (delta: 161.0 MB). Free memory was 102.3 MB in the beginning and 237.1 MB in the end (delta: -134.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:17,439 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 137.4 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:53:17,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.93 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:17,441 INFO L168 Benchmark]: Boogie Preprocessor took 141.91 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 92.4 MB in the beginning and 178.9 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:17,441 INFO L168 Benchmark]: RCFGBuilder took 347.26 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 164.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:17,442 INFO L168 Benchmark]: TraceAbstraction took 4974.14 ms. Allocated memory was 200.3 MB in the beginning and 298.3 MB in the end (delta: 98.0 MB). Free memory was 163.5 MB in the beginning and 237.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:17,446 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.34 ms. Allocated memory is still 137.4 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.93 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.91 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 92.4 MB in the beginning and 178.9 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.26 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 164.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4974.14 ms. Allocated memory was 200.3 MB in the beginning and 298.3 MB in the end (delta: 98.0 MB). Free memory was 163.5 MB in the beginning and 237.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 24.4 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 = 4; VAL [x=4] [L37] CALL, EXPR fibo1(x) 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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=3, x=4] [L37] int result = fibo1(x); VAL [fibo1(x)=3, result=3, x=4] [L38] COND TRUE result == 3 VAL [result=3, x=4] [L39] __VERIFIER_error() VAL [result=3, x=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 418 SDslu, 1642 SDs, 0 SdLazy, 1050 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 56021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 207/306 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...