/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_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:54:02,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:54:02,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:54:02,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:54:02,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:54:02,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:54:02,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:54:02,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:54:02,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:54:02,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:54:02,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:54:02,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:54:02,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:54:02,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:54:02,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:54:02,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:54:02,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:54:02,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:54:02,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:54:02,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:54:02,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:54:02,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:54:02,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:54:02,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:54:02,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:54:02,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:54:02,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:54:02,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:54:02,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:54:02,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:54:02,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:54:02,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:54:02,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:54:02,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:54:02,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:54:02,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:54:02,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:54:02,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:54:02,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:54:02,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:54:02,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:54:02,463 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:54:02,481 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:54:02,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:54:02,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:54:02,484 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:54:02,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:54:02,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:54:02,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:54:02,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:54:02,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:54:02,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:54:02,486 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:54:02,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:54:02,487 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:54:02,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:54:02,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:54:02,488 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:54:02,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:54:02,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:54:02,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:54:02,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:54:02,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:54:02,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:54:02,490 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:54:02,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:54:02,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:54:03,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:54:03,007 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:54:03,007 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:54:03,009 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-09-04 21:54:03,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0287d3121/824504861081412ab253123d438720b9/FLAG8db0d641d [2020-09-04 21:54:03,807 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:54:03,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-09-04 21:54:03,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0287d3121/824504861081412ab253123d438720b9/FLAG8db0d641d [2020-09-04 21:54:04,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0287d3121/824504861081412ab253123d438720b9 [2020-09-04 21:54:04,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:54:04,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:54:04,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:04,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:54:04,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:54:04,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b94322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04, skipping insertion in model container [2020-09-04 21:54:04,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:54:04,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:54:04,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:04,413 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:54:04,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:04,455 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:54:04,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04 WrapperNode [2020-09-04 21:54:04,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:04,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:54:04,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:54:04,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:54:04,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (1/1) ... [2020-09-04 21:54:04,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:54:04,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:54:04,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:54:04,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:54:04,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (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:54:04,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:54:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:54:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 21:54:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 21:54:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:54:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:54:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:54:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 21:54:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 21:54:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:54:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:54:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:54:05,045 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:54:05,046 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:54:05,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:05 BoogieIcfgContainer [2020-09-04 21:54:05,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:54:05,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:54:05,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:54:05,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:54:05,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:54:04" (1/3) ... [2020-09-04 21:54:05,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0efb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:05, skipping insertion in model container [2020-09-04 21:54:05,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:04" (2/3) ... [2020-09-04 21:54:05,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0efb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:05, skipping insertion in model container [2020-09-04 21:54:05,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:05" (3/3) ... [2020-09-04 21:54:05,068 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-09-04 21:54:05,085 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:54:05,101 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:54:05,130 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:54:05,176 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:54:05,177 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:54:05,177 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:54:05,178 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:54:05,178 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:54:05,178 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:54:05,179 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:54:05,179 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:54:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 21:54:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:54:05,230 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:05,232 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:54:05,233 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:05,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 21:54:05,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:05,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935077996] [2020-09-04 21:54:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,592 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:54:05,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935077996] [2020-09-04 21:54:05,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:05,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:05,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32018589] [2020-09-04 21:54:05,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:05,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:05,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:05,628 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 21:54:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:05,795 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 21:54:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:05,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:54:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:05,818 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:54:05,819 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:54:05,826 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:54:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:54:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:54:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:54:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:54:05,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 21:54:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:05,920 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:54:05,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:54:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:54:05,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:05,924 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:54:05,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:54:05,925 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 21:54:05,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:05,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [837645977] [2020-09-04 21:54:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,112 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:54:06,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [837645977] [2020-09-04 21:54:06,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:06,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:06,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760322893] [2020-09-04 21:54:06,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:06,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:06,129 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 21:54:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:06,273 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:54:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:06,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:54:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:06,279 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:54:06,282 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:54:06,285 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:54:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:54:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:54:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:54:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:54:06,331 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 21:54:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:06,331 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:54:06,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:54:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:54:06,336 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:06,336 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:54:06,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:54:06,337 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 21:54:06,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:06,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306475566] [2020-09-04 21:54:06,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:54:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,546 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:54:06,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306475566] [2020-09-04 21:54:06,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:06,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738902592] [2020-09-04 21:54:06,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:06,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:06,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:06,551 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 21:54:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:06,670 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 21:54:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:54:06,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:54:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:06,675 INFO L225 Difference]: With dead ends: 82 [2020-09-04 21:54:06,675 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:54:06,677 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:54:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:54:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 21:54:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:54:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:54:06,695 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 21:54:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:06,696 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:54:06,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:54:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:54:06,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:06,699 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:54:06,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:54:06,700 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 21:54:06,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:06,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [994760110] [2020-09-04 21:54:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:06,870 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:54:06,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [994760110] [2020-09-04 21:54:06,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:06,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:06,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965155701] [2020-09-04 21:54:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:06,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:06,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:06,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:06,877 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 21:54:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:07,137 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 21:54:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:54:07,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 21:54:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:07,142 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:54:07,142 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:54:07,144 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:54:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:54:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 21:54:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:54:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 21:54:07,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 21:54:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:07,167 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 21:54:07,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 21:54:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 21:54:07,170 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:07,171 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:54:07,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:54:07,172 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 21:54:07,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:07,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [480623070] [2020-09-04 21:54:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:54:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:54:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,404 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:54:07,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [480623070] [2020-09-04 21:54:07,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:07,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:54:07,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239693919] [2020-09-04 21:54:07,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:54:07,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:54:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:07,408 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 21:54:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:07,530 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 21:54:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:54:07,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 21:54:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:07,535 INFO L225 Difference]: With dead ends: 130 [2020-09-04 21:54:07,535 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:54:07,543 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:54:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:54:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:54:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:54:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 21:54:07,581 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 21:54:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:07,581 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 21:54:07,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:54:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 21:54:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:54:07,585 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:07,585 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:54:07,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:54:07,586 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 21:54:07,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:07,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127538974] [2020-09-04 21:54:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,779 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:54:07,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127538974] [2020-09-04 21:54:07,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:54:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135124299] [2020-09-04 21:54:07,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:54:07,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:54:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:07,784 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 21:54:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:07,926 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 21:54:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:54:07,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:54:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:07,931 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:54:07,932 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:54:07,934 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:54:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:54:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 21:54:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 21:54:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 21:54:07,964 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 21:54:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:07,965 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 21:54:07,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:54:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 21:54:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:54:07,978 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:07,978 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:54:07,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:54:07,979 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:07,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 21:54:07,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:07,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724651049] [2020-09-04 21:54:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,279 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:54:08,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724651049] [2020-09-04 21:54:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:54:08,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984702930] [2020-09-04 21:54:08,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:54:08,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:08,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:54:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:08,285 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 21:54:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:08,600 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 21:54:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:54:08,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 21:54:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:08,605 INFO L225 Difference]: With dead ends: 118 [2020-09-04 21:54:08,606 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 21:54:08,607 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:54:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 21:54:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 21:54:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 21:54:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 21:54:08,656 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 21:54:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:08,657 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 21:54:08,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:54:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 21:54:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 21:54:08,660 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:08,660 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:54:08,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:54:08,661 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 21:54:08,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:08,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038151661] [2020-09-04 21:54:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:54:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,868 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:54:08,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038151661] [2020-09-04 21:54:08,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:08,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:54:08,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860793234] [2020-09-04 21:54:08,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:54:08,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:54:08,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:08,872 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 21:54:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:09,040 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 21:54:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:54:09,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 21:54:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:09,045 INFO L225 Difference]: With dead ends: 227 [2020-09-04 21:54:09,046 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 21:54:09,048 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:54:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 21:54:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 21:54:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 21:54:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 21:54:09,082 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 21:54:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:09,083 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 21:54:09,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:54:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 21:54:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:54:09,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:09,089 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:54:09,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:54:09,090 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 21:54:09,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:09,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254879499] [2020-09-04 21:54:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,330 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:54:09,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254879499] [2020-09-04 21:54:09,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:09,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:54:09,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61853932] [2020-09-04 21:54:09,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:54:09,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:54:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:09,334 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 21:54:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:09,674 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 21:54:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:54:09,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 21:54:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:09,679 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:54:09,679 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:54:09,682 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:54:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:54:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 21:54:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:54:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 21:54:09,716 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 21:54:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:09,716 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 21:54:09,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:54:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 21:54:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 21:54:09,721 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:09,721 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:54:09,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:54:09,722 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 21:54:09,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:09,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692173793] [2020-09-04 21:54:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,066 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:54:10,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692173793] [2020-09-04 21:54:10,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:10,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:54:10,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379419685] [2020-09-04 21:54:10,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:54:10,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:54:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:54:10,071 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 21:54:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:10,594 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 21:54:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:54:10,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 21:54:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:10,601 INFO L225 Difference]: With dead ends: 265 [2020-09-04 21:54:10,602 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:54:10,605 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:54:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:54:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 21:54:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:54:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 21:54:10,631 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 21:54:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:10,632 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 21:54:10,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:54:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 21:54:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:54:10,636 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:10,636 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:10,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:54:10,637 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 21:54:10,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:10,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597479666] [2020-09-04 21:54:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 21:54:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-09-04 21:54:11,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597479666] [2020-09-04 21:54:11,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:11,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:54:11,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154421472] [2020-09-04 21:54:11,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:54:11,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:54:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:11,052 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 21:54:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:11,349 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 21:54:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:54:11,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 21:54:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:11,355 INFO L225 Difference]: With dead ends: 193 [2020-09-04 21:54:11,356 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 21:54:11,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 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:54:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 21:54:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 21:54:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 21:54:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 21:54:11,382 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 21:54:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:11,384 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 21:54:11,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:54:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 21:54:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:54:11,387 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:11,387 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:11,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:54:11,388 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 21:54:11,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:11,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171253596] [2020-09-04 21:54:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 21:54:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-09-04 21:54:11,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171253596] [2020-09-04 21:54:11,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:11,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:54:11,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776805992] [2020-09-04 21:54:11,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:54:11,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:54:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:54:11,933 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 21:54:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:12,478 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 21:54:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:54:12,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 21:54:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:12,481 INFO L225 Difference]: With dead ends: 241 [2020-09-04 21:54:12,481 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:54:12,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:54:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:54:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 21:54:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:54:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 21:54:12,509 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 21:54:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:12,510 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 21:54:12,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:54:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 21:54:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:54:12,513 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:12,513 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:12,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:54:12,514 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 21:54:12,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:12,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632213352] [2020-09-04 21:54:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 26 proven. 126 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2020-09-04 21:54:12,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632213352] [2020-09-04 21:54:12,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:54:12,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610374431] [2020-09-04 21:54:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:54:12,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:54:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:12,837 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 10 states. [2020-09-04 21:54:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:13,178 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2020-09-04 21:54:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:54:13,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2020-09-04 21:54:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:13,183 INFO L225 Difference]: With dead ends: 244 [2020-09-04 21:54:13,184 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 21:54:13,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:54:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 21:54:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-09-04 21:54:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 21:54:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 287 transitions. [2020-09-04 21:54:13,233 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 287 transitions. Word has length 140 [2020-09-04 21:54:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:13,234 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 287 transitions. [2020-09-04 21:54:13,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:54:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 287 transitions. [2020-09-04 21:54:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:54:13,238 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:13,239 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, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:13,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:54:13,239 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 3 times [2020-09-04 21:54:13,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:13,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1315534038] [2020-09-04 21:54:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 179 proven. 163 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-09-04 21:54:13,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1315534038] [2020-09-04 21:54:13,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:13,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:54:13,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073968242] [2020-09-04 21:54:13,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:54:13,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:54:13,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:54:13,822 INFO L87 Difference]: Start difference. First operand 213 states and 287 transitions. Second operand 14 states. [2020-09-04 21:54:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:14,422 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2020-09-04 21:54:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:54:14,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-09-04 21:54:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:14,427 INFO L225 Difference]: With dead ends: 470 [2020-09-04 21:54:14,428 INFO L226 Difference]: Without dead ends: 257 [2020-09-04 21:54:14,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:54:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-09-04 21:54:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2020-09-04 21:54:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-09-04 21:54:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2020-09-04 21:54:14,464 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 193 [2020-09-04 21:54:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:14,465 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2020-09-04 21:54:14,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:54:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2020-09-04 21:54:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-09-04 21:54:14,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:14,471 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:14,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:54:14,472 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1293350858, now seen corresponding path program 4 times [2020-09-04 21:54:14,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:14,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [556351863] [2020-09-04 21:54:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:14,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:54:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 199 proven. 672 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-09-04 21:54:15,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [556351863] [2020-09-04 21:54:15,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:15,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:54:15,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456967607] [2020-09-04 21:54:15,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:54:15,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:15,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:54:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:54:15,353 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 14 states. [2020-09-04 21:54:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:16,158 INFO L93 Difference]: Finished difference Result 534 states and 785 transitions. [2020-09-04 21:54:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:54:16,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 351 [2020-09-04 21:54:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:16,165 INFO L225 Difference]: With dead ends: 534 [2020-09-04 21:54:16,165 INFO L226 Difference]: Without dead ends: 301 [2020-09-04 21:54:16,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:54:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-09-04 21:54:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 265. [2020-09-04 21:54:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-04 21:54:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 352 transitions. [2020-09-04 21:54:16,219 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 352 transitions. Word has length 351 [2020-09-04 21:54:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:16,219 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 352 transitions. [2020-09-04 21:54:16,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:54:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 352 transitions. [2020-09-04 21:54:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 21:54:16,226 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:16,226 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:16,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:54:16,226 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2113087688, now seen corresponding path program 5 times [2020-09-04 21:54:16,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:16,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303521981] [2020-09-04 21:54:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:16,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 261 proven. 446 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2020-09-04 21:54:17,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303521981] [2020-09-04 21:54:17,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:17,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:54:17,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048800259] [2020-09-04 21:54:17,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:54:17,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:17,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:54:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:54:17,126 INFO L87 Difference]: Start difference. First operand 265 states and 352 transitions. Second operand 16 states. [2020-09-04 21:54:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:18,009 INFO L93 Difference]: Finished difference Result 487 states and 692 transitions. [2020-09-04 21:54:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:54:18,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2020-09-04 21:54:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:18,014 INFO L225 Difference]: With dead ends: 487 [2020-09-04 21:54:18,014 INFO L226 Difference]: Without dead ends: 190 [2020-09-04 21:54:18,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:54:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-09-04 21:54:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2020-09-04 21:54:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-04 21:54:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2020-09-04 21:54:18,039 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 281 [2020-09-04 21:54:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:18,039 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2020-09-04 21:54:18,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:54:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2020-09-04 21:54:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 21:54:18,043 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:18,043 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, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:18,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:54:18,044 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 6 times [2020-09-04 21:54:18,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:18,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647482445] [2020-09-04 21:54:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:54:18,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:54:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:54:18,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:54:18,155 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:54:18,156 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:54:18,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:54:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:54:18 BoogieIcfgContainer [2020-09-04 21:54:18,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:54:18,246 INFO L168 Benchmark]: Toolchain (without parser) took 14132.51 ms. Allocated memory was 137.4 MB in the beginning and 490.7 MB in the end (delta: 353.4 MB). Free memory was 100.2 MB in the beginning and 286.7 MB in the end (delta: -186.5 MB). Peak memory consumption was 166.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,251 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 137.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.12 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 90.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,259 INFO L168 Benchmark]: Boogie Preprocessor took 182.86 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 90.3 MB in the beginning and 181.5 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,259 INFO L168 Benchmark]: RCFGBuilder took 413.11 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 167.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,260 INFO L168 Benchmark]: TraceAbstraction took 13184.37 ms. Allocated memory was 202.9 MB in the beginning and 490.7 MB in the end (delta: 287.8 MB). Free memory was 167.0 MB in the beginning and 286.7 MB in the end (delta: -119.7 MB). Peak memory consumption was 168.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:18,265 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.33 ms. Allocated memory is still 137.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 343.12 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 90.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.86 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 90.3 MB in the beginning and 181.5 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.11 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 167.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13184.37 ms. Allocated memory was 202.9 MB in the beginning and 490.7 MB in the end (delta: 287.8 MB). Free memory was 167.0 MB in the beginning and 286.7 MB in the end (delta: -119.7 MB). Peak memory consumption was 168.1 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 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] [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 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-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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [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); VAL [\old(n)=5, \result=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [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 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-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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [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 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-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [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); VAL [\old(n)=6, \result=8, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); VAL [fibo1(x)=8, result=8, x=6] [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, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.9s, OverallIterations: 17, TraceHistogramMax: 21, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 747 SDtfs, 926 SDslu, 3923 SDs, 0 SdLazy, 3258 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 199 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1953 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 521295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 3765/5449 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...