/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:12:05,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:12:05,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:12:05,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:12:05,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:12:05,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:12:05,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:12:05,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:12:05,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:12:05,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:12:05,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:12:05,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:12:05,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:12:05,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:12:05,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:12:05,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:12:05,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:12:05,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:12:05,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:12:05,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:12:05,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:12:05,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:12:05,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:12:05,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:12:05,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:12:05,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:12:05,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:12:05,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:12:05,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:12:05,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:12:05,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:12:05,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:12:05,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:12:05,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:12:05,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:12:05,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:12:05,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:12:05,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:12:05,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:12:05,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:12:05,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:12:05,932 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 16:12:05,947 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:12:05,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:12:05,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:12:05,950 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:12:05,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:12:05,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:12:05,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:12:05,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:12:05,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:12:05,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:12:05,952 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:12:05,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:12:05,952 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:12:05,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:12:05,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:12:05,953 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:12:05,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:12:05,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:12:05,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:12:05,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:12:05,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:12:05,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:12:05,955 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:12:06,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:12:06,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:12:06,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:12:06,413 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:12:06,413 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:12:06,414 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 16:12:06,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a7f1fd16e/803a6b33d74048438c1c917a32e78a0a/FLAGb5bf38e43 [2020-09-04 16:12:07,029 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:12:07,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Ackermann04.c [2020-09-04 16:12:07,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a7f1fd16e/803a6b33d74048438c1c917a32e78a0a/FLAGb5bf38e43 [2020-09-04 16:12:07,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a7f1fd16e/803a6b33d74048438c1c917a32e78a0a [2020-09-04 16:12:07,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:12:07,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:12:07,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:07,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:12:07,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:12:07,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d876c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07, skipping insertion in model container [2020-09-04 16:12:07,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:12:07,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:12:07,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:07,660 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:12:07,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:07,705 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:12:07,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07 WrapperNode [2020-09-04 16:12:07,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:07,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:12:07,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:12:07,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:12:07,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (1/1) ... [2020-09-04 16:12:07,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:12:07,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:12:07,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:12:07,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:12:07,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (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 16:12:07,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:12:07,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:12:07,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-09-04 16:12:07,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:12:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:12:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:12:07,883 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-09-04 16:12:07,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:12:07,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:12:07,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:12:08,141 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:12:08,141 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:12:08,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:08 BoogieIcfgContainer [2020-09-04 16:12:08,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:12:08,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:12:08,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:12:08,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:12:08,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:12:07" (1/3) ... [2020-09-04 16:12:08,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782e737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:08, skipping insertion in model container [2020-09-04 16:12:08,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:07" (2/3) ... [2020-09-04 16:12:08,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782e737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:08, skipping insertion in model container [2020-09-04 16:12:08,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:08" (3/3) ... [2020-09-04 16:12:08,156 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-09-04 16:12:08,168 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:12:08,178 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:12:08,205 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:12:08,254 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:12:08,254 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:12:08,254 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:12:08,254 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:12:08,254 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:12:08,255 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:12:08,259 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:12:08,259 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:12:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-04 16:12:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:12:08,301 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,302 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 16:12:08,303 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-09-04 16:12:08,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061811949] [2020-09-04 16:12:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,407 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,629 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 16:12:08,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061811949] [2020-09-04 16:12:08,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:08,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:12:08,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605016136] [2020-09-04 16:12:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:12:08,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:12:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:08,658 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2020-09-04 16:12:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:08,822 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2020-09-04 16:12:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:12:08,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-09-04 16:12:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:08,840 INFO L225 Difference]: With dead ends: 88 [2020-09-04 16:12:08,840 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:12:08,846 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 16:12:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:12:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:12:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:12:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-09-04 16:12:08,908 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2020-09-04 16:12:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:08,908 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-09-04 16:12:08,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:12:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-09-04 16:12:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:12:08,912 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,912 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 16:12:08,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:12:08,913 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-09-04 16:12:08,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851653826] [2020-09-04 16:12:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,918 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:12:09,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851653826] [2020-09-04 16:12:09,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:12:09,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203373448] [2020-09-04 16:12:09,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:12:09,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:12:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:09,037 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2020-09-04 16:12:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,154 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-09-04 16:12:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:12:09,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 16:12:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,157 INFO L225 Difference]: With dead ends: 83 [2020-09-04 16:12:09,158 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 16:12:09,160 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 16:12:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 16:12:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-09-04 16:12:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:12:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2020-09-04 16:12:09,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2020-09-04 16:12:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,178 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2020-09-04 16:12:09,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:12:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2020-09-04 16:12:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 16:12:09,181 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:09,182 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 16:12:09,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:12:09,184 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-09-04 16:12:09,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:09,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127686510] [2020-09-04 16:12:09,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:09,189 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 16:12:09,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127686510] [2020-09-04 16:12:09,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:09,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379943000] [2020-09-04 16:12:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:09,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:09,408 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 6 states. [2020-09-04 16:12:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,530 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2020-09-04 16:12:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:12:09,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-09-04 16:12:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,535 INFO L225 Difference]: With dead ends: 75 [2020-09-04 16:12:09,536 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 16:12:09,536 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 16:12:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 16:12:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-04 16:12:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 16:12:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2020-09-04 16:12:09,557 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 53 [2020-09-04 16:12:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,557 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2020-09-04 16:12:09,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2020-09-04 16:12:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:12:09,565 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:09,565 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 16:12:09,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:12:09,566 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1817818703, now seen corresponding path program 2 times [2020-09-04 16:12:09,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:09,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1193545642] [2020-09-04 16:12:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:09,569 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-04 16:12:09,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1193545642] [2020-09-04 16:12:09,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:09,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921265523] [2020-09-04 16:12:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:09,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:09,758 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 6 states. [2020-09-04 16:12:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,901 INFO L93 Difference]: Finished difference Result 107 states and 159 transitions. [2020-09-04 16:12:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:12:09,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-09-04 16:12:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,907 INFO L225 Difference]: With dead ends: 107 [2020-09-04 16:12:09,907 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 16:12:09,908 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 16:12:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 16:12:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-09-04 16:12:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-04 16:12:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2020-09-04 16:12:09,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 72 [2020-09-04 16:12:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,936 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2020-09-04 16:12:09,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2020-09-04 16:12:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-09-04 16:12:09,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:09,946 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 16:12:09,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:12:09,947 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1454565455, now seen corresponding path program 3 times [2020-09-04 16:12:09,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:09,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268337346] [2020-09-04 16:12:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:09,950 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-09-04 16:12:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 36 proven. 107 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2020-09-04 16:12:10,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268337346] [2020-09-04 16:12:10,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:10,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:12:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842080655] [2020-09-04 16:12:10,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:12:10,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:12:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:12:10,550 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand 9 states. [2020-09-04 16:12:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:10,902 INFO L93 Difference]: Finished difference Result 220 states and 441 transitions. [2020-09-04 16:12:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:12:10,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-09-04 16:12:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:10,909 INFO L225 Difference]: With dead ends: 220 [2020-09-04 16:12:10,909 INFO L226 Difference]: Without dead ends: 117 [2020-09-04 16:12:10,916 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 16:12:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-04 16:12:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2020-09-04 16:12:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-09-04 16:12:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2020-09-04 16:12:10,968 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 179 [2020-09-04 16:12:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:10,969 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2020-09-04 16:12:10,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:12:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2020-09-04 16:12:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 16:12:10,976 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:10,976 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 16:12:10,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:12:10,976 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1778048969, now seen corresponding path program 4 times [2020-09-04 16:12:10,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:10,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [9393741] [2020-09-04 16:12:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:10,982 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 16:12:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-09-04 16:12:11,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [9393741] [2020-09-04 16:12:11,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:11,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:11,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66073774] [2020-09-04 16:12:11,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:11,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:11,425 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand 15 states. [2020-09-04 16:12:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:12,131 INFO L93 Difference]: Finished difference Result 254 states and 429 transitions. [2020-09-04 16:12:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:12:12,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2020-09-04 16:12:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:12,140 INFO L225 Difference]: With dead ends: 254 [2020-09-04 16:12:12,140 INFO L226 Difference]: Without dead ends: 155 [2020-09-04 16:12:12,144 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 16:12:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-04 16:12:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2020-09-04 16:12:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-09-04 16:12:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2020-09-04 16:12:12,195 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 121 [2020-09-04 16:12:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:12,195 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2020-09-04 16:12:12,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2020-09-04 16:12:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 16:12:12,200 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:12,200 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 16:12:12,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:12:12,201 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1975995462, now seen corresponding path program 5 times [2020-09-04 16:12:12,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:12,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762748859] [2020-09-04 16:12:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:12,211 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 16:12:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-09-04 16:12:12,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762748859] [2020-09-04 16:12:12,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:12,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:12,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893327323] [2020-09-04 16:12:12,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:12,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:12,872 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand 15 states. [2020-09-04 16:12:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:13,858 INFO L93 Difference]: Finished difference Result 271 states and 441 transitions. [2020-09-04 16:12:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-04 16:12:13,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2020-09-04 16:12:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:13,862 INFO L225 Difference]: With dead ends: 271 [2020-09-04 16:12:13,862 INFO L226 Difference]: Without dead ends: 172 [2020-09-04 16:12:13,865 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 16:12:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-04 16:12:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2020-09-04 16:12:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-09-04 16:12:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2020-09-04 16:12:13,891 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 178 [2020-09-04 16:12:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:13,892 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2020-09-04 16:12:13,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2020-09-04 16:12:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-09-04 16:12:13,895 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:13,895 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 16:12:13,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:12:13,895 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2003866823, now seen corresponding path program 6 times [2020-09-04 16:12:13,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:13,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619845564] [2020-09-04 16:12:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:13,899 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 16:12:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 82 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-09-04 16:12:14,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619845564] [2020-09-04 16:12:14,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:14,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:14,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586168086] [2020-09-04 16:12:14,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:14,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:14,399 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 16 states. [2020-09-04 16:12:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:15,576 INFO L93 Difference]: Finished difference Result 319 states and 506 transitions. [2020-09-04 16:12:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-04 16:12:15,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 197 [2020-09-04 16:12:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:15,581 INFO L225 Difference]: With dead ends: 319 [2020-09-04 16:12:15,581 INFO L226 Difference]: Without dead ends: 196 [2020-09-04 16:12:15,585 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 16:12:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-09-04 16:12:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 153. [2020-09-04 16:12:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-04 16:12:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2020-09-04 16:12:15,610 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 197 [2020-09-04 16:12:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:15,611 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2020-09-04 16:12:15,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2020-09-04 16:12:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-09-04 16:12:15,615 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:15,615 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 16:12:15,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:12:15,615 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash 159100369, now seen corresponding path program 7 times [2020-09-04 16:12:15,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:15,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081519954] [2020-09-04 16:12:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:15,618 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 67 proven. 69 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-09-04 16:12:16,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081519954] [2020-09-04 16:12:16,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:16,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:12:16,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805686158] [2020-09-04 16:12:16,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:12:16,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:16,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:12:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:16,435 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand 22 states. [2020-09-04 16:12:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:18,925 INFO L93 Difference]: Finished difference Result 401 states and 634 transitions. [2020-09-04 16:12:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-09-04 16:12:18,926 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 235 [2020-09-04 16:12:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:18,931 INFO L225 Difference]: With dead ends: 401 [2020-09-04 16:12:18,931 INFO L226 Difference]: Without dead ends: 266 [2020-09-04 16:12:18,936 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 16:12:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-09-04 16:12:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 189. [2020-09-04 16:12:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-09-04 16:12:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2020-09-04 16:12:18,965 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 235 [2020-09-04 16:12:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:18,965 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2020-09-04 16:12:18,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:12:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2020-09-04 16:12:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 16:12:18,969 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:18,970 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 16:12:18,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:12:18,970 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash 29784778, now seen corresponding path program 8 times [2020-09-04 16:12:18,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:18,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1199064311] [2020-09-04 16:12:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:18,973 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 16:12:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 75 proven. 81 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2020-09-04 16:12:19,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1199064311] [2020-09-04 16:12:19,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:12:19,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482363016] [2020-09-04 16:12:19,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:12:19,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:12:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:12:19,810 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand 23 states. [2020-09-04 16:12:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:22,670 INFO L93 Difference]: Finished difference Result 473 states and 777 transitions. [2020-09-04 16:12:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-09-04 16:12:22,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 254 [2020-09-04 16:12:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:22,677 INFO L225 Difference]: With dead ends: 473 [2020-09-04 16:12:22,678 INFO L226 Difference]: Without dead ends: 302 [2020-09-04 16:12:22,687 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 16:12:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-04 16:12:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2020-09-04 16:12:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 16:12:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-09-04 16:12:22,724 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 254 [2020-09-04 16:12:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:22,724 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-09-04 16:12:22,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:12:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-09-04 16:12:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-09-04 16:12:22,728 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:22,729 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 16:12:22,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:12:22,729 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1139770503, now seen corresponding path program 9 times [2020-09-04 16:12:22,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:22,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2020251206] [2020-09-04 16:12:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:22,733 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 16:12:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:12:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 16:12:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 16:12:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:12:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 16:12:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 16:12:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2020-09-04 16:12:23,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2020251206] [2020-09-04 16:12:23,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:23,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:12:23,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633201215] [2020-09-04 16:12:23,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:12:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:12:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:23,990 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 25 states. [2020-09-04 16:12:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:25,597 INFO L93 Difference]: Finished difference Result 301 states and 426 transitions. [2020-09-04 16:12:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 16:12:25,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 273 [2020-09-04 16:12:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:25,599 INFO L225 Difference]: With dead ends: 301 [2020-09-04 16:12:25,599 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:12:25,604 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 16:12:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:12:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:12:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:12:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:12:25,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2020-09-04 16:12:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:25,606 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:12:25,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:12:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:12:25,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:12:25,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:12:25,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:12:26,128 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:26,430 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:26,788 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 82 [2020-09-04 16:12:27,128 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:27,393 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:27,506 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-09-04 16:12:27,818 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:28,056 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:29,094 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2020-09-04 16:12:29,324 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2020-09-04 16:12:29,633 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 16:12:30,027 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 16:12:30,304 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:30,485 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:30,776 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-09-04 16:12:31,083 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2020-09-04 16:12:31,267 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:31,449 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:31,730 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 82 [2020-09-04 16:12:31,990 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:32,217 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:32,546 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:32,743 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:33,648 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2020-09-04 16:12:33,877 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2020-09-04 16:12:34,179 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 16:12:34,572 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-09-04 16:12:34,844 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:35,021 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-09-04 16:12:35,312 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-09-04 16:12:35,614 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2020-09-04 16:12:36,141 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:36,361 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:36,721 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 91 [2020-09-04 16:12:37,054 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:37,335 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:37,446 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-09-04 16:12:37,735 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:37,979 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:39,094 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 60 [2020-09-04 16:12:39,406 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 66 [2020-09-04 16:12:39,771 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 16:12:40,269 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 16:12:40,601 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:40,822 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:41,173 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2020-09-04 16:12:41,576 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2020-09-04 16:12:42,536 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:42,766 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:43,127 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 91 [2020-09-04 16:12:43,449 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:43,736 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:43,846 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-09-04 16:12:44,135 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:44,380 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:45,490 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 60 [2020-09-04 16:12:45,810 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 66 [2020-09-04 16:12:46,166 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 16:12:46,660 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2020-09-04 16:12:46,991 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:47,210 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-09-04 16:12:47,560 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2020-09-04 16:12:47,964 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2020-09-04 16:12:48,584 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-09-04 16:12:49,814 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-09-04 16:12:50,033 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-09-04 16:12:50,503 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-09-04 16:12:56,356 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-09-04 16:12:57,899 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-09-04 16:12:58,020 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 12 [2020-09-04 16:12:59,980 WARN L193 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-09-04 16:13:00,200 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-09-04 16:13:02,411 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-09-04 16:13:02,640 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-09-04 16:13:04,382 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 134 DAG size of output: 54 [2020-09-04 16:13:04,597 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2020-09-04 16:13:05,694 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2020-09-04 16:13:06,977 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2020-09-04 16:13:08,225 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2020-09-04 16:13:08,232 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,232 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,232 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,232 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,232 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,233 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:13:08,233 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 16:13:08,234 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2020-09-04 16:13:08,234 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 16:13:08,235 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 16:13:08,235 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 16:13:08,235 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 16:13:08,235 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 16:13:08,235 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 16:13:08,236 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 16:13:08,236 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 16:13:08,236 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 16:13:08,237 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 16:13:08,237 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 16:13:08,237 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 16:13:08,237 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 16:13:08,238 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 16:13:08,238 INFO L264 CegarLoopResult]: At program point L14(lines 14 22) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-09-04 16:13:08,238 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 16:13:08,238 INFO L271 CegarLoopResult]: At program point L33(lines 33 38) the Hoare annotation is: true [2020-09-04 16:13:08,238 INFO L271 CegarLoopResult]: At program point L27(lines 27 31) the Hoare annotation is: true [2020-09-04 16:13:08,238 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 45) the Hoare annotation is: true [2020-09-04 16:13:08,239 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 45) the Hoare annotation is: true [2020-09-04 16:13:08,239 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 16:13:08,239 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 16:13:08,239 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) the Hoare annotation is: false [2020-09-04 16:13:08,239 INFO L271 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-09-04 16:13:08,239 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: false [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-09-04 16:13:08,240 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-09-04 16:13:08,240 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 16:13:08,241 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 16:13:08,241 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 16:13:08,241 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 16:13:08,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:13:08 BoogieIcfgContainer [2020-09-04 16:13:08,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:13:08,268 INFO L168 Benchmark]: Toolchain (without parser) took 60870.67 ms. Allocated memory was 108.0 MB in the beginning and 547.9 MB in the end (delta: 439.9 MB). Free memory was 74.5 MB in the beginning and 395.3 MB in the end (delta: -320.9 MB). Peak memory consumption was 427.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,269 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 108.0 MB. Free memory was 91.7 MB in the beginning and 91.6 MB in the end (delta: 105.1 kB). Peak memory consumption was 105.1 kB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.97 ms. Allocated memory was 108.0 MB in the beginning and 122.7 MB in the end (delta: 14.7 MB). Free memory was 74.2 MB in the beginning and 101.3 MB in the end (delta: -27.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,270 INFO L168 Benchmark]: Boogie Preprocessor took 27.98 ms. Allocated memory is still 122.7 MB. Free memory was 101.3 MB in the beginning and 99.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,271 INFO L168 Benchmark]: RCFGBuilder took 412.26 ms. Allocated memory was 122.7 MB in the beginning and 162.0 MB in the end (delta: 39.3 MB). Free memory was 99.4 MB in the beginning and 135.2 MB in the end (delta: -35.9 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,272 INFO L168 Benchmark]: TraceAbstraction took 60118.45 ms. Allocated memory was 162.0 MB in the beginning and 547.9 MB in the end (delta: 385.9 MB). Free memory was 134.8 MB in the beginning and 395.3 MB in the end (delta: -260.6 MB). Peak memory consumption was 434.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:13:08,275 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.20 ms. Allocated memory is still 108.0 MB. Free memory was 91.7 MB in the beginning and 91.6 MB in the end (delta: 105.1 kB). Peak memory consumption was 105.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.97 ms. Allocated memory was 108.0 MB in the beginning and 122.7 MB in the end (delta: 14.7 MB). Free memory was 74.2 MB in the beginning and 101.3 MB in the end (delta: -27.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.98 ms. Allocated memory is still 122.7 MB. Free memory was 101.3 MB in the beginning and 99.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.26 ms. Allocated memory was 122.7 MB in the beginning and 162.0 MB in the end (delta: 39.3 MB). Free memory was 99.4 MB in the beginning and 135.2 MB in the end (delta: -35.9 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60118.45 ms. Allocated memory was 162.0 MB in the beginning and 547.9 MB in the end (delta: 385.9 MB). Free memory was 134.8 MB in the beginning and 395.3 MB in the end (delta: -260.6 MB). Peak memory consumption was 434.2 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.3s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 10.8s, 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, 29.0s HoareSimplificationTime, 44 FomulaSimplificationsInter, 474948 FormulaSimplificationTreeSizeReductionInter, 13.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...