/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:29:58,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:58,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:58,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:58,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:58,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:58,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:58,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:58,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:58,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:58,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:58,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:58,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:58,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:58,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:58,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:58,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:58,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:58,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:58,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:58,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:58,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:58,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:58,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:58,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:58,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:58,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:58,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:58,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:58,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:58,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:58,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:58,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:58,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:58,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:58,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:58,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:58,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:58,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:58,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:58,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:58,126 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:29:58,146 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:58,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:58,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:58,149 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:58,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:58,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:58,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:58,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:58,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:58,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:58,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:58,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:58,152 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:58,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:58,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:58,153 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:58,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:58,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:58,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:58,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:58,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:58,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:58,155 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:58,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:58,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:58,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:58,629 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:58,629 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:58,631 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-09-04 16:29:58,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d30116f3f/94886712aaf344ac94ac9d6ee28fcdbd/FLAG70bee06a4 [2020-09-04 16:29:59,356 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:59,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-09-04 16:29:59,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d30116f3f/94886712aaf344ac94ac9d6ee28fcdbd/FLAG70bee06a4 [2020-09-04 16:29:59,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d30116f3f/94886712aaf344ac94ac9d6ee28fcdbd [2020-09-04 16:29:59,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:59,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:59,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:59,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:59,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:59,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:59" (1/1) ... [2020-09-04 16:29:59,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58be2b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:59, skipping insertion in model container [2020-09-04 16:29:59,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:59" (1/1) ... [2020-09-04 16:29:59,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:59,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:30:00,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:00,072 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:30:00,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:00,123 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:30:00,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00 WrapperNode [2020-09-04 16:30:00,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:00,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:30:00,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:30:00,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:30:00,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (1/1) ... [2020-09-04 16:30:00,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:30:00,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:30:00,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:30:00,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:30:00,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (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:30:00,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:30:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:30:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:30:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:30:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:30:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:30:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:30:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:30:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:30:00,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:30:00,578 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:30:00,578 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:30:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:00 BoogieIcfgContainer [2020-09-04 16:30:00,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:30:00,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:30:00,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:30:00,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:30:00,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:59" (1/3) ... [2020-09-04 16:30:00,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7369a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:00, skipping insertion in model container [2020-09-04 16:30:00,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:00" (2/3) ... [2020-09-04 16:30:00,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7369a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:00, skipping insertion in model container [2020-09-04 16:30:00,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:00" (3/3) ... [2020-09-04 16:30:00,597 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-09-04 16:30:00,611 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:30:00,630 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:30:00,692 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:30:00,760 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:30:00,760 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:30:00,760 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:30:00,761 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:30:00,761 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:30:00,764 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:30:00,764 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:30:00,764 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:30:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:30:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:30:00,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:00,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:00,798 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:00,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:30:00,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:00,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141974373] [2020-09-04 16:30:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:00,888 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,072 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:30:01,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141974373] [2020-09-04 16:30:01,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:01,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:30:01,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388456374] [2020-09-04 16:30:01,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:30:01,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:30:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:30:01,105 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:30:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:01,208 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:30:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:30:01,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:30:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:01,224 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:30:01,224 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:30:01,229 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:30:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:30:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:30:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:30:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:30:01,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:30:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:01,282 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:30:01,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:30:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:30:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:30:01,285 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:01,285 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:01,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:30:01,286 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:30:01,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:01,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1564692292] [2020-09-04 16:30:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:01,290 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:30:01,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1564692292] [2020-09-04 16:30:01,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:01,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:30:01,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640729989] [2020-09-04 16:30:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:30:01,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:30:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:30:01,436 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:30:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:01,499 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:30:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:30:01,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:30:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:01,502 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:30:01,502 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:30:01,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:30:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:30:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:30:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:30:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:30:01,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:30:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:01,517 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:30:01,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:30:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:30:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:30:01,519 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:01,520 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:01,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:30:01,520 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:30:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:01,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697954293] [2020-09-04 16:30:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:01,524 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:30:01,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697954293] [2020-09-04 16:30:01,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:01,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:30:01,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111403424] [2020-09-04 16:30:01,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:30:01,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:30:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:30:01,697 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:30:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:01,773 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:30:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:30:01,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:30:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:01,775 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:30:01,775 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:30:01,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:30:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:30:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:30:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:30:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:30:01,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:30:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:01,790 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:30:01,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:30:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:30:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:30:01,792 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:01,792 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:01,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:30:01,793 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:30:01,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:01,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223837127] [2020-09-04 16:30:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:01,797 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:01,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:30:02,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223837127] [2020-09-04 16:30:02,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:02,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:30:02,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831124812] [2020-09-04 16:30:02,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:30:02,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:30:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:30:02,071 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:30:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:02,168 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:30:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:30:02,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:30:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:02,170 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:30:02,170 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:30:02,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:30:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:30:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:30:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:30:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:30:02,183 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:30:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:02,183 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:30:02,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:30:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:30:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:30:02,185 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:02,186 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:02,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:30:02,186 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:30:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:02,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369439608] [2020-09-04 16:30:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:02,189 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:30:02,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369439608] [2020-09-04 16:30:02,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:02,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:30:02,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568577429] [2020-09-04 16:30:02,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:30:02,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:02,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:30:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:30:02,465 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:30:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:02,560 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:30:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:30:02,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:30:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:02,563 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:30:02,563 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:30:02,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:30:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:30:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:30:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:30:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:30:02,575 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:30:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:02,576 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:30:02,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:30:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:30:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:30:02,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:02,578 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:02,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:30:02,579 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:30:02,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:02,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [458695217] [2020-09-04 16:30:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:02,582 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:30:02,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [458695217] [2020-09-04 16:30:02,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:02,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:30:02,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893607165] [2020-09-04 16:30:02,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:30:02,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:30:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:30:02,941 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 15 states. [2020-09-04 16:30:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:03,336 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:30:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:30:03,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-09-04 16:30:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:03,339 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:30:03,339 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:30:03,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:30:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:30:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:30:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:30:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:30:03,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:30:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:03,352 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:30:03,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:30:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:30:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:30:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:03,355 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:03,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:30:03,355 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:30:03,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:03,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938106931] [2020-09-04 16:30:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:03,358 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:30:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:30:03,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938106931] [2020-09-04 16:30:03,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:03,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:30:03,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307042886] [2020-09-04 16:30:03,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:30:03,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:30:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:30:03,655 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:30:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:03,962 INFO L93 Difference]: Finished difference Result 86 states and 122 transitions. [2020-09-04 16:30:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:30:03,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:30:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:03,964 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:30:03,965 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:30:03,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:30:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:30:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:30:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:30:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:30:03,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-09-04 16:30:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:03,971 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:30:03,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:30:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:30:03,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:30:03,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:30:03,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:30:04,682 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-09-04 16:30:04,903 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-09-04 16:30:05,137 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-09-04 16:30:05,298 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-09-04 16:30:05,454 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-09-04 16:30:05,460 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,460 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,460 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,461 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:05,461 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 16:30:05,461 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 16:30:05,462 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-09-04 16:30:05,462 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 16:30:05,462 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:30:05,462 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-09-04 16:30:05,462 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 5 |main_#t~ret1|) (<= 5 main_~input~0) (<= |main_#t~ret1| 5)) [2020-09-04 16:30:05,463 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-09-04 16:30:05,463 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 5 |main_#t~ret1|) (<= 5 main_~input~0) (<= |main_#t~ret1| 5)) [2020-09-04 16:30:05,463 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 5 |main_#t~ret1|) (<= 5 main_~input~0) (<= 5 main_~result~0) (<= |main_#t~ret1| 5) (<= main_~result~0 5)) [2020-09-04 16:30:05,464 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse0 (<= |id_#res| 5)))) [2020-09-04 16:30:05,464 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse0 (<= |id_#res| 5)))) [2020-09-04 16:30:05,464 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 16:30:05,464 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:30:05,465 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:30:05,465 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) [2020-09-04 16:30:05,465 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-09-04 16:30:05,466 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) [2020-09-04 16:30:05,466 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) [2020-09-04 16:30:05,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:30:05 BoogieIcfgContainer [2020-09-04 16:30:05,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:30:05,496 INFO L168 Benchmark]: Toolchain (without parser) took 5767.11 ms. Allocated memory was 138.9 MB in the beginning and 278.9 MB in the end (delta: 140.0 MB). Free memory was 103.3 MB in the beginning and 239.9 MB in the end (delta: -136.6 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,497 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.91 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,498 INFO L168 Benchmark]: Boogie Preprocessor took 39.20 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,500 INFO L168 Benchmark]: RCFGBuilder took 418.81 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 170.6 MB in the end (delta: -78.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,501 INFO L168 Benchmark]: TraceAbstraction took 4906.74 ms. Allocated memory was 202.9 MB in the beginning and 278.9 MB in the end (delta: 76.0 MB). Free memory was 170.6 MB in the beginning and 239.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:05,505 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.29 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 395.91 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.20 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.81 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 170.6 MB in the end (delta: -78.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4906.74 ms. Allocated memory was 202.9 MB in the beginning and 278.9 MB in the end (delta: 76.0 MB). Free memory was 170.6 MB in the beginning and 239.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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: 9]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: (((((((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || (\old(x) == x && 6 <= \old(x))) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || (((5 <= \result && 5 <= \old(x)) && \old(x) == x) && \result <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 159 SDtfs, 146 SDslu, 684 SDs, 0 SdLazy, 469 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 79 PreInvPairs, 288 NumberOfFragments, 548 HoareAnnotationTreeSize, 79 FomulaSimplifications, 366 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 25 FomulaSimplificationsInter, 1800 FormulaSimplificationTreeSizeReductionInter, 0.9s 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...