/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 18:47:04,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 18:47:04,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 18:47:04,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 18:47:04,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 18:47:04,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 18:47:04,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 18:47:04,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 18:47:04,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 18:47:04,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 18:47:04,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 18:47:04,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 18:47:04,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 18:47:04,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 18:47:04,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 18:47:04,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 18:47:04,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 18:47:04,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 18:47:04,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 18:47:04,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 18:47:04,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 18:47:04,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 18:47:04,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 18:47:04,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 18:47:04,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 18:47:04,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 18:47:04,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 18:47:04,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 18:47:04,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 18:47:04,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 18:47:04,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 18:47:04,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 18:47:04,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 18:47:04,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 18:47:04,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 18:47:04,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 18:47:04,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 18:47:04,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 18:47:04,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 18:47:04,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 18:47:04,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 18:47:04,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 18:47:04,657 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 18:47:04,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 18:47:04,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 18:47:04,660 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 18:47:04,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 18:47:04,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 18:47:04,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 18:47:04,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 18:47:04,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 18:47:04,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 18:47:04,662 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 18:47:04,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 18:47:04,662 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 18:47:04,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 18:47:04,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 18:47:04,663 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 18:47:04,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 18:47:04,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 18:47:04,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:47:04,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 18:47:04,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 18:47:04,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 18:47:04,665 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 18:47:04,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 18:47:04,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 18:47:04,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 18:47:04,961 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 18:47:04,962 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 18:47:04,962 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-22 18:47:05,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf69ef741/70aaf73407c7403e8e9094afce3c4a55/FLAG1820f23ac [2020-08-22 18:47:05,475 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 18:47:05,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-22 18:47:05,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf69ef741/70aaf73407c7403e8e9094afce3c4a55/FLAG1820f23ac [2020-08-22 18:47:05,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf69ef741/70aaf73407c7403e8e9094afce3c4a55 [2020-08-22 18:47:05,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 18:47:05,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 18:47:05,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 18:47:05,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 18:47:05,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 18:47:05,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:47:05" (1/1) ... [2020-08-22 18:47:05,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a098cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:05, skipping insertion in model container [2020-08-22 18:47:05,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:47:05" (1/1) ... [2020-08-22 18:47:05,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 18:47:05,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 18:47:06,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:47:06,118 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 18:47:06,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:47:06,147 INFO L208 MainTranslator]: Completed translation [2020-08-22 18:47:06,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06 WrapperNode [2020-08-22 18:47:06,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 18:47:06,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 18:47:06,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 18:47:06,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 18:47:06,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... [2020-08-22 18:47:06,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 18:47:06,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 18:47:06,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 18:47:06,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 18:47:06,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:47:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 18:47:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 18:47:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 18:47:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 18:47:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 18:47:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 18:47:06,535 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 18:47:06,536 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 18:47:06,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:47:06 BoogieIcfgContainer [2020-08-22 18:47:06,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 18:47:06,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 18:47:06,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 18:47:06,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 18:47:06,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:47:05" (1/3) ... [2020-08-22 18:47:06,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9cc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:47:06, skipping insertion in model container [2020-08-22 18:47:06,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:06" (2/3) ... [2020-08-22 18:47:06,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9cc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:47:06, skipping insertion in model container [2020-08-22 18:47:06,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:47:06" (3/3) ... [2020-08-22 18:47:06,551 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-08-22 18:47:06,563 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 18:47:06,573 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 18:47:06,598 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 18:47:06,637 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 18:47:06,637 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 18:47:06,637 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 18:47:06,638 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 18:47:06,638 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 18:47:06,638 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 18:47:06,638 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 18:47:06,639 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 18:47:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-08-22 18:47:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 18:47:06,672 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:06,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:47:06,674 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-08-22 18:47:06,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:06,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815350201] [2020-08-22 18:47:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:06,754 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:06,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:06,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:47:06,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815350201] [2020-08-22 18:47:06,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:06,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:47:06,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323334168] [2020-08-22 18:47:06,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:47:06,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:06,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:47:06,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:47:06,957 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-08-22 18:47:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:07,083 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-08-22 18:47:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:47:07,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 18:47:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:07,096 INFO L225 Difference]: With dead ends: 58 [2020-08-22 18:47:07,096 INFO L226 Difference]: Without dead ends: 42 [2020-08-22 18:47:07,100 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-08-22 18:47:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-22 18:47:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-22 18:47:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 18:47:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 18:47:07,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-08-22 18:47:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:07,151 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 18:47:07,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:47:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 18:47:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 18:47:07,154 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:07,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:47:07,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 18:47:07,155 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-08-22 18:47:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:07,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [490578451] [2020-08-22 18:47:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:07,159 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:47:07,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [490578451] [2020-08-22 18:47:07,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:07,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:47:07,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060932055] [2020-08-22 18:47:07,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:47:07,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:07,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:47:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:47:07,235 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-08-22 18:47:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:07,317 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 18:47:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:47:07,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 18:47:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:07,321 INFO L225 Difference]: With dead ends: 50 [2020-08-22 18:47:07,321 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 18:47:07,323 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-08-22 18:47:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 18:47:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 18:47:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 18:47:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 18:47:07,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-08-22 18:47:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:07,338 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 18:47:07,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:47:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 18:47:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 18:47:07,341 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:07,341 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-08-22 18:47:07,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 18:47:07,342 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-08-22 18:47:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:07,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376050422] [2020-08-22 18:47:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:07,346 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:47:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 18:47:07,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376050422] [2020-08-22 18:47:07,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:07,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:47:07,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932783024] [2020-08-22 18:47:07,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:47:07,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:47:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:47:07,485 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-08-22 18:47:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:07,623 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-08-22 18:47:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 18:47:07,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 18:47:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:07,626 INFO L225 Difference]: With dead ends: 82 [2020-08-22 18:47:07,627 INFO L226 Difference]: Without dead ends: 46 [2020-08-22 18:47:07,628 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-08-22 18:47:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-08-22 18:47:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-08-22 18:47:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 18:47:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 18:47:07,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-08-22 18:47:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:07,644 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 18:47:07,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:47:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 18:47:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 18:47:07,647 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:07,647 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-08-22 18:47:07,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 18:47:07,648 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-08-22 18:47:07,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:07,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402213029] [2020-08-22 18:47:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:07,652 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 18:47:07,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402213029] [2020-08-22 18:47:07,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:07,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:47:07,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980748520] [2020-08-22 18:47:07,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:47:07,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:47:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:47:07,825 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-08-22 18:47:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:08,039 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-08-22 18:47:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 18:47:08,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-08-22 18:47:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:08,051 INFO L225 Difference]: With dead ends: 74 [2020-08-22 18:47:08,051 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 18:47:08,055 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-08-22 18:47:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 18:47:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-08-22 18:47:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 18:47:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-08-22 18:47:08,084 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-08-22 18:47:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:08,084 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-08-22 18:47:08,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:47:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-08-22 18:47:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 18:47:08,096 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:08,096 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-08-22 18:47:08,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 18:47:08,097 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-08-22 18:47:08,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:08,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928165232] [2020-08-22 18:47:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:08,100 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:47:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:47:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:08,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928165232] [2020-08-22 18:47:08,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:08,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 18:47:08,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146802803] [2020-08-22 18:47:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 18:47:08,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 18:47:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:47:08,226 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-08-22 18:47:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:08,350 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-08-22 18:47:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 18:47:08,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-08-22 18:47:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:08,353 INFO L225 Difference]: With dead ends: 130 [2020-08-22 18:47:08,353 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 18:47:08,355 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-08-22 18:47:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 18:47:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-22 18:47:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 18:47:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-22 18:47:08,372 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-08-22 18:47:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:08,373 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-22 18:47:08,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 18:47:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-22 18:47:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 18:47:08,376 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:08,376 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-08-22 18:47:08,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 18:47:08,377 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-08-22 18:47:08,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:08,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130619318] [2020-08-22 18:47:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:08,380 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-08-22 18:47:08,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130619318] [2020-08-22 18:47:08,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:08,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:08,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121115828] [2020-08-22 18:47:08,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:08,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:08,523 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-08-22 18:47:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:08,663 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-08-22 18:47:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 18:47:08,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 18:47:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:08,666 INFO L225 Difference]: With dead ends: 142 [2020-08-22 18:47:08,666 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 18:47:08,671 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-08-22 18:47:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 18:47:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-08-22 18:47:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 18:47:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-08-22 18:47:08,704 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-08-22 18:47:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:08,705 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-08-22 18:47:08,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-08-22 18:47:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 18:47:08,715 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:08,716 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-08-22 18:47:08,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 18:47:08,716 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-08-22 18:47:08,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:08,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589865895] [2020-08-22 18:47:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:08,721 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:08,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589865895] [2020-08-22 18:47:08,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:08,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:08,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63749058] [2020-08-22 18:47:08,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:08,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:08,943 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-08-22 18:47:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:09,118 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-08-22 18:47:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 18:47:09,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 18:47:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:09,122 INFO L225 Difference]: With dead ends: 118 [2020-08-22 18:47:09,123 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 18:47:09,124 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-08-22 18:47:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 18:47:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-08-22 18:47:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 18:47:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-08-22 18:47:09,167 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-08-22 18:47:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:09,168 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-08-22 18:47:09,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-08-22 18:47:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 18:47:09,173 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:09,173 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-08-22 18:47:09,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 18:47:09,173 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-08-22 18:47:09,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:09,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220803069] [2020-08-22 18:47:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:09,180 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 18:47:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 18:47:09,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220803069] [2020-08-22 18:47:09,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:09,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:09,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723740463] [2020-08-22 18:47:09,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:09,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:09,402 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-08-22 18:47:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:09,544 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-08-22 18:47:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 18:47:09,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-08-22 18:47:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:09,550 INFO L225 Difference]: With dead ends: 227 [2020-08-22 18:47:09,550 INFO L226 Difference]: Without dead ends: 127 [2020-08-22 18:47:09,552 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-08-22 18:47:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-08-22 18:47:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-08-22 18:47:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-08-22 18:47:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-08-22 18:47:09,595 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-08-22 18:47:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:09,598 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-08-22 18:47:09,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-08-22 18:47:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-08-22 18:47:09,602 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:09,603 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-08-22 18:47:09,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 18:47:09,603 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-08-22 18:47:09,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:09,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621306440] [2020-08-22 18:47:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:09,608 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:09,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621306440] [2020-08-22 18:47:09,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:09,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:47:09,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117471845] [2020-08-22 18:47:09,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:47:09,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:47:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:47:09,831 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-08-22 18:47:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:10,054 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-08-22 18:47:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 18:47:10,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-08-22 18:47:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:10,057 INFO L225 Difference]: With dead ends: 257 [2020-08-22 18:47:10,057 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 18:47:10,059 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-08-22 18:47:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 18:47:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-08-22 18:47:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 18:47:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-08-22 18:47:10,081 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-08-22 18:47:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:10,081 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-08-22 18:47:10,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:47:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-08-22 18:47:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 18:47:10,084 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:10,084 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-08-22 18:47:10,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 18:47:10,084 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-08-22 18:47:10,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:10,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1231245061] [2020-08-22 18:47:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:10,087 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-22 18:47:10,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1231245061] [2020-08-22 18:47:10,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:10,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 18:47:10,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802231764] [2020-08-22 18:47:10,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 18:47:10,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:10,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 18:47:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 18:47:10,330 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-08-22 18:47:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:10,740 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-08-22 18:47:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 18:47:10,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-08-22 18:47:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:10,750 INFO L225 Difference]: With dead ends: 265 [2020-08-22 18:47:10,751 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 18:47:10,754 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-08-22 18:47:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 18:47:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-08-22 18:47:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-08-22 18:47:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-08-22 18:47:10,789 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 105 [2020-08-22 18:47:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:10,790 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-08-22 18:47:10,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 18:47:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-08-22 18:47:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-08-22 18:47:10,795 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:10,795 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:47:10,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 18:47:10,796 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1951493560, now seen corresponding path program 1 times [2020-08-22 18:47:10,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:10,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323177301] [2020-08-22 18:47:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:10,799 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:10,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-08-22 18:47:11,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323177301] [2020-08-22 18:47:11,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:11,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-08-22 18:47:11,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742971748] [2020-08-22 18:47:11,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-22 18:47:11,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-22 18:47:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-22 18:47:11,257 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 17 states. [2020-08-22 18:47:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:11,740 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2020-08-22 18:47:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 18:47:11,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2020-08-22 18:47:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:11,744 INFO L225 Difference]: With dead ends: 137 [2020-08-22 18:47:11,744 INFO L226 Difference]: Without dead ends: 131 [2020-08-22 18:47:11,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2020-08-22 18:47:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-08-22 18:47:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2020-08-22 18:47:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-08-22 18:47:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2020-08-22 18:47:11,762 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 87 [2020-08-22 18:47:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:11,764 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2020-08-22 18:47:11,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-22 18:47:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2020-08-22 18:47:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-08-22 18:47:11,766 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:11,766 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:47:11,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 18:47:11,766 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1530276981, now seen corresponding path program 2 times [2020-08-22 18:47:11,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:11,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899045428] [2020-08-22 18:47:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:11,770 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 18:47:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-08-22 18:47:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 18:47:11,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899045428] [2020-08-22 18:47:11,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:11,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:47:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395622304] [2020-08-22 18:47:11,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:47:11,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:47:11,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:47:11,883 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 7 states. [2020-08-22 18:47:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:11,979 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2020-08-22 18:47:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 18:47:11,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2020-08-22 18:47:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:11,982 INFO L225 Difference]: With dead ends: 197 [2020-08-22 18:47:11,982 INFO L226 Difference]: Without dead ends: 94 [2020-08-22 18:47:11,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:47:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-22 18:47:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-22 18:47:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 18:47:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2020-08-22 18:47:12,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 88 [2020-08-22 18:47:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:12,002 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2020-08-22 18:47:12,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:47:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2020-08-22 18:47:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 18:47:12,004 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:12,004 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-08-22 18:47:12,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 18:47:12,005 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 2 times [2020-08-22 18:47:12,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:12,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227955516] [2020-08-22 18:47:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:12,009 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 18:47:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-08-22 18:47:12,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227955516] [2020-08-22 18:47:12,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:12,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 18:47:12,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284108493] [2020-08-22 18:47:12,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 18:47:12,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 18:47:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-08-22 18:47:12,266 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 11 states. [2020-08-22 18:47:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:12,538 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2020-08-22 18:47:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 18:47:12,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-08-22 18:47:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:12,540 INFO L225 Difference]: With dead ends: 176 [2020-08-22 18:47:12,540 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 18:47:12,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-08-22 18:47:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 18:47:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 18:47:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 18:47:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 18:47:12,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2020-08-22 18:47:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:12,545 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 18:47:12,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 18:47:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 18:47:12,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 18:47:12,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 18:47:12,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 18:47:15,148 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-08-22 18:47:15,250 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2020-08-22 18:47:15,754 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-08-22 18:47:15,982 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2020-08-22 18:47:16,320 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-08-22 18:47:16,501 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-08-22 18:47:16,698 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-08-22 18:47:16,914 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-08-22 18:47:17,132 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-08-22 18:47:17,373 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-08-22 18:47:17,606 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-08-22 18:47:17,970 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-08-22 18:47:18,086 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-08-22 18:47:18,381 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-08-22 18:47:18,677 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2020-08-22 18:47:18,698 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,698 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,698 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,698 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:47:18,699 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-08-22 18:47:18,699 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-22 18:47:18,699 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 18:47:18,700 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 18:47:18,700 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-08-22 18:47:18,700 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-08-22 18:47:18,700 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-08-22 18:47:18,701 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-08-22 18:47:18,701 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 18:47:18,701 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-08-22 18:47:18,701 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= |main_#t~ret4| 3)) [2020-08-22 18:47:18,701 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-22 18:47:18,702 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-08-22 18:47:18,702 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 18:47:18,702 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-08-22 18:47:18,702 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 18:47:18,702 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-08-22 18:47:18,703 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 18:47:18,703 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-08-22 18:47:18,703 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 18:47:18,703 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-08-22 18:47:18,704 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse2 (<= |fibo2_#t~ret2| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (or (and (<= 4 fibo2_~n) .cse0) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) .cse2 (<= |fibo2_#res| 1) .cse0 .cse3 (<= |fibo2_#in~n| 2)) (and (<= .cse1 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse2 .cse0 .cse3 (<= 2 .cse1)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 18:47:18,704 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse1 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse0 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse1 (<= |fibo2_#in~n| 2)))) (and (or .cse0 (and (<= 3 fibo2_~n) .cse1)) (or (<= 4 fibo2_~n) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) .cse0) (not (<= |fibo2_#in~n| 1))))) [2020-08-22 18:47:18,704 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-08-22 18:47:18,704 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-08-22 18:47:18,705 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-22 18:47:18,705 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 18:47:18,705 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 18:47:18,705 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-08-22 18:47:18,705 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 18:47:18,706 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 18:47:18,706 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-08-22 18:47:18,706 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 18:47:18,706 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 18:47:18,706 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 18:47:18,707 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-08-22 18:47:18,707 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (<= 2 |fibo1_#t~ret0|)) (.cse2 (and (<= 5 |fibo1_#in~n|) .cse3))) (and (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= |fibo1_#res| 3) (<= .cse0 3) (<= 3 |fibo1_#res|) .cse1 (<= |fibo1_#t~ret0| 2) (<= 3 .cse0))) .cse2) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#in~n| 3) .cse3) (and .cse1 .cse3) .cse2)))) [2020-08-22 18:47:18,707 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse2 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (<= 2 |fibo1_#t~ret0|)) (.cse1 (and (<= 5 |fibo1_#in~n|) .cse2))) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0 (<= |fibo1_#t~ret0| 2)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) .cse1) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#in~n| 3) .cse2) (and .cse0 .cse2) .cse1)))) [2020-08-22 18:47:18,707 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 18:47:18,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 06:47:18 BoogieIcfgContainer [2020-08-22 18:47:18,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 18:47:18,741 INFO L168 Benchmark]: Toolchain (without parser) took 12833.19 ms. Allocated memory was 146.8 MB in the beginning and 362.3 MB in the end (delta: 215.5 MB). Free memory was 104.3 MB in the beginning and 120.9 MB in the end (delta: -16.6 MB). Peak memory consumption was 223.6 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,741 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.40 ms. Allocated memory is still 146.8 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,747 INFO L168 Benchmark]: Boogie Preprocessor took 126.80 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 94.5 MB in the beginning and 182.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,749 INFO L168 Benchmark]: RCFGBuilder took 265.62 ms. Allocated memory is still 204.5 MB. Free memory was 182.5 MB in the beginning and 168.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,750 INFO L168 Benchmark]: TraceAbstraction took 12196.02 ms. Allocated memory was 204.5 MB in the beginning and 362.3 MB in the end (delta: 157.8 MB). Free memory was 168.4 MB in the beginning and 120.9 MB in the end (delta: 47.5 MB). Peak memory consumption was 230.0 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:18,757 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.40 ms. Allocated memory is still 146.8 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.80 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 94.5 MB in the beginning and 182.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 265.62 ms. Allocated memory is still 204.5 MB. Free memory was 182.5 MB in the beginning and 168.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12196.02 ms. Allocated memory was 204.5 MB in the beginning and 362.3 MB in the end (delta: 157.8 MB). Free memory was 168.4 MB in the beginning and 120.9 MB in the end (delta: 47.5 MB). Peak memory consumption was 230.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: 4 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || 4 <= n) || (((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n)) || (\result <= 2 && 2 <= \result)) || \old(n) <= 0) && (((((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n) || (\result <= 0 && 0 <= \result)) || !(\old(n) <= 1))) && ((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || (3 <= n && n == \old(n))) || (n == \old(n) && \old(n) <= 1)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((((\old(n) <= 2 && \old(n) <= 1) && n == \old(n)) && \result <= 1) && 1 <= \result) || ((((\result <= 3 && 3 <= \result) || \old(n) <= 3) && n == \old(n)) && 3 <= \old(n))) || ((\old(n) <= 0 && \old(n) <= 2) && n == \old(n))) || (5 <= \old(n) && n == \old(n))) && ((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: 5.9s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 584 SDtfs, 509 SDslu, 2855 SDs, 0 SdLazy, 1562 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 81 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 1599 PreInvPairs, 2793 NumberOfFragments, 1062 HoareAnnotationTreeSize, 1599 FomulaSimplifications, 46489 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 15261 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...