/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:13:36,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:13:36,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:13:36,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:13:36,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:13:36,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:13:36,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:13:36,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:13:36,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:13:36,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:13:36,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:13:36,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:13:36,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:13:36,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:13:36,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:13:36,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:13:36,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:13:36,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:13:36,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:13:36,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:13:36,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:13:36,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:13:36,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:13:36,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:13:36,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:13:36,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:13:36,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:13:36,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:13:36,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:13:36,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:13:36,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:13:36,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:13:36,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:13:36,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:13:36,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:13:36,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:13:36,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:13:36,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:13:36,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:13:36,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:13:36,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:13:36,681 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 23:13:36,706 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:13:36,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:13:36,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:13:36,709 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:13:36,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:13:36,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:13:36,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:13:36,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:13:36,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:13:36,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:13:36,713 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:13:36,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:13:36,713 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:13:36,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:13:36,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:13:36,714 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:13:36,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:13:36,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:13:36,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:13:36,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:13:36,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:13:36,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:13:36,716 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:13:37,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:13:37,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:13:37,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:13:37,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:13:37,221 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:13:37,223 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-09-04 23:13:37,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d29fd852/15ff588f43b545bdaf51f5f55952880d/FLAGe8ba5b4e2 [2020-09-04 23:13:37,851 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:13:37,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-09-04 23:13:37,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d29fd852/15ff588f43b545bdaf51f5f55952880d/FLAGe8ba5b4e2 [2020-09-04 23:13:38,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d29fd852/15ff588f43b545bdaf51f5f55952880d [2020-09-04 23:13:38,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:13:38,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:13:38,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:13:38,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:13:38,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:13:38,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d064956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38, skipping insertion in model container [2020-09-04 23:13:38,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:13:38,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:13:38,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:13:38,563 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:13:38,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:13:38,641 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:13:38,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38 WrapperNode [2020-09-04 23:13:38,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:13:38,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:13:38,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:13:38,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:13:38,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (1/1) ... [2020-09-04 23:13:38,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:13:38,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:13:38,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:13:38,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:13:38,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (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 23:13:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:13:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:13:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:13:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:13:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:13:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:13:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:13:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:13:39,273 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:13:39,273 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 23:13:39,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:13:39 BoogieIcfgContainer [2020-09-04 23:13:39,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:13:39,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:13:39,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:13:39,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:13:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:13:38" (1/3) ... [2020-09-04 23:13:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55630e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:13:39, skipping insertion in model container [2020-09-04 23:13:39,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:13:38" (2/3) ... [2020-09-04 23:13:39,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55630e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:13:39, skipping insertion in model container [2020-09-04 23:13:39,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:13:39" (3/3) ... [2020-09-04 23:13:39,292 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-09-04 23:13:39,306 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:13:39,318 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:13:39,339 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:13:39,370 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:13:39,371 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:13:39,371 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:13:39,371 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:13:39,371 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:13:39,371 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:13:39,372 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:13:39,372 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:13:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-09-04 23:13:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 23:13:39,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:39,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:39,415 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash 60896664, now seen corresponding path program 1 times [2020-09-04 23:13:39,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:39,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159376730] [2020-09-04 23:13:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:39,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:39,767 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 23:13:39,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159376730] [2020-09-04 23:13:39,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:39,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:13:39,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58560325] [2020-09-04 23:13:39,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:13:39,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:13:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:13:39,800 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2020-09-04 23:13:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:40,247 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2020-09-04 23:13:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:13:40,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-09-04 23:13:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:40,267 INFO L225 Difference]: With dead ends: 178 [2020-09-04 23:13:40,267 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 23:13:40,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:13:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 23:13:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2020-09-04 23:13:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 23:13:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-09-04 23:13:40,368 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2020-09-04 23:13:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:40,369 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-09-04 23:13:40,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:13:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-09-04 23:13:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 23:13:40,371 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:40,372 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:40,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:13:40,372 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1464371663, now seen corresponding path program 1 times [2020-09-04 23:13:40,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:40,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1046102945] [2020-09-04 23:13:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:13:40,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1046102945] [2020-09-04 23:13:40,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:40,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:40,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050350041] [2020-09-04 23:13:40,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:40,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:40,504 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 7 states. [2020-09-04 23:13:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:40,801 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-09-04 23:13:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:13:40,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-09-04 23:13:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:40,806 INFO L225 Difference]: With dead ends: 99 [2020-09-04 23:13:40,806 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 23:13:40,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:13:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 23:13:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-09-04 23:13:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-09-04 23:13:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-09-04 23:13:40,832 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 35 [2020-09-04 23:13:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:40,832 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-09-04 23:13:40,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-09-04 23:13:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 23:13:40,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:40,836 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:40,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:13:40,837 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1188311592, now seen corresponding path program 1 times [2020-09-04 23:13:40,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:40,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727674763] [2020-09-04 23:13:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-04 23:13:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 23:13:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 23:13:40,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727674763] [2020-09-04 23:13:40,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:40,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:13:40,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560130667] [2020-09-04 23:13:40,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:13:40,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:40,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:13:40,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:13:40,969 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2020-09-04 23:13:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:41,023 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2020-09-04 23:13:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:13:41,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 23:13:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:41,027 INFO L225 Difference]: With dead ends: 140 [2020-09-04 23:13:41,027 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 23:13:41,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:13:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 23:13:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-09-04 23:13:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-09-04 23:13:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2020-09-04 23:13:41,053 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 65 [2020-09-04 23:13:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:41,054 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2020-09-04 23:13:41,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:13:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-09-04 23:13:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 23:13:41,056 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:41,057 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:41,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:13:41,057 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2082475577, now seen corresponding path program 1 times [2020-09-04 23:13:41,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:41,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088542768] [2020-09-04 23:13:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:13:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:13:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 23:13:41,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088542768] [2020-09-04 23:13:41,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:41,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:41,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634727266] [2020-09-04 23:13:41,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:41,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:41,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:41,290 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 7 states. [2020-09-04 23:13:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:41,558 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2020-09-04 23:13:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:13:41,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-09-04 23:13:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:41,561 INFO L225 Difference]: With dead ends: 103 [2020-09-04 23:13:41,567 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 23:13:41,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:13:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 23:13:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-09-04 23:13:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-04 23:13:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2020-09-04 23:13:41,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 68 [2020-09-04 23:13:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:41,605 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2020-09-04 23:13:41,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-09-04 23:13:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-04 23:13:41,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:41,617 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:41,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:13:41,617 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1342891699, now seen corresponding path program 1 times [2020-09-04 23:13:41,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:41,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849954655] [2020-09-04 23:13:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:13:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:13:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 23:13:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:13:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:13:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 23:13:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 23:13:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:13:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-09-04 23:13:41,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849954655] [2020-09-04 23:13:41,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:41,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:13:41,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799968185] [2020-09-04 23:13:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:13:41,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:13:41,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:41,950 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 7 states. [2020-09-04 23:13:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:42,143 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2020-09-04 23:13:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:13:42,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-09-04 23:13:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:42,152 INFO L225 Difference]: With dead ends: 129 [2020-09-04 23:13:42,152 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 23:13:42,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:13:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 23:13:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-09-04 23:13:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 23:13:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-09-04 23:13:42,192 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 114 [2020-09-04 23:13:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:42,193 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-09-04 23:13:42,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:13:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-09-04 23:13:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-04 23:13:42,196 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:42,196 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:42,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:13:42,197 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:42,198 INFO L82 PathProgramCache]: Analyzing trace with hash -279016842, now seen corresponding path program 1 times [2020-09-04 23:13:42,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:42,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678240917] [2020-09-04 23:13:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:13:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:13:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 23:13:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:13:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:13:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 23:13:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 23:13:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:13:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:13:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-09-04 23:13:42,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678240917] [2020-09-04 23:13:42,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:42,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:13:42,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911769931] [2020-09-04 23:13:42,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:13:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:13:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:13:42,394 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 6 states. [2020-09-04 23:13:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:42,508 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2020-09-04 23:13:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:13:42,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-09-04 23:13:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:42,511 INFO L225 Difference]: With dead ends: 125 [2020-09-04 23:13:42,511 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 23:13:42,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 23:13:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 23:13:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 23:13:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2020-09-04 23:13:42,530 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 119 [2020-09-04 23:13:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:42,531 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-09-04 23:13:42,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:13:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-09-04 23:13:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-04 23:13:42,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:13:42,534 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:13:42,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:13:42,535 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:13:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:13:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash 486899888, now seen corresponding path program 1 times [2020-09-04 23:13:42,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:13:42,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323314662] [2020-09-04 23:13:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:13:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:13:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:13:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 23:13:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 23:13:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:13:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:13:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:13:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 23:13:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 23:13:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:13:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 23:13:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 23:13:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:13:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:13:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:13:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-09-04 23:13:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:13:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 23:13:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-09-04 23:13:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:13:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2020-09-04 23:13:42,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323314662] [2020-09-04 23:13:42,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:13:42,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:13:42,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008024334] [2020-09-04 23:13:42,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:13:42,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:13:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:13:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:13:42,756 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 6 states. [2020-09-04 23:13:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:13:42,865 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2020-09-04 23:13:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:13:42,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-09-04 23:13:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:13:42,868 INFO L225 Difference]: With dead ends: 128 [2020-09-04 23:13:42,869 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:13:42,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:13:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:13:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:13:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:13:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:13:42,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-09-04 23:13:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:13:42,875 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:13:42,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:13:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:13:42,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:13:42,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:13:42,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:13:44,653 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,654 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,654 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,654 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,654 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,654 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:13:44,655 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:44,655 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:44,655 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:13:44,655 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:13:44,655 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:13:44,656 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,656 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,656 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 72) the Hoare annotation is: true [2020-09-04 23:13:44,656 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,656 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 23:13:44,657 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,657 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-09-04 23:13:44,657 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-09-04 23:13:44,657 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,657 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,658 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,658 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-09-04 23:13:44,658 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-09-04 23:13:44,658 INFO L271 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-09-04 23:13:44,658 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,658 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,659 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-09-04 23:13:44,659 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,659 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,659 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,659 INFO L264 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,659 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,660 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 23:13:44,660 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 0 main_~c~0) .cse2 (< main_~c~0 main_~tokenlen~0) .cse3))) [2020-09-04 23:13:44,660 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 23:13:44,660 INFO L264 CegarLoopResult]: At program point L46(lines 33 69) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,660 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 72) the Hoare annotation is: true [2020-09-04 23:13:44,661 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,661 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,661 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-09-04 23:13:44,661 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-09-04 23:13:44,661 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 23:13:44,661 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-09-04 23:13:44,661 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,662 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,662 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,662 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,662 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-09-04 23:13:44,662 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,662 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-09-04 23:13:44,663 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,663 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,663 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,663 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,663 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,664 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,664 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,664 INFO L264 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,664 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,664 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 23:13:44,664 INFO L271 CegarLoopResult]: At program point L24-1(lines 14 72) the Hoare annotation is: true [2020-09-04 23:13:44,665 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,665 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 23:13:44,665 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-09-04 23:13:44,665 INFO L264 CegarLoopResult]: At program point L33(lines 33 69) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,665 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,665 INFO L264 CegarLoopResult]: At program point L33-3(line 33) the Hoare annotation is: (and (<= (+ main_~cp~0 1) main_~urilen~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-09-04 23:13:44,666 INFO L264 CegarLoopResult]: At program point L58(lines 58 64) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,666 INFO L271 CegarLoopResult]: At program point L25(lines 14 72) the Hoare annotation is: true [2020-09-04 23:13:44,666 INFO L264 CegarLoopResult]: At program point L58-1(line 58) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,666 INFO L264 CegarLoopResult]: At program point L58-2(line 58) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,666 INFO L264 CegarLoopResult]: At program point L58-3(lines 58 64) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= 0 main_~c~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,667 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,667 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 23:13:44,667 INFO L264 CegarLoopResult]: At program point L50-1(lines 50 68) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,667 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 23:13:44,667 INFO L264 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,667 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L26(lines 14 72) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-09-04 23:13:44,668 INFO L264 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,669 INFO L264 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (< main_~c~0 main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,669 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,669 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 23:13:44,669 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 23:13:44,669 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 23:13:44,669 INFO L264 CegarLoopResult]: At program point L43(lines 33 69) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 23:13:44,670 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:13:44,670 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:44,670 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:13:44,670 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:44,670 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:13:44,670 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:13:44,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:13:44 BoogieIcfgContainer [2020-09-04 23:13:44,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:13:44,705 INFO L168 Benchmark]: Toolchain (without parser) took 6498.17 ms. Allocated memory was 136.8 MB in the beginning and 291.5 MB in the end (delta: 154.7 MB). Free memory was 101.2 MB in the beginning and 174.9 MB in the end (delta: -73.7 MB). Peak memory consumption was 128.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:44,706 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:13:44,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.76 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 90.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:44,708 INFO L168 Benchmark]: Boogie Preprocessor took 133.89 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 178.3 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:44,709 INFO L168 Benchmark]: RCFGBuilder took 503.42 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 156.0 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:44,710 INFO L168 Benchmark]: TraceAbstraction took 5419.28 ms. Allocated memory was 200.3 MB in the beginning and 291.5 MB in the end (delta: 91.2 MB). Free memory was 155.3 MB in the beginning and 174.9 MB in the end (delta: -19.6 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:13:44,714 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.76 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 90.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.89 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 178.3 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.42 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 156.0 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5419.28 ms. Allocated memory was 200.3 MB in the beginning and 291.5 MB in the end (delta: 91.2 MB). Free memory was 155.3 MB in the beginning and 174.9 MB in the end (delta: -19.6 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((0 < scheme && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((0 < scheme && c == 0) && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen) || (((((0 < scheme && 1 <= cp) && 0 <= c) && scheme + 1 <= urilen) && c < tokenlen) && cp < urilen) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 680 SDtfs, 310 SDslu, 2021 SDs, 0 SdLazy, 509 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 398 PreInvPairs, 534 NumberOfFragments, 1150 HoareAnnotationTreeSize, 398 FomulaSimplifications, 717 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 92 FomulaSimplificationsInter, 579 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 86091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1430/1430 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...