/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_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:29:12,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:12,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:12,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:12,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:12,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:12,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:12,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:12,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:12,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:12,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:12,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:12,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:12,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:12,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:12,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:12,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:12,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:12,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:12,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:12,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:12,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:12,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:12,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:12,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:12,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:12,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:12,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:12,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:12,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:12,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:12,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:12,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:12,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:12,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:12,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:12,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:12,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:12,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:12,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:12,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:12,199 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:12,211 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:12,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:12,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:12,213 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:12,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:12,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:12,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:12,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:12,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:12,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:12,215 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:12,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:12,215 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:12,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:12,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:12,216 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:12,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:12,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:12,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:12,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:12,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:12,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:12,217 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:12,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:12,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:12,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:12,696 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:12,697 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:12,698 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-09-04 16:29:12,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/415620202/044a9309493d4834bfa0aa0d6ad0774e/FLAG25539ff6e [2020-09-04 16:29:13,336 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:13,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-09-04 16:29:13,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/415620202/044a9309493d4834bfa0aa0d6ad0774e/FLAG25539ff6e [2020-09-04 16:29:13,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/415620202/044a9309493d4834bfa0aa0d6ad0774e [2020-09-04 16:29:13,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:13,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:13,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:13,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:13,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:13,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:13,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7e2148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13, skipping insertion in model container [2020-09-04 16:29:13,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:13,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:13,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:29:13,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:13,954 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:29:13,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:13,991 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:29:13,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13 WrapperNode [2020-09-04 16:29:13,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:13,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:29:13,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:29:13,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:29:14,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (1/1) ... [2020-09-04 16:29:14,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:29:14,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:29:14,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:29:14,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:29:14,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (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:29:14,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:29:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:29:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:29:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:29:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:29:14,384 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:29:14,384 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:29:14,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:14 BoogieIcfgContainer [2020-09-04 16:29:14,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:29:14,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:29:14,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:29:14,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:29:14,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:13" (1/3) ... [2020-09-04 16:29:14,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fddb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:14, skipping insertion in model container [2020-09-04 16:29:14,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:13" (2/3) ... [2020-09-04 16:29:14,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fddb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:14, skipping insertion in model container [2020-09-04 16:29:14,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:14" (3/3) ... [2020-09-04 16:29:14,400 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-09-04 16:29:14,412 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:29:14,423 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:29:14,448 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:29:14,500 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:29:14,500 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:29:14,501 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:29:14,501 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:29:14,501 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:29:14,501 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:29:14,501 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:29:14,502 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:29:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:29:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:29:14,551 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:14,553 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:29:14,553 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:29:14,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:14,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [651886130] [2020-09-04 16:29:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:14,655 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:14,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:14,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:14,864 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:29:14,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [651886130] [2020-09-04 16:29:14,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:14,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:29:14,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425473584] [2020-09-04 16:29:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:29:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:29:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:29:14,898 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:29:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:14,997 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:29:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:29:15,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:29:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:15,011 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:29:15,012 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:29:15,016 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:29:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:29:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:29:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:29:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:29:15,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:29:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:15,067 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:29:15,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:29:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:29:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:29:15,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:15,070 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:29:15,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:29:15,071 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:29:15,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:15,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048341975] [2020-09-04 16:29:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:15,075 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,210 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:29:15,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048341975] [2020-09-04 16:29:15,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:15,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:29:15,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880719552] [2020-09-04 16:29:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:29:15,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:29:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:15,214 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:29:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:15,309 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:29:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:29:15,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:29:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:15,312 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:29:15,313 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:29:15,315 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:29:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:29:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:29:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:29:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:29:15,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:29:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:15,327 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:29:15,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:29:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:29:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:29:15,329 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:15,329 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:29:15,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:29:15,330 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:29:15,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:15,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1231790454] [2020-09-04 16:29:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:15,334 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,504 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:29:15,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1231790454] [2020-09-04 16:29:15,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:15,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:29:15,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190644829] [2020-09-04 16:29:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:29:15,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:15,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:29:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:29:15,512 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:29:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:15,641 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:29:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:29:15,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:29:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:15,645 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:29:15,646 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:29:15,648 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:29:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:29:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:29:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:29:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:29:15,673 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:29:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:15,677 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:29:15,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:29:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:29:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:29:15,682 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:15,682 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:29:15,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:29:15,683 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:29:15,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:15,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615060090] [2020-09-04 16:29:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:15,689 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:15,975 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:29:15,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615060090] [2020-09-04 16:29:15,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:15,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:29:15,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245180559] [2020-09-04 16:29:15,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:29:15,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:29:15,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:15,978 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:29:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:16,078 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:29:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:29:16,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:29:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:16,080 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:29:16,081 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:29:16,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:29:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:29:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:29:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:29:16,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:29:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:16,093 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:29:16,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:29:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:29:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:29:16,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:16,095 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:29:16,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:29:16,096 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:29:16,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:16,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087316277] [2020-09-04 16:29:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:16,098 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,290 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:29:16,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087316277] [2020-09-04 16:29:16,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:29:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281209984] [2020-09-04 16:29:16,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:29:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:29:16,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:29:16,293 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:29:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:16,380 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:29:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:29:16,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:29:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:16,383 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:29:16,384 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:29:16,384 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:29:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:29:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:29:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:29:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:29:16,396 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:29:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:16,396 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:29:16,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:29:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:29:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:29:16,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:16,399 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:29:16,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:29:16,399 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:29:16,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:16,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894790490] [2020-09-04 16:29:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:16,402 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,612 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:29:16,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894790490] [2020-09-04 16:29:16,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:16,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:29:16,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655293554] [2020-09-04 16:29:16,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:29:16,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:29:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:16,615 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 16:29:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:16,732 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:29:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:29:16,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 16:29:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:16,735 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:29:16,735 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:29:16,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:29:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:29:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:29:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:29:16,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:29:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:16,749 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:29:16,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:29:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:29:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:29:16,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:16,751 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:29:16,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:29:16,752 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:29:16,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:16,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [547936821] [2020-09-04 16:29:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:16,755 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:16,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,037 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:29:17,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [547936821] [2020-09-04 16:29:17,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:17,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:29:17,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801450714] [2020-09-04 16:29:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:29:17,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:29:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:29:17,041 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:29:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:17,183 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:29:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:29:17,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:29:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:17,185 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:29:17,186 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 16:29:17,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 16:29:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 16:29:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:29:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 16:29:17,196 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 16:29:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:17,197 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 16:29:17,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:29:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 16:29:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:29:17,199 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:17,199 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:17,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:29:17,199 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 16:29:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:17,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148434756] [2020-09-04 16:29:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:17,202 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:29:17,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148434756] [2020-09-04 16:29:17,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:17,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:29:17,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604961834] [2020-09-04 16:29:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:29:17,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:29:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:17,473 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 16:29:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:17,598 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 16:29:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:29:17,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 16:29:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:17,600 INFO L225 Difference]: With dead ends: 64 [2020-09-04 16:29:17,600 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:29:17,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:29:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:29:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:29:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:29:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:29:17,611 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 16:29:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:17,612 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:29:17,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:29:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:29:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 16:29:17,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:17,614 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:17,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:29:17,614 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 16:29:17,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:17,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376481710] [2020-09-04 16:29:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:17,617 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:29:17,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376481710] [2020-09-04 16:29:17,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:17,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:29:17,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783291414] [2020-09-04 16:29:17,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:29:17,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:29:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:29:17,976 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 16:29:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:18,133 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 16:29:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:29:18,134 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 16:29:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:18,135 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:29:18,135 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 16:29:18,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:29:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 16:29:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 16:29:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 16:29:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 16:29:18,162 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 16:29:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:18,163 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 16:29:18,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:29:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 16:29:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:29:18,167 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:18,167 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:18,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:29:18,167 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 16:29:18,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:18,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1906140860] [2020-09-04 16:29:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:18,173 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:29:18,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1906140860] [2020-09-04 16:29:18,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:18,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:29:18,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478140700] [2020-09-04 16:29:18,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:29:18,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:29:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:18,656 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 16:29:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:18,807 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 16:29:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:29:18,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 16:29:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:18,809 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:29:18,809 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:29:18,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:29:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:29:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 16:29:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:29:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:29:18,820 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 16:29:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:18,821 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:29:18,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:29:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:29:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 16:29:18,822 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:18,822 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:18,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:29:18,823 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:18,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 16:29:18,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:18,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930476544] [2020-09-04 16:29:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:18,826 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:18,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:29:19,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930476544] [2020-09-04 16:29:19,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:19,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:29:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326247486] [2020-09-04 16:29:19,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:29:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:29:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:29:19,654 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2020-09-04 16:29:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:20,529 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:29:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 16:29:20,530 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2020-09-04 16:29:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:20,531 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:29:20,532 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:29:20,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:29:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:29:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 16:29:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 16:29:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 16:29:20,544 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 16:29:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:20,544 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 16:29:20,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:29:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 16:29:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 16:29:20,546 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:20,546 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:20,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:29:20,546 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:20,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 16:29:20,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:20,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795164074] [2020-09-04 16:29:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:20,549 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:29:21,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795164074] [2020-09-04 16:29:21,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:21,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:29:21,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45384168] [2020-09-04 16:29:21,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:29:21,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:29:21,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:21,057 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 16:29:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:21,640 INFO L93 Difference]: Finished difference Result 151 states and 272 transitions. [2020-09-04 16:29:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:29:21,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 16:29:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:21,641 INFO L225 Difference]: With dead ends: 151 [2020-09-04 16:29:21,641 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:29:21,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:29:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:29:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:29:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:29:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:29:21,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2020-09-04 16:29:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:21,646 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:29:21,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:29:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:29:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:29:21,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:29:21,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:29:23,414 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2020-09-04 16:29:23,934 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2020-09-04 16:29:24,608 WARN L193 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2020-09-04 16:29:25,145 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2020-09-04 16:29:25,561 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2020-09-04 16:29:25,569 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,569 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,569 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,570 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:25,570 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 16:29:25,570 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 16:29:25,571 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 10 main_~input~0) [2020-09-04 16:29:25,571 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 16:29:25,571 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= main_~result~0 10) (<= 10 main_~input~0) (<= 10 main_~result~0)) [2020-09-04 16:29:25,571 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-09-04 16:29:25,573 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 10 |main_#t~ret1|) (<= 10 main_~input~0) (<= |main_#t~ret1| 10)) [2020-09-04 16:29:25,573 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 10 main_~input~0) [2020-09-04 16:29:25,573 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 10 |main_#t~ret1|) (<= 10 main_~input~0) (<= |main_#t~ret1| 10)) [2020-09-04 16:29:25,573 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 10 |main_#t~ret1|) (<= main_~result~0 10) (<= 10 main_~input~0) (<= 10 main_~result~0) (<= |main_#t~ret1| 10)) [2020-09-04 16:29:25,574 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse14 (<= 9 |id_#in~x|)) (.cse13 (<= 8 |id_#in~x|)) (.cse11 (<= 7 |id_#in~x|)) (.cse0 (<= 2 |id_#in~x|)) (.cse12 (= |id_#in~x| id_~x))) (let ((.cse1 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse12 (<= |id_#in~x| 4) (<= 4 |id_#in~x|))) (.cse2 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse12 (<= |id_#res| 5))) (.cse4 (and (<= 2 |id_#res|) .cse12 (<= |id_#res| 2) .cse0 (<= |id_#in~x| 2))) (.cse5 (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse12 (<= |id_#in~x| 3) (<= 3 |id_#res|))) (.cse8 (and (<= 7 |id_#res|) .cse12 (<= |id_#res| 7) .cse11)) (.cse9 (and (<= |id_#res| 6) .cse12 (<= 6 |id_#in~x|) (<= 6 |id_#res|))) (.cse7 (and (<= |id_#res| 8) .cse12 .cse13 (<= 8 |id_#res|))) (.cse3 (and .cse12 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10))) (.cse6 (and (<= 9 |id_#res|) .cse12 (<= |id_#in~x| 9) (<= |id_#res| 9) .cse14)) (.cse10 (and (<= 11 |id_#in~x|) .cse12))) (and (or (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse6 .cse7 .cse8 (not .cse11) .cse10) (or (and (<= 1 |id_#in~x|) .cse12 (<= |id_#res| 1) (<= 1 |id_#res|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse12 (= |id_#res| 0) (= |id_#in~x| 0)) .cse7 .cse8 .cse9 .cse10) (or (not .cse13) .cse3 .cse6 .cse7 .cse10) (or .cse3 .cse6 (not .cse14) .cse10)))) [2020-09-04 16:29:25,574 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse14 (<= 9 |id_#in~x|)) (.cse13 (<= 8 |id_#in~x|)) (.cse11 (<= 7 |id_#in~x|)) (.cse0 (<= 2 |id_#in~x|)) (.cse12 (= |id_#in~x| id_~x))) (let ((.cse1 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse12 (<= |id_#in~x| 4) (<= 4 |id_#in~x|))) (.cse2 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse12 (<= |id_#res| 5))) (.cse4 (and (<= 2 |id_#res|) .cse12 (<= |id_#res| 2) .cse0 (<= |id_#in~x| 2))) (.cse5 (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse12 (<= |id_#in~x| 3) (<= 3 |id_#res|))) (.cse8 (and (<= 7 |id_#res|) .cse12 (<= |id_#res| 7) .cse11)) (.cse9 (and (<= |id_#res| 6) .cse12 (<= 6 |id_#in~x|) (<= 6 |id_#res|))) (.cse7 (and (<= |id_#res| 8) .cse12 .cse13 (<= 8 |id_#res|))) (.cse3 (and .cse12 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10))) (.cse6 (and (<= 9 |id_#res|) .cse12 (<= |id_#in~x| 9) (<= |id_#res| 9) .cse14)) (.cse10 (and (<= 11 |id_#in~x|) .cse12))) (and (or (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse6 .cse7 .cse8 (not .cse11) .cse10) (or (and (<= 1 |id_#in~x|) .cse12 (<= |id_#res| 1) (<= 1 |id_#res|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse12 (= |id_#res| 0) (= |id_#in~x| 0)) .cse7 .cse8 .cse9 .cse10) (or (not .cse13) .cse3 .cse6 .cse7 .cse10) (or .cse3 .cse6 (not .cse14) .cse10)))) [2020-09-04 16:29:25,575 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 16:29:25,575 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:25,575 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:25,575 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse12 (<= 5 |id_#in~x|)) (.cse11 (<= 2 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse5 (and .cse0 (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|))) (.cse8 (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|))) (.cse9 (and .cse0 (<= 1 |id_#t~ret0|) .cse11 (<= |id_#t~ret0| 1) (<= |id_#in~x| 2))) (.cse1 (and .cse12 (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))) (.cse2 (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse3 (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse4 (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8))) (.cse6 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= 10 |id_#in~x|))) (.cse7 (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse10 (and (<= 11 |id_#in~x|) .cse0))) (and (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not .cse12) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10)))) [2020-09-04 16:29:25,576 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:29:25,576 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse8 (<= 5 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse1 (and .cse8 (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))) (.cse2 (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse3 (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse4 (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8))) (.cse5 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= 10 |id_#in~x|))) (.cse6 (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse7 (and (<= 11 |id_#in~x|) .cse0))) (and (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) .cse1 .cse2 .cse3 .cse4 (and .cse0 (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) .cse5 (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) .cse6 (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) .cse7) (or (not .cse8) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 16:29:25,576 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse13 (<= 6 |id_#in~x|)) (.cse12 (<= 3 |id_#in~x|)) (.cse11 (= |id_#in~x| id_~x)) (.cse0 (<= 2 |id_#in~x|))) (let ((.cse7 (and (<= 2 |id_#res|) .cse11 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) .cse0 (<= |id_#t~ret0| 1))) (.cse3 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse11 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))) (.cse6 (and (<= |id_#res| 3) .cse12 (<= |id_#t~ret0| 2) .cse11 (<= |id_#in~x| 3) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|))) (.cse8 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse11 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|))) (.cse1 (and (<= |id_#t~ret0| 5) (<= |id_#res| 6) .cse11 .cse13 (<= 6 |id_#res|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse2 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse11 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10))) (.cse4 (and (<= 7 |id_#res|) .cse11 (<= |id_#res| 7) (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse5 (and (<= 7 |id_#t~ret0|) (<= |id_#res| 8) (<= |id_#t~ret0| 7) .cse11 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8))) (.cse9 (and (<= 9 |id_#res|) .cse11 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse10 (and (<= 11 |id_#in~x|) .cse11))) (and (or (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 (and (<= 1 |id_#in~x|) .cse11 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse4 .cse5 .cse9 (not .cse13) .cse10)))) [2020-09-04 16:29:25,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:29:25 BoogieIcfgContainer [2020-09-04 16:29:25,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:29:25,634 INFO L168 Benchmark]: Toolchain (without parser) took 11938.97 ms. Allocated memory was 138.9 MB in the beginning and 345.0 MB in the end (delta: 206.0 MB). Free memory was 103.5 MB in the beginning and 209.2 MB in the end (delta: -105.7 MB). Peak memory consumption was 214.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,639 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.58 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,640 INFO L168 Benchmark]: Boogie Preprocessor took 37.14 ms. Allocated memory is still 138.9 MB. Free memory was 94.0 MB in the beginning and 92.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,641 INFO L168 Benchmark]: RCFGBuilder took 359.40 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 170.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,642 INFO L168 Benchmark]: TraceAbstraction took 11240.86 ms. Allocated memory was 201.9 MB in the beginning and 345.0 MB in the end (delta: 143.1 MB). Free memory was 169.4 MB in the beginning and 209.2 MB in the end (delta: -39.7 MB). Peak memory consumption was 217.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:25,645 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.93 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.58 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.14 ms. Allocated memory is still 138.9 MB. Free memory was 94.0 MB in the beginning and 92.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.40 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 170.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11240.86 ms. Allocated memory was 201.9 MB in the beginning and 345.0 MB in the end (delta: 143.1 MB). Free memory was 169.4 MB in the beginning and 209.2 MB in the end (delta: -39.7 MB). Peak memory consumption was 217.6 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: 10 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: (((((((((((((!(2 <= \old(x)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || (((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result)) || (((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x))) || (((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result)) || (11 <= \old(x) && \old(x) == x)) && ((((((((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result)) || (((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x))) || !(7 <= \old(x))) || (11 <= \old(x) && \old(x) == x))) && ((((((((((((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || (((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || (((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result)) || (((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x))) || (((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result)) || (11 <= \old(x) && \old(x) == x))) && ((((!(8 <= \old(x)) || (((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result)) || (11 <= \old(x) && \old(x) == x))) && ((((((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || !(9 <= \old(x))) || (11 <= \old(x) && \old(x) == x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 284 SDtfs, 382 SDslu, 1707 SDs, 0 SdLazy, 1433 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 124 PreInvPairs, 658 NumberOfFragments, 2415 HoareAnnotationTreeSize, 124 FomulaSimplifications, 721 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 4343 FormulaSimplificationTreeSizeReductionInter, 2.7s 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...