/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:37:44,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:37:44,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:37:44,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:37:44,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:37:44,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:37:44,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:37:44,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:37:44,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:37:44,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:37:44,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:37:44,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:37:44,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:37:44,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:37:44,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:37:44,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:37:44,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:37:44,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:37:44,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:37:44,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:37:44,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:37:44,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:37:44,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:37:44,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:37:44,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:37:44,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:37:44,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:37:44,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:37:44,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:37:44,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:37:44,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:37:44,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:37:44,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:37:44,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:37:44,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:37:44,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:37:44,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:37:44,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:37:44,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:37:44,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:37:44,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:37:44,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:37:44,156 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:37:44,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:37:44,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:37:44,162 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:37:44,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:37:44,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:37:44,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:37:44,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:37:44,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:37:44,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:37:44,163 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:37:44,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:37:44,164 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:37:44,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:37:44,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:37:44,164 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:37:44,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:37:44,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:37:44,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:37:44,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:37:44,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:37:44,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:37:44,166 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:37:44,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:37:44,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:37:44,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:37:44,662 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:37:44,663 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:37:44,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann04.c [2020-09-04 21:37:44,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/54d94f0d4/ab58a9b252c3464a9a0e209e0da264b4/FLAG799472237 [2020-09-04 21:37:45,264 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:37:45,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Ackermann04.c [2020-09-04 21:37:45,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/54d94f0d4/ab58a9b252c3464a9a0e209e0da264b4/FLAG799472237 [2020-09-04 21:37:45,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/54d94f0d4/ab58a9b252c3464a9a0e209e0da264b4 [2020-09-04 21:37:45,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:37:45,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:37:45,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:45,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:37:45,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:37:45,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249e641f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45, skipping insertion in model container [2020-09-04 21:37:45,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:37:45,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:37:45,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:45,874 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:37:45,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:45,914 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:37:45,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45 WrapperNode [2020-09-04 21:37:45,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:45,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:37:45,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:37:45,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:37:45,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... [2020-09-04 21:37:45,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:37:45,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:37:45,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:37:45,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:37:45,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:37:46,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:37:46,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:37:46,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-09-04 21:37:46,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:37:46,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:37:46,342 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:37:46,343 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:37:46,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:46 BoogieIcfgContainer [2020-09-04 21:37:46,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:37:46,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:37:46,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:37:46,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:37:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:37:45" (1/3) ... [2020-09-04 21:37:46,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62167592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:46, skipping insertion in model container [2020-09-04 21:37:46,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:45" (2/3) ... [2020-09-04 21:37:46,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62167592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:46, skipping insertion in model container [2020-09-04 21:37:46,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:46" (3/3) ... [2020-09-04 21:37:46,361 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-09-04 21:37:46,379 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:37:46,389 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:37:46,415 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:37:46,446 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:37:46,446 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:37:46,446 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:37:46,447 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:37:46,447 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:37:46,448 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:37:46,448 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:37:46,448 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:37:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-04 21:37:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:37:46,484 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:46,486 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-09-04 21:37:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328356027] [2020-09-04 21:37:46,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:37:46,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328356027] [2020-09-04 21:37:46,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:46,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:37:46,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885997113] [2020-09-04 21:37:46,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:46,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:46,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:46,792 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2020-09-04 21:37:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,959 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2020-09-04 21:37:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:37:46,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-09-04 21:37:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,978 INFO L225 Difference]: With dead ends: 88 [2020-09-04 21:37:46,978 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 21:37:46,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 21:37:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 21:37:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 21:37:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-09-04 21:37:47,047 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2020-09-04 21:37:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,048 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-09-04 21:37:47,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-09-04 21:37:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:37:47,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,052 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:47,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:37:47,053 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-09-04 21:37:47,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1567145202] [2020-09-04 21:37:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:37:47,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1567145202] [2020-09-04 21:37:47,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:47,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754161465] [2020-09-04 21:37:47,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:47,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:47,187 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2020-09-04 21:37:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,297 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-09-04 21:37:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:37:47,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 21:37:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,301 INFO L225 Difference]: With dead ends: 83 [2020-09-04 21:37:47,301 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 21:37:47,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 21:37:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-09-04 21:37:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 21:37:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2020-09-04 21:37:47,319 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2020-09-04 21:37:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,320 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2020-09-04 21:37:47,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2020-09-04 21:37:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 21:37:47,323 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,323 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2020-09-04 21:37:47,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:37:47,324 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-09-04 21:37:47,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547603232] [2020-09-04 21:37:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 21:37:47,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547603232] [2020-09-04 21:37:47,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:47,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593903123] [2020-09-04 21:37:47,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:47,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:47,539 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 6 states. [2020-09-04 21:37:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,676 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2020-09-04 21:37:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:47,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-09-04 21:37:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,681 INFO L225 Difference]: With dead ends: 75 [2020-09-04 21:37:47,682 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 21:37:47,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 21:37:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-04 21:37:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 21:37:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2020-09-04 21:37:47,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 53 [2020-09-04 21:37:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,716 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2020-09-04 21:37:47,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2020-09-04 21:37:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:37:47,725 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,725 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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] [2020-09-04 21:37:47,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:37:47,726 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1817818703, now seen corresponding path program 2 times [2020-09-04 21:37:47,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960938337] [2020-09-04 21:37:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-09-04 21:37:47,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960938337] [2020-09-04 21:37:47,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:47,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964482927] [2020-09-04 21:37:47,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:47,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:47,960 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 6 states. [2020-09-04 21:37:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:48,112 INFO L93 Difference]: Finished difference Result 107 states and 159 transitions. [2020-09-04 21:37:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:48,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-09-04 21:37:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:48,118 INFO L225 Difference]: With dead ends: 107 [2020-09-04 21:37:48,118 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 21:37:48,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 21:37:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-09-04 21:37:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-04 21:37:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2020-09-04 21:37:48,147 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 72 [2020-09-04 21:37:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:48,147 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2020-09-04 21:37:48,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2020-09-04 21:37:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-09-04 21:37:48,153 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:48,153 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 11, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:48,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:37:48,153 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1454565455, now seen corresponding path program 3 times [2020-09-04 21:37:48,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:48,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666492286] [2020-09-04 21:37:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-09-04 21:37:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 197 proven. 298 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2020-09-04 21:37:48,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666492286] [2020-09-04 21:37:48,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:48,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:37:48,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272744631] [2020-09-04 21:37:48,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:37:48,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:37:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:48,677 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand 9 states. [2020-09-04 21:37:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:49,023 INFO L93 Difference]: Finished difference Result 220 states and 441 transitions. [2020-09-04 21:37:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:37:49,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-09-04 21:37:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:49,028 INFO L225 Difference]: With dead ends: 220 [2020-09-04 21:37:49,028 INFO L226 Difference]: Without dead ends: 117 [2020-09-04 21:37:49,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-04 21:37:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2020-09-04 21:37:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-09-04 21:37:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2020-09-04 21:37:49,065 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 179 [2020-09-04 21:37:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,065 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2020-09-04 21:37:49,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:37:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2020-09-04 21:37:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 21:37:49,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,069 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:49,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:37:49,070 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1778048969, now seen corresponding path program 4 times [2020-09-04 21:37:49,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956422092] [2020-09-04 21:37:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 21:37:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 110 proven. 71 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-09-04 21:37:49,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956422092] [2020-09-04 21:37:49,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:49,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:49,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104938158] [2020-09-04 21:37:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:49,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:49,518 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand 15 states. [2020-09-04 21:37:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:50,211 INFO L93 Difference]: Finished difference Result 254 states and 429 transitions. [2020-09-04 21:37:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:37:50,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2020-09-04 21:37:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:50,217 INFO L225 Difference]: With dead ends: 254 [2020-09-04 21:37:50,217 INFO L226 Difference]: Without dead ends: 155 [2020-09-04 21:37:50,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1105, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 21:37:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-04 21:37:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2020-09-04 21:37:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-09-04 21:37:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2020-09-04 21:37:50,258 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 121 [2020-09-04 21:37:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:50,259 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2020-09-04 21:37:50,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2020-09-04 21:37:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 21:37:50,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:50,265 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 10, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:50,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:37:50,266 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1975995462, now seen corresponding path program 5 times [2020-09-04 21:37:50,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:50,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528092248] [2020-09-04 21:37:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 21:37:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 142 proven. 258 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2020-09-04 21:37:50,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528092248] [2020-09-04 21:37:50,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:50,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:50,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549028714] [2020-09-04 21:37:50,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:50,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:50,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:50,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:50,852 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand 15 states. [2020-09-04 21:37:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:51,829 INFO L93 Difference]: Finished difference Result 271 states and 441 transitions. [2020-09-04 21:37:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-04 21:37:51,830 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2020-09-04 21:37:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:51,834 INFO L225 Difference]: With dead ends: 271 [2020-09-04 21:37:51,834 INFO L226 Difference]: Without dead ends: 172 [2020-09-04 21:37:51,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=532, Invalid=1820, Unknown=0, NotChecked=0, Total=2352 [2020-09-04 21:37:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-04 21:37:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2020-09-04 21:37:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-09-04 21:37:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2020-09-04 21:37:51,864 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 178 [2020-09-04 21:37:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:51,865 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2020-09-04 21:37:51,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2020-09-04 21:37:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-09-04 21:37:51,868 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:51,868 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 11, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:51,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:37:51,869 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2003866823, now seen corresponding path program 6 times [2020-09-04 21:37:51,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:51,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1212476433] [2020-09-04 21:37:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 21:37:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 180 proven. 344 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2020-09-04 21:37:52,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1212476433] [2020-09-04 21:37:52,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:52,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:52,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63421316] [2020-09-04 21:37:52,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:52,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:52,382 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 16 states. [2020-09-04 21:37:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:53,551 INFO L93 Difference]: Finished difference Result 319 states and 506 transitions. [2020-09-04 21:37:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-04 21:37:53,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 197 [2020-09-04 21:37:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:53,558 INFO L225 Difference]: With dead ends: 319 [2020-09-04 21:37:53,558 INFO L226 Difference]: Without dead ends: 196 [2020-09-04 21:37:53,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=692, Invalid=2500, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 21:37:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-09-04 21:37:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 153. [2020-09-04 21:37:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-04 21:37:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2020-09-04 21:37:53,596 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 197 [2020-09-04 21:37:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:53,598 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2020-09-04 21:37:53,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2020-09-04 21:37:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-09-04 21:37:53,601 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:53,602 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 13, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:53,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:37:53,602 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 159100369, now seen corresponding path program 7 times [2020-09-04 21:37:53,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:53,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678769685] [2020-09-04 21:37:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 525 proven. 337 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2020-09-04 21:37:54,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678769685] [2020-09-04 21:37:54,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:54,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:37:54,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261041675] [2020-09-04 21:37:54,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:37:54,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:37:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:54,543 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand 22 states. [2020-09-04 21:37:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:57,045 INFO L93 Difference]: Finished difference Result 401 states and 634 transitions. [2020-09-04 21:37:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-09-04 21:37:57,046 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 235 [2020-09-04 21:37:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:57,052 INFO L225 Difference]: With dead ends: 401 [2020-09-04 21:37:57,052 INFO L226 Difference]: Without dead ends: 266 [2020-09-04 21:37:57,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1481, Invalid=6529, Unknown=0, NotChecked=0, Total=8010 [2020-09-04 21:37:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-09-04 21:37:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 189. [2020-09-04 21:37:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-09-04 21:37:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2020-09-04 21:37:57,097 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 235 [2020-09-04 21:37:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:57,098 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2020-09-04 21:37:57,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:37:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2020-09-04 21:37:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 21:37:57,103 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:57,103 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:37:57,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:37:57,103 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash 29784778, now seen corresponding path program 8 times [2020-09-04 21:37:57,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:57,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334471338] [2020-09-04 21:37:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:37:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 21:37:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 588 proven. 448 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2020-09-04 21:37:58,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334471338] [2020-09-04 21:37:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:37:58,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883014561] [2020-09-04 21:37:58,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:37:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:37:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:37:58,049 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand 23 states. [2020-09-04 21:38:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:00,921 INFO L93 Difference]: Finished difference Result 473 states and 777 transitions. [2020-09-04 21:38:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-09-04 21:38:00,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 254 [2020-09-04 21:38:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:00,928 INFO L225 Difference]: With dead ends: 473 [2020-09-04 21:38:00,929 INFO L226 Difference]: Without dead ends: 302 [2020-09-04 21:38:00,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2020-09-04 21:38:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-04 21:38:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2020-09-04 21:38:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 21:38:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-09-04 21:38:00,966 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 254 [2020-09-04 21:38:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:00,967 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-09-04 21:38:00,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:38:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-09-04 21:38:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-09-04 21:38:00,971 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:00,971 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:00,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:38:00,972 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1139770503, now seen corresponding path program 9 times [2020-09-04 21:38:00,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:00,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1859030432] [2020-09-04 21:38:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:38:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:38:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:38:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:38:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:38:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:38:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:38:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:38:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:38:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:38:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:38:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 21:38:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 21:38:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 865 proven. 70 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2020-09-04 21:38:01,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1859030432] [2020-09-04 21:38:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:01,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:38:01,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875113410] [2020-09-04 21:38:01,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:38:01,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:38:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:01,932 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 25 states. [2020-09-04 21:38:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:03,632 INFO L93 Difference]: Finished difference Result 301 states and 426 transitions. [2020-09-04 21:38:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 21:38:03,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 273 [2020-09-04 21:38:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:03,634 INFO L225 Difference]: With dead ends: 301 [2020-09-04 21:38:03,634 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:38:03,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=933, Invalid=3897, Unknown=0, NotChecked=0, Total=4830 [2020-09-04 21:38:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:38:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:38:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:38:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:38:03,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2020-09-04 21:38:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:03,640 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:38:03,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:38:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:38:03,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:38:03,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:38:03,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:38:04,164 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:04,403 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:04,746 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 82 [2020-09-04 21:38:05,083 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:05,357 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:05,488 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-09-04 21:38:05,683 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:05,918 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:06,861 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2020-09-04 21:38:07,087 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2020-09-04 21:38:07,385 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 21:38:07,784 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 21:38:08,063 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:08,247 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:08,540 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-09-04 21:38:08,851 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2020-09-04 21:38:09,043 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:09,221 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:09,491 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 82 [2020-09-04 21:38:09,788 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:10,018 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:10,315 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:10,528 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:11,431 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2020-09-04 21:38:11,657 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2020-09-04 21:38:11,961 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 21:38:12,362 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 21:38:12,637 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:12,816 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 21:38:13,105 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-09-04 21:38:13,411 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2020-09-04 21:38:13,954 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:14,173 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:14,538 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 91 [2020-09-04 21:38:14,916 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:15,201 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:15,341 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-09-04 21:38:15,562 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:15,826 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:16,942 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 60 [2020-09-04 21:38:17,257 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 66 [2020-09-04 21:38:17,615 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 21:38:18,121 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 21:38:18,454 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:18,675 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:19,027 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2020-09-04 21:38:19,436 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2020-09-04 21:38:20,400 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:20,622 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:21,001 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 91 [2020-09-04 21:38:21,363 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:21,645 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:21,781 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-09-04 21:38:22,004 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:22,269 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:23,381 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 60 [2020-09-04 21:38:23,697 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 66 [2020-09-04 21:38:24,056 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 21:38:24,563 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 21:38:24,903 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:25,130 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 21:38:25,485 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2020-09-04 21:38:25,891 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2020-09-04 21:38:26,521 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-09-04 21:38:27,752 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-09-04 21:38:27,972 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-09-04 21:38:28,455 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-09-04 21:38:34,348 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-09-04 21:38:35,926 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-09-04 21:38:36,047 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 12 [2020-09-04 21:38:38,022 WARN L193 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-09-04 21:38:38,232 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-09-04 21:38:40,447 WARN L193 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-09-04 21:38:40,677 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-09-04 21:38:42,396 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 134 DAG size of output: 54 [2020-09-04 21:38:42,619 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2020-09-04 21:38:43,723 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2020-09-04 21:38:45,025 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2020-09-04 21:38:46,272 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2020-09-04 21:38:46,279 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,279 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,279 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,280 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,280 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,280 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:38:46,281 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 14 22) the Hoare annotation is: (let ((.cse6 (= |ackermann_#in~n| 0)) (.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (<= |ackermann_#in~n| 1)) (.cse9 (<= |ackermann_#in~m| 1)) (.cse12 (<= 3 |ackermann_#res|)) (.cse3 (<= 1 |ackermann_#in~m|))) (let ((.cse8 (and .cse7 .cse9 .cse12 .cse3)) (.cse10 (and (<= 2 |ackermann_#res|) .cse9 .cse6 .cse3 .cse0 .cse1)) (.cse5 (<= 7 |ackermann_#res|)) (.cse11 (not .cse3)) (.cse4 (<= 5 |ackermann_#res|)) (.cse2 (= |ackermann_#in~m| 0))) (and (or (and .cse0 .cse1 .cse2) .cse3) (or (and (<= |ackermann_#in~m| 2) .cse4) .cse5 .cse6 (not .cse7) .cse8 .cse2) (or (not .cse9) (<= 4 |ackermann_#res|) .cse10 .cse11 .cse8) (or .cse7 .cse5 .cse9) (or (and (<= |ackermann_#in~n| 2) .cse12 .cse0 .cse1) .cse10 (and .cse5 .cse0 .cse1) (and (<= 6 |ackermann_#res|) .cse0 .cse1 (<= |ackermann_#in~n| 4)) .cse11 (and (<= |ackermann_#in~n| 3) .cse4 .cse0 .cse1)) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse2))))) [2020-09-04 21:38:46,281 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2020-09-04 21:38:46,282 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~m| 0))) [2020-09-04 21:38:46,282 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (let ((.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= |ackermann_#in~m| 1)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse2 (<= |ackermann_#in~n| 2)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse4 (= ackermann_~m |ackermann_#in~m|)) (.cse5 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (<= 2 |ackermann_#in~m|))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (<= 2 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse5 .cse7) (and (<= 6 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse5 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~m| 2) .cse2 .cse8 .cse4 .cse5 .cse7))))) [2020-09-04 21:38:46,282 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-09-04 21:38:46,282 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (let ((.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= |ackermann_#in~m| 1)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse2 (<= |ackermann_#in~n| 2)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse4 (= ackermann_~m |ackermann_#in~m|)) (.cse5 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (<= 2 |ackermann_#in~m|))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (<= 2 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse5 .cse7) (and (<= 6 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse5 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~m| 2) .cse2 .cse8 .cse4 .cse5 .cse7))))) [2020-09-04 21:38:46,283 INFO L264 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~m| 0))) [2020-09-04 21:38:46,283 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (or (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and (<= 3 |ackermann_#t~ret0|) (<= 2 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-09-04 21:38:46,283 INFO L264 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (let ((.cse5 (<= 5 |ackermann_#t~ret2|)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse1 (<= |ackermann_#in~n| 2)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse6 (<= 6 |ackermann_#t~ret1|)) (.cse7 (<= 7 |ackermann_#t~ret2|))) (and (let ((.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= 4 |ackermann_#t~ret2|)) (and .cse3 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) .cse2) (and (<= 6 |ackermann_#t~ret2|) .cse4 .cse2 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse5 (<= 4 |ackermann_#t~ret1|) .cse2) (and .cse6 .cse7 .cse2))) (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (= ackermann_~n |ackermann_#in~n|) (let ((.cse8 (<= |ackermann_#in~m| 2)) (.cse9 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse0 .cse5 .cse8 .cse9) (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and .cse3 .cse0 .cse7 .cse9) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse6 .cse7 .cse9))))) [2020-09-04 21:38:46,284 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (or (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and (<= 3 |ackermann_#t~ret0|) (<= 2 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-09-04 21:38:46,284 INFO L264 CegarLoopResult]: At program point L21-4(line 21) the Hoare annotation is: (let ((.cse5 (<= 5 |ackermann_#t~ret2|)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse1 (<= |ackermann_#in~n| 2)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse6 (<= 6 |ackermann_#t~ret1|)) (.cse7 (<= 7 |ackermann_#t~ret2|))) (and (let ((.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= 4 |ackermann_#t~ret2|)) (and .cse3 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) .cse2) (and (<= 6 |ackermann_#t~ret2|) .cse4 .cse2 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse5 (<= 4 |ackermann_#t~ret1|) .cse2) (and .cse6 .cse7 .cse2))) (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (= ackermann_~n |ackermann_#in~n|) (let ((.cse8 (<= |ackermann_#in~m| 2)) (.cse9 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse0 .cse5 .cse8 .cse9) (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and .cse3 .cse0 .cse7 .cse9) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse6 .cse7 .cse9))))) [2020-09-04 21:38:46,284 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-09-04 21:38:46,284 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|))) (or (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) .cse1 .cse2) (and .cse0 (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|) .cse1 .cse2 (<= 2 |ackermann_#in~m|)))) [2020-09-04 21:38:46,284 INFO L264 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: (let ((.cse4 (<= 7 |ackermann_#res|)) (.cse5 (<= 7 |ackermann_#t~ret2|)) (.cse1 (<= 5 |ackermann_#t~ret2|)) (.cse3 (<= 5 |ackermann_#res|)) (.cse0 (<= |ackermann_#in~n| 1)) (.cse9 (<= |ackermann_#in~m| 1))) (let ((.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse6 (and .cse0 .cse9 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) (<= 3 |ackermann_#res|))) (.cse7 (and .cse9 .cse1 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse3)) (.cse11 (<= |ackermann_#in~n| 2)) (.cse10 (and .cse4 (<= 6 |ackermann_#t~ret1|) .cse5))) (and (let ((.cse2 (<= |ackermann_#in~m| 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5) .cse6 .cse7 (and .cse4 .cse8 .cse2 .cse5) (and (<= 6 |ackermann_#t~ret2|) .cse9 (<= 6 |ackermann_#res|)) .cse10 (and .cse9 (<= 4 |ackermann_#res|) .cse11 (<= 4 |ackermann_#t~ret2|)))) (or (and .cse9 .cse8 (<= |ackermann_#in~n| 4)) .cse6 .cse7 (and (<= 3 |ackermann_#t~ret1|) .cse11) .cse10) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)))) [2020-09-04 21:38:46,285 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-09-04 21:38:46,285 INFO L264 CegarLoopResult]: At program point L21-6(line 21) the Hoare annotation is: (let ((.cse8 (<= 5 |ackermann_#t~ret2|)) (.cse9 (<= 5 |ackermann_#res|)) (.cse0 (<= |ackermann_#in~m| 1)) (.cse6 (<= 7 |ackermann_#res|)) (.cse7 (<= 7 |ackermann_#t~ret2|)) (.cse5 (<= |ackermann_#in~n| 1))) (and (let ((.cse3 (<= 3 |ackermann_#t~ret2|)) (.cse4 (<= 3 |ackermann_#res|)) (.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|))) (or (and .cse0 (<= 6 |ackermann_#t~ret2|) (<= 6 |ackermann_#res|) .cse1 .cse2 (<= |ackermann_#in~n| 4)) (and .cse0 .cse3 (<= |ackermann_#in~n| 2) .cse4 .cse1 .cse2) (and .cse5 .cse3 .cse4 .cse1 .cse2) (and .cse6 .cse7 .cse1 .cse2) (and .cse0 .cse8 (<= |ackermann_#in~n| 3) .cse9 .cse1 .cse2))) (let ((.cse10 (<= 2 |ackermann_#in~m|))) (or (and .cse8 (<= |ackermann_#in~m| 2) .cse9 .cse10) (and .cse0 (<= 1 |ackermann_#in~m|)) (and .cse6 .cse7 .cse10))) (or .cse5 (and (<= 4 |ackermann_#res|) (<= 4 |ackermann_#t~ret2|))))) [2020-09-04 21:38:46,285 INFO L264 CegarLoopResult]: At program point L14(lines 14 22) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-09-04 21:38:46,285 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 14 22) the Hoare annotation is: (let ((.cse2 (= |ackermann_#in~n| 0)) (.cse11 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse8 (<= |ackermann_#in~m| 1)) (.cse12 (<= 3 |ackermann_#res|)) (.cse7 (<= 1 |ackermann_#in~m|))) (let ((.cse4 (and .cse3 .cse8 .cse12 .cse7)) (.cse5 (= |ackermann_#in~m| 0)) (.cse1 (<= 7 |ackermann_#res|)) (.cse0 (<= 5 |ackermann_#res|)) (.cse9 (and (<= 2 |ackermann_#res|) .cse8 .cse2 .cse7 .cse11 .cse6)) (.cse10 (not .cse7))) (and (or (and (<= |ackermann_#in~m| 2) .cse0) .cse1 .cse2 (not .cse3) .cse4 .cse5) (or (and .cse6 .cse5) .cse7) (or (not .cse8) (<= 4 |ackermann_#res|) .cse9 .cse10 .cse4) (or (and .cse1 .cse11) (and .cse8 .cse11) (and .cse3 .cse11)) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse5)) (or (and .cse1 .cse6) (and (<= |ackermann_#in~n| 2) .cse12 .cse6) (and (<= 6 |ackermann_#res|) .cse6 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse0 .cse6) .cse9 .cse10)))) [2020-09-04 21:38:46,285 INFO L271 CegarLoopResult]: At program point L33(lines 33 38) the Hoare annotation is: true [2020-09-04 21:38:46,285 INFO L271 CegarLoopResult]: At program point L27(lines 27 31) the Hoare annotation is: true [2020-09-04 21:38:46,286 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 45) the Hoare annotation is: true [2020-09-04 21:38:46,286 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 45) the Hoare annotation is: true [2020-09-04 21:38:46,286 INFO L264 CegarLoopResult]: At program point L40(lines 40 44) the Hoare annotation is: (or (<= 7 main_~result~0) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-09-04 21:38:46,286 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 21:38:46,286 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) the Hoare annotation is: false [2020-09-04 21:38:46,286 INFO L271 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-09-04 21:38:46,286 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: false [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-09-04 21:38:46,287 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-09-04 21:38:46,288 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (<= 7 |main_#t~ret5|) (<= main_~n~0 1)) [2020-09-04 21:38:46,288 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 21:38:46,288 INFO L264 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (<= 7 |main_#t~ret5|) (<= main_~n~0 1)) [2020-09-04 21:38:46,288 INFO L264 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (and (<= 7 main_~result~0) (<= 7 |main_#t~ret5|)) (<= main_~n~0 1)) [2020-09-04 21:38:46,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:38:46 BoogieIcfgContainer [2020-09-04 21:38:46,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:38:46,326 INFO L168 Benchmark]: Toolchain (without parser) took 60697.29 ms. Allocated memory was 137.4 MB in the beginning and 595.6 MB in the end (delta: 458.2 MB). Free memory was 102.1 MB in the beginning and 302.1 MB in the end (delta: -200.0 MB). Peak memory consumption was 483.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:46,327 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:38:46,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.96 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:46,328 INFO L168 Benchmark]: Boogie Preprocessor took 33.39 ms. Allocated memory is still 137.4 MB. Free memory was 92.3 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:46,329 INFO L168 Benchmark]: RCFGBuilder took 401.44 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 90.9 MB in the beginning and 165.1 MB in the end (delta: -74.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:46,329 INFO L168 Benchmark]: TraceAbstraction took 59972.44 ms. Allocated memory was 200.3 MB in the beginning and 595.6 MB in the end (delta: 395.3 MB). Free memory was 164.4 MB in the beginning and 302.1 MB in the end (delta: -137.7 MB). Peak memory consumption was 482.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:46,332 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 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.96 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.39 ms. Allocated memory is still 137.4 MB. Free memory was 92.3 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.44 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 90.9 MB in the beginning and 165.1 MB in the end (delta: -74.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59972.44 ms. Allocated memory was 200.3 MB in the beginning and 595.6 MB in the end (delta: 395.3 MB). Free memory was 164.4 MB in the beginning and 302.1 MB in the end (delta: -137.7 MB). Peak memory consumption was 482.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 14]: Procedure Contract for ackermann Derived contract for procedure ackermann: (((((((m == \old(m) && n == \old(n)) && \old(m) == 0) || 1 <= \old(m)) && ((((((\old(m) <= 2 && 5 <= \result) || 7 <= \result) || \old(n) == 0) || !(\old(n) <= 1)) || (((\old(n) <= 1 && \old(m) <= 1) && 3 <= \result) && 1 <= \old(m))) || \old(m) == 0)) && ((((!(\old(m) <= 1) || 4 <= \result) || (((((2 <= \result && \old(m) <= 1) && \old(n) == 0) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || !(1 <= \old(m))) || (((\old(n) <= 1 && \old(m) <= 1) && 3 <= \result) && 1 <= \old(m)))) && ((\old(n) <= 1 || 7 <= \result) || \old(m) <= 1)) && ((((((((\old(n) <= 2 && 3 <= \result) && m == \old(m)) && n == \old(n)) || (((((2 <= \result && \old(m) <= 1) && \old(n) == 0) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || ((7 <= \result && m == \old(m)) && n == \old(n))) || (((6 <= \result && m == \old(m)) && n == \old(n)) && \old(n) <= 4)) || !(1 <= \old(m))) || (((\old(n) <= 3 && 5 <= \result) && m == \old(m)) && n == \old(n)))) && (\old(n) + 1 <= \result || !(\old(m) == 0)) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.1s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 505 SDtfs, 862 SDslu, 2305 SDs, 0 SdLazy, 3738 SolverSat, 882 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7544 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=10, 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, 11 MinimizatonAttempts, 292 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 2564 PreInvPairs, 8106 NumberOfFragments, 1444 HoareAnnotationTreeSize, 2564 FomulaSimplifications, 3142373 FormulaSimplificationTreeSizeReduction, 28.9s HoareSimplificationTime, 44 FomulaSimplificationsInter, 474948 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1609 ConstructedInterpolants, 0 QuantifiedInterpolants, 576235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 7451/9320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...