/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_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:53:20,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:53:20,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:53:20,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:53:20,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:53:20,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:53:20,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:53:20,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:53:20,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:53:20,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:53:20,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:53:20,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:53:20,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:53:20,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:53:20,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:53:20,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:53:20,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:53:20,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:53:20,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:53:20,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:53:20,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:53:20,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:53:20,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:53:20,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:53:20,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:53:20,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:53:20,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:53:20,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:53:20,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:53:20,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:53:20,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:53:20,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:53:20,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:53:20,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:53:20,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:53:20,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:53:20,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:53:20,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:53:20,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:53:20,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:53:20,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:53:20,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:53:20,633 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:53:20,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:53:20,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:53:20,637 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:53:20,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:53:20,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:53:20,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:53:20,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:53:20,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:53:20,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:53:20,639 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:53:20,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:53:20,640 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:53:20,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:53:20,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:53:20,641 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:53:20,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:53:20,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:53:20,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:53:20,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:53:20,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:53:20,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:53:20,642 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:53:21,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:53:21,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:53:21,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:53:21,158 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:53:21,159 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:53:21,160 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-04 21:53:21,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98897e438/caa0156a6d7948f5a12fe425fe996b3d/FLAGb46f13058 [2020-09-04 21:53:21,846 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:53:21,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-04 21:53:21,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98897e438/caa0156a6d7948f5a12fe425fe996b3d/FLAGb46f13058 [2020-09-04 21:53:22,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98897e438/caa0156a6d7948f5a12fe425fe996b3d [2020-09-04 21:53:22,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:53:22,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:53:22,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:22,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:53:22,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:53:22,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce05b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22, skipping insertion in model container [2020-09-04 21:53:22,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:53:22,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:53:22,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:22,458 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:53:22,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:22,496 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:53:22,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22 WrapperNode [2020-09-04 21:53:22,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:22,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:53:22,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:53:22,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:53:22,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... [2020-09-04 21:53:22,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:53:22,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:53:22,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:53:22,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:53:22,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:53:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:53:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:53:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 21:53:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 21:53:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:53:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:53:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:53:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 21:53:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 21:53:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:53:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:53:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:53:22,984 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:53:22,985 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:53:22,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:22 BoogieIcfgContainer [2020-09-04 21:53:22,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:53:22,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:53:22,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:53:23,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:53:23,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:53:22" (1/3) ... [2020-09-04 21:53:23,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4120b621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:23, skipping insertion in model container [2020-09-04 21:53:23,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:22" (2/3) ... [2020-09-04 21:53:23,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4120b621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:23, skipping insertion in model container [2020-09-04 21:53:23,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:22" (3/3) ... [2020-09-04 21:53:23,005 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-09-04 21:53:23,021 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:53:23,036 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:53:23,065 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:53:23,104 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:53:23,105 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:53:23,105 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:53:23,105 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:53:23,105 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:53:23,106 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:53:23,106 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:53:23,106 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:53:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 21:53:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:53:23,152 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:23,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:23,158 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 21:53:23,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:23,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530110352] [2020-09-04 21:53:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:53:23,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530110352] [2020-09-04 21:53:23,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:23,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213782360] [2020-09-04 21:53:23,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:23,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:23,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:23,497 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 21:53:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:23,645 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 21:53:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:23,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:53:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:23,665 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:53:23,666 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:53:23,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:53:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:53:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:23,737 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 21:53:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:23,738 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:23,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:53:23,741 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:23,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:23,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:53:23,742 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:23,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 21:53:23,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:23,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921174008] [2020-09-04 21:53:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:53:23,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921174008] [2020-09-04 21:53:23,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:23,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:23,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884025518] [2020-09-04 21:53:23,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:23,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:23,842 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 21:53:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:23,925 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:53:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:23,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:53:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:23,929 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:53:23,929 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:53:23,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:53:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:53:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:23,944 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 21:53:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:23,945 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:23,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:53:23,947 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:23,947 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:23,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:53:23,948 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 21:53:23,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:23,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1421192972] [2020-09-04 21:53:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:24,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1421192972] [2020-09-04 21:53:24,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:24,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:24,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484447647] [2020-09-04 21:53:24,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:24,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:24,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:24,095 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 21:53:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:24,203 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 21:53:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:53:24,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:53:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:24,206 INFO L225 Difference]: With dead ends: 82 [2020-09-04 21:53:24,207 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:53:24,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:53:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 21:53:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:53:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:53:24,227 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 21:53:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:24,228 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:53:24,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:53:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:53:24,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:24,231 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:24,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:53:24,232 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 21:53:24,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:24,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550857082] [2020-09-04 21:53:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:24,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550857082] [2020-09-04 21:53:24,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:24,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:24,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724113541] [2020-09-04 21:53:24,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:24,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:24,416 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 21:53:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:24,659 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 21:53:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:24,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 21:53:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:24,664 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:53:24,664 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:53:24,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:53:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:53:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 21:53:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:53:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 21:53:24,689 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 21:53:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:24,690 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 21:53:24,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 21:53:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 21:53:24,693 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:24,693 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:24,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:53:24,694 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 21:53:24,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:24,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1830397939] [2020-09-04 21:53:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:53:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:24,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1830397939] [2020-09-04 21:53:24,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:24,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:53:24,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894198301] [2020-09-04 21:53:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:53:24,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:53:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:24,885 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 21:53:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:24,983 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 21:53:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:53:24,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 21:53:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:24,986 INFO L225 Difference]: With dead ends: 130 [2020-09-04 21:53:24,987 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:53:24,989 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:53:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:53:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:53:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 21:53:25,007 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 21:53:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:25,008 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 21:53:25,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:53:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 21:53:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:53:25,011 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:25,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:25,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:53:25,012 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 21:53:25,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:25,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516482557] [2020-09-04 21:53:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 21:53:25,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516482557] [2020-09-04 21:53:25,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:25,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:25,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834510603] [2020-09-04 21:53:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:25,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:25,222 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 21:53:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:25,375 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 21:53:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:53:25,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:53:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:25,382 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:53:25,383 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:53:25,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:53:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 21:53:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 21:53:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 21:53:25,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 21:53:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:25,423 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 21:53:25,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 21:53:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:53:25,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:25,426 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:25,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:53:25,426 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 21:53:25,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:25,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112867131] [2020-09-04 21:53:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:25,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112867131] [2020-09-04 21:53:25,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:25,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:25,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504192458] [2020-09-04 21:53:25,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:25,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:25,588 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 21:53:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:25,841 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 21:53:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:53:25,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 21:53:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:25,845 INFO L225 Difference]: With dead ends: 118 [2020-09-04 21:53:25,845 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 21:53:25,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 21:53:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 21:53:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 21:53:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 21:53:25,874 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 21:53:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:25,874 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 21:53:25,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 21:53:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 21:53:25,879 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:25,879 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:25,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:53:25,880 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 21:53:25,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:25,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798186043] [2020-09-04 21:53:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:25,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:53:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:53:26,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798186043] [2020-09-04 21:53:26,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:26,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:26,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351096194] [2020-09-04 21:53:26,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:26,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:26,106 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 21:53:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:26,280 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 21:53:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:26,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 21:53:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:26,285 INFO L225 Difference]: With dead ends: 227 [2020-09-04 21:53:26,285 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 21:53:26,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 21:53:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 21:53:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 21:53:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 21:53:26,338 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 21:53:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:26,340 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 21:53:26,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 21:53:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:53:26,344 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:26,345 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:26,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:53:26,345 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 21:53:26,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:26,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [34423111] [2020-09-04 21:53:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 21:53:26,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [34423111] [2020-09-04 21:53:26,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:26,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:26,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659285175] [2020-09-04 21:53:26,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:26,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:26,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:26,669 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 21:53:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:27,034 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 21:53:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:53:27,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 21:53:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:27,041 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:53:27,041 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:53:27,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:53:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 21:53:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:53:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 21:53:27,095 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 21:53:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:27,096 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 21:53:27,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 21:53:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 21:53:27,101 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:27,102 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:27,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:53:27,102 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 21:53:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:27,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394595647] [2020-09-04 21:53:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-09-04 21:53:27,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394595647] [2020-09-04 21:53:27,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:27,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:27,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978972598] [2020-09-04 21:53:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:27,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:27,457 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 21:53:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:27,998 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 21:53:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:53:27,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 21:53:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:28,006 INFO L225 Difference]: With dead ends: 265 [2020-09-04 21:53:28,006 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:53:28,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:53:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 21:53:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:53:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 21:53:28,042 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 21:53:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:28,045 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 21:53:28,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 21:53:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:53:28,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:28,052 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:53:28,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:53:28,054 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 21:53:28,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:28,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [933219274] [2020-09-04 21:53:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 21:53:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,366 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:53:28,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [933219274] [2020-09-04 21:53:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:28,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:28,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153576012] [2020-09-04 21:53:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:28,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:28,370 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 21:53:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:28,618 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 21:53:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:53:28,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 21:53:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:28,622 INFO L225 Difference]: With dead ends: 193 [2020-09-04 21:53:28,622 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 21:53:28,624 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:53:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 21:53:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 21:53:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 21:53:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 21:53:28,643 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 21:53:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:28,643 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 21:53:28,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 21:53:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:28,646 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:28,646 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:53:28,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:53:28,647 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 21:53:28,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:28,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706262921] [2020-09-04 21:53:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 21:53:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:28,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,003 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:53:29,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706262921] [2020-09-04 21:53:29,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:29,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:29,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730691396] [2020-09-04 21:53:29,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:29,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:29,006 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 21:53:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:29,410 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 21:53:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:53:29,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 21:53:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:29,413 INFO L225 Difference]: With dead ends: 241 [2020-09-04 21:53:29,413 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:53:29,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:53:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 21:53:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:53:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 21:53:29,432 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 21:53:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:29,433 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 21:53:29,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 21:53:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:29,435 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:29,435 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:53:29,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:53:29,436 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 21:53:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:29,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [85761035] [2020-09-04 21:53:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:29,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-09-04 21:53:30,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [85761035] [2020-09-04 21:53:30,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:30,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:53:30,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448477051] [2020-09-04 21:53:30,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:53:30,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:53:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:53:30,228 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 22 states. [2020-09-04 21:53:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:31,101 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2020-09-04 21:53:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-09-04 21:53:31,102 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2020-09-04 21:53:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:31,104 INFO L225 Difference]: With dead ends: 147 [2020-09-04 21:53:31,104 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:53:31,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 21:53:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:53:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2020-09-04 21:53:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-04 21:53:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2020-09-04 21:53:31,126 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 140 [2020-09-04 21:53:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:31,127 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2020-09-04 21:53:31,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:53:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2020-09-04 21:53:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-09-04 21:53:31,129 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:31,129 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:31,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:53:31,129 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1930099232, now seen corresponding path program 3 times [2020-09-04 21:53:31,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:31,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819857002] [2020-09-04 21:53:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 93 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-09-04 21:53:31,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819857002] [2020-09-04 21:53:31,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:31,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:53:31,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262682341] [2020-09-04 21:53:31,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:53:31,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:53:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:31,442 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand 11 states. [2020-09-04 21:53:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:31,740 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2020-09-04 21:53:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:53:31,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2020-09-04 21:53:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:31,744 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:53:31,744 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 21:53:31,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:53:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 21:53:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-09-04 21:53:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 21:53:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2020-09-04 21:53:31,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 122 [2020-09-04 21:53:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:31,768 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2020-09-04 21:53:31,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:53:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2020-09-04 21:53:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-09-04 21:53:31,771 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:31,772 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:31,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:53:31,772 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash 235403762, now seen corresponding path program 4 times [2020-09-04 21:53:31,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:31,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893168541] [2020-09-04 21:53:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:31,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 107 proven. 178 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2020-09-04 21:53:32,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893168541] [2020-09-04 21:53:32,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:32,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:53:32,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116770591] [2020-09-04 21:53:32,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:53:32,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:53:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:32,318 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand 14 states. [2020-09-04 21:53:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:32,926 INFO L93 Difference]: Finished difference Result 279 states and 385 transitions. [2020-09-04 21:53:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:53:32,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2020-09-04 21:53:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:32,930 INFO L225 Difference]: With dead ends: 279 [2020-09-04 21:53:32,931 INFO L226 Difference]: Without dead ends: 149 [2020-09-04 21:53:32,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 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:53:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-09-04 21:53:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2020-09-04 21:53:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 21:53:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-09-04 21:53:32,960 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 175 [2020-09-04 21:53:32,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:32,961 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-09-04 21:53:32,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:53:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-09-04 21:53:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 21:53:32,964 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:32,964 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:32,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:53:32,965 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash -544823395, now seen corresponding path program 5 times [2020-09-04 21:53:32,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:32,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1212072729] [2020-09-04 21:53:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:53:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 145 proven. 165 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-09-04 21:53:33,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1212072729] [2020-09-04 21:53:33,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:33,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:53:33,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825840113] [2020-09-04 21:53:33,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:53:33,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:53:33,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:33,479 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 11 states. [2020-09-04 21:53:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:33,746 INFO L93 Difference]: Finished difference Result 271 states and 352 transitions. [2020-09-04 21:53:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:53:33,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2020-09-04 21:53:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:33,749 INFO L225 Difference]: With dead ends: 271 [2020-09-04 21:53:33,749 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:53:33,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:53:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:53:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2020-09-04 21:53:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 21:53:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2020-09-04 21:53:33,774 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 210 [2020-09-04 21:53:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:33,775 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2020-09-04 21:53:33,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:53:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2020-09-04 21:53:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 21:53:33,778 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:33,778 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:33,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:53:33,779 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1099906658, now seen corresponding path program 6 times [2020-09-04 21:53:33,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:33,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306440301] [2020-09-04 21:53:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:33,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:53:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 171 proven. 300 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2020-09-04 21:53:34,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306440301] [2020-09-04 21:53:34,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:34,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:53:34,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753979975] [2020-09-04 21:53:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:53:34,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:53:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:34,501 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 14 states. [2020-09-04 21:53:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:35,199 INFO L93 Difference]: Finished difference Result 295 states and 399 transitions. [2020-09-04 21:53:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:53:35,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2020-09-04 21:53:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:35,204 INFO L225 Difference]: With dead ends: 295 [2020-09-04 21:53:35,204 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 21:53:35,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 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:53:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 21:53:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-09-04 21:53:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 21:53:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2020-09-04 21:53:35,223 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 228 [2020-09-04 21:53:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:35,223 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2020-09-04 21:53:35,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:53:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2020-09-04 21:53:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 21:53:35,227 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:35,227 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:53:35,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:53:35,227 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 7 times [2020-09-04 21:53:35,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:35,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928901403] [2020-09-04 21:53:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:53:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 98 proven. 244 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-09-04 21:53:35,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928901403] [2020-09-04 21:53:35,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:35,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:53:35,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020488727] [2020-09-04 21:53:35,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:53:35,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:35,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:53:35,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:35,831 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand 11 states. [2020-09-04 21:53:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:36,253 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2020-09-04 21:53:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:53:36,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2020-09-04 21:53:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:36,256 INFO L225 Difference]: With dead ends: 165 [2020-09-04 21:53:36,256 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:53:36,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:53:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:53:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:53:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:53:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:53:36,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2020-09-04 21:53:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:36,260 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:53:36,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:53:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:53:36,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:53:36,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:53:36,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:53:50,393 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-09-04 21:53:50,745 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 21 [2020-09-04 21:53:51,214 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 21 [2020-09-04 21:53:52,104 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 40 [2020-09-04 21:53:52,595 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2020-09-04 21:53:53,219 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-09-04 21:53:53,633 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-09-04 21:53:54,204 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-09-04 21:53:54,647 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2020-09-04 21:53:55,331 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 39 [2020-09-04 21:53:55,932 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 39 [2020-09-04 21:53:56,493 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2020-09-04 21:53:57,358 WARN L193 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 40 [2020-09-04 21:53:57,728 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2020-09-04 21:53:58,508 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 46 [2020-09-04 21:53:59,142 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 38 [2020-09-04 21:53:59,201 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,201 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,201 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,201 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,201 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,202 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:53:59,202 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 21:53:59,202 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 21:53:59,202 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-09-04 21:53:59,203 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:53:59,204 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-09-04 21:53:59,204 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= |main_#t~ret4| 5) (<= main_~result~0 5)) [2020-09-04 21:53:59,204 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 21:53:59,204 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:53:59,204 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:53:59,205 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= 2 |fibo2_#in~n|)) (< 0 fibo2_~n)) [2020-09-04 21:53:59,205 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:53:59,205 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 21:53:59,205 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and .cse2 (<= 5 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0))))) [2020-09-04 21:53:59,205 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 21:53:59,206 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and .cse2 (<= 5 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0))))) [2020-09-04 21:53:59,206 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 21:53:59,206 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (<= |fibo2_#t~ret2| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= |fibo2_#in~n| 3) (<= .cse1 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse2 .cse0 .cse3 (<= 2 .cse1)) (and (<= 4 |fibo2_#in~n|) (<= .cse1 3) (<= 2 |fibo2_#t~ret2|) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) .cse0 (<= 3 .cse1)) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) .cse2 (<= |fibo2_#res| 1) .cse0 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) [2020-09-04 21:53:59,207 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse2 (<= |fibo2_#in~n| 3))) (let ((.cse0 (and .cse2 (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n))) (.cse1 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)))) (and (or .cse0 .cse1 (and (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (or .cse0 .cse1 (not .cse2)) (not (<= |fibo2_#in~n| 1))))) [2020-09-04 21:53:59,207 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo2_#res|)) (.cse4 (<= |fibo2_#res| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse1 (and .cse3 .cse4 .cse0 (< 0 fibo2_~n))) (.cse2 (not (<= |fibo2_#in~n| 1)))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) .cse1 .cse2) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) .cse2) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse3 .cse4 .cse0 (<= |fibo2_#in~n| 2)) (not (<= 2 |fibo2_#in~n|)))))) [2020-09-04 21:53:59,207 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo2_#res|)) (.cse4 (<= |fibo2_#res| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse1 (and .cse3 .cse4 .cse0 (< 0 fibo2_~n))) (.cse2 (not (<= |fibo2_#in~n| 1)))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) .cse1 .cse2) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) .cse2) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse3 .cse4 .cse0 (<= |fibo2_#in~n| 2)) (not (<= 2 |fibo2_#in~n|)))))) [2020-09-04 21:53:59,207 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 21:53:59,208 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 21:53:59,208 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|)) (.cse1 (<= |fibo1_#in~n| 4))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 .cse1) (and .cse0 (<= 6 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 .cse1)))) [2020-09-04 21:53:59,208 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 21:53:59,208 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|)) (.cse1 (<= |fibo1_#in~n| 4))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 .cse1) (and .cse0 (<= 6 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 .cse1)))) [2020-09-04 21:53:59,208 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 6 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse0) (and (<= fibo1_~n 4) .cse0)) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 21:53:59,209 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 21:53:59,209 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse3 (<= 1 |fibo1_#t~ret0|)) (.cse4 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (and (<= .cse1 1) .cse2 (<= 1 .cse1) .cse5 .cse3 .cse4))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 4 |fibo1_#in~n|) (<= |fibo1_#in~n| 4)) .cse0 (and (<= .cse1 5) (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 .cse1) (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#in~n| 3) .cse2 (<= .cse1 2) .cse3 (<= 2 .cse1)) (<= 6 |fibo1_#in~n|)) .cse4 (or (not .cse5) .cse0)))) [2020-09-04 21:53:59,209 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 21:53:59,209 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse3 (<= 1 |fibo1_#t~ret0|)) (.cse4 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (and (<= .cse1 1) .cse2 (<= 1 .cse1) .cse5 .cse3 .cse4))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 4 |fibo1_#in~n|) (<= |fibo1_#in~n| 4)) .cse0 (and (<= .cse1 5) (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 .cse1) (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#in~n| 3) .cse2 (<= .cse1 2) .cse3 (<= 2 .cse1)) (<= 6 |fibo1_#in~n|)) .cse4 (or (not .cse5) .cse0)))) [2020-09-04 21:53:59,210 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 21:53:59,210 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse3 (<= |fibo1_#t~ret0| 1)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse4 (<= 1 |fibo1_#t~ret0|)) (.cse2 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (and (<= .cse1 1) .cse3 (<= 1 .cse1) .cse5 .cse4 .cse2 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (and (not (<= |fibo1_#in~n| 1)) (or .cse0 (and (or (<= fibo1_~n 4) (and (<= .cse1 5) (<= 3 |fibo1_#t~ret0|) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) (<= 5 .cse1) (<= |fibo1_#t~ret0| 3))) (<= 4 |fibo1_#in~n|) .cse2) (and .cse2 (<= 6 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) .cse3 (<= .cse1 2) .cse4 (<= |fibo1_#res| 2) (<= 2 .cse1) .cse2)) (or .cse0 (not .cse5))))) [2020-09-04 21:53:59,210 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (let ((.cse0 (<= |fibo1_#t~ret0| 1)) (.cse1 (<= 1 |fibo1_#t~ret0|)) (.cse2 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) .cse0 .cse1 (<= |fibo1_#res| 2) .cse2 (<= 3 |fibo1_#in~n|)) (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse2 (<= |fibo1_#t~ret0| 3)) (and .cse2 (<= 6 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#in~n| 2) .cse1 .cse2 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= 4 |fibo1_#in~n|) .cse2 (<= |fibo1_#in~n| 4))))) [2020-09-04 21:53:59,210 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 6 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse0) (and (<= fibo1_~n 4) .cse0)) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 21:53:59,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:53:59 BoogieIcfgContainer [2020-09-04 21:53:59,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:53:59,268 INFO L168 Benchmark]: Toolchain (without parser) took 37084.89 ms. Allocated memory was 137.4 MB in the beginning and 611.3 MB in the end (delta: 474.0 MB). Free memory was 102.1 MB in the beginning and 512.0 MB in the end (delta: -409.9 MB). Peak memory consumption was 468.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:59,269 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 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:53:59,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.36 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 92.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:59,272 INFO L168 Benchmark]: Boogie Preprocessor took 131.51 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.1 MB in the beginning and 180.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:59,273 INFO L168 Benchmark]: RCFGBuilder took 363.23 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 165.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:59,274 INFO L168 Benchmark]: TraceAbstraction took 36262.89 ms. Allocated memory was 201.3 MB in the beginning and 611.3 MB in the end (delta: 410.0 MB). Free memory was 164.5 MB in the beginning and 512.0 MB in the end (delta: -347.5 MB). Peak memory consumption was 467.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:59,282 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.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.36 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 92.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.51 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.1 MB in the beginning and 180.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.23 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 165.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36262.89 ms. Allocated memory was 201.3 MB in the beginning and 611.3 MB in the end (delta: 410.0 MB). Free memory was 164.5 MB in the beginning and 512.0 MB in the end (delta: -347.5 MB). Peak memory consumption was 467.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((n == \old(n) && \old(n) <= 0) || (((1 <= \result && \result <= 1) && n == \old(n)) && 0 < n)) || !(\old(n) <= 1)) && (((((1 <= \result && \result <= 1) && n == \old(n)) && 0 < n) || (\result <= 0 && 0 <= \result)) || !(\old(n) <= 1))) && (((((n == \old(n) && 5 <= n) || (((4 <= n && \result <= 3) && n == \old(n)) && 3 <= \result)) || ((((\old(n) <= 3 && \result <= 2) && 2 <= \result) && 3 <= n) && n == \old(n))) || (((1 <= \result && \result <= 1) && n == \old(n)) && \old(n) <= 2)) || !(2 <= \old(n))) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((n == \old(n) && 6 <= \old(n)) || ((((5 <= \result && \result <= 5) && n == \old(n)) || (n <= 4 && n == \old(n))) && 4 <= \old(n))) || ((((2 <= \result && \old(n) <= 3) && \result <= 2) && n == \old(n)) && 3 <= \old(n))) || (\old(n) <= 0 && n == \old(n))) || (((\old(n) <= 2 && n == \old(n)) && \result <= 1) && 1 <= \result)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.1s, OverallIterations: 18, TraceHistogramMax: 13, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 867 SDtfs, 924 SDslu, 5259 SDs, 0 SdLazy, 3521 SolverSat, 358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 127 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 2621 PreInvPairs, 5706 NumberOfFragments, 1468 HoareAnnotationTreeSize, 2621 FomulaSimplifications, 170173 FormulaSimplificationTreeSizeReduction, 13.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 47696 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1863 NumberOfCodeBlocks, 1863 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1845 ConstructedInterpolants, 0 QuantifiedInterpolants, 510855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 3047/4352 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 correct! Received shutdown request...