/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/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:48:01,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:48:01,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:48:01,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:48:01,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:48:01,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:48:01,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:48:01,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:48:01,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:48:01,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:48:01,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:48:01,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:48:01,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:48:01,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:48:01,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:48:01,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:48:01,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:48:01,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:48:01,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:48:01,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:48:01,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:48:01,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:48:01,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:48:01,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:48:01,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:48:01,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:48:01,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:48:01,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:48:01,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:48:01,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:48:01,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:48:01,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:48:01,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:48:01,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:48:01,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:48:01,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:48:01,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:48:01,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:48:01,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:48:01,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:48:01,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:48:01,779 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 17:48:01,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:48:01,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:48:01,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:48:01,794 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:48:01,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:48:01,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:48:01,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:48:01,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:48:01,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:48:01,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:48:01,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:48:01,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:48:01,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:48:01,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:48:01,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:48:01,796 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:48:01,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:48:01,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:48:01,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:48:01,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:48:01,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:48:01,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:48:01,798 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:48:02,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:48:02,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:48:02,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:48:02,268 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:48:02,269 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:48:02,270 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 17:48:02,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/912da39bf/bd2d0ae355074722814a3c678303da9b/FLAGc7d27f9fa [2020-09-04 17:48:02,932 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:48:02,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-09-04 17:48:02,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/912da39bf/bd2d0ae355074722814a3c678303da9b/FLAGc7d27f9fa [2020-09-04 17:48:03,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/912da39bf/bd2d0ae355074722814a3c678303da9b [2020-09-04 17:48:03,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:48:03,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:48:03,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:48:03,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:48:03,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:48:03,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601fc90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03, skipping insertion in model container [2020-09-04 17:48:03,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:48:03,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:48:03,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:48:03,565 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:48:03,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:48:03,625 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:48:03,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03 WrapperNode [2020-09-04 17:48:03,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:48:03,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:48:03,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:48:03,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:48:03,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (1/1) ... [2020-09-04 17:48:03,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:48:03,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:48:03,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:48:03,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:48:03,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (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 17:48:03,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:48:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:48:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:48:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:48:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:48:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:48:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:48:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:48:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:48:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:48:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:48:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:48:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:48:04,220 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:48:04,221 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 17:48:04,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:48:04 BoogieIcfgContainer [2020-09-04 17:48:04,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:48:04,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:48:04,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:48:04,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:48:04,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:48:03" (1/3) ... [2020-09-04 17:48:04,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c98b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:48:04, skipping insertion in model container [2020-09-04 17:48:04,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:03" (2/3) ... [2020-09-04 17:48:04,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c98b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:48:04, skipping insertion in model container [2020-09-04 17:48:04,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:48:04" (3/3) ... [2020-09-04 17:48:04,260 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-09-04 17:48:04,273 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:48:04,283 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:48:04,306 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:48:04,337 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:48:04,337 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:48:04,338 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:48:04,338 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:48:04,338 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:48:04,338 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:48:04,338 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:48:04,338 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:48:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-09-04 17:48:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 17:48:04,375 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:04,376 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 17:48:04,377 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 60896664, now seen corresponding path program 1 times [2020-09-04 17:48:04,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:04,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228081212] [2020-09-04 17:48:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:04,465 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:04,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:04,675 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 17:48:04,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228081212] [2020-09-04 17:48:04,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:48:04,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092414553] [2020-09-04 17:48:04,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:48:04,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:48:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:48:04,711 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2020-09-04 17:48:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:05,113 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2020-09-04 17:48:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:48:05,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-09-04 17:48:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:05,132 INFO L225 Difference]: With dead ends: 178 [2020-09-04 17:48:05,132 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 17:48:05,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:48:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 17:48:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2020-09-04 17:48:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 17:48:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-09-04 17:48:05,230 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2020-09-04 17:48:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:05,231 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-09-04 17:48:05,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:48:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-09-04 17:48:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 17:48:05,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:05,235 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 17:48:05,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:48:05,236 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1464371663, now seen corresponding path program 1 times [2020-09-04 17:48:05,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:05,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219572988] [2020-09-04 17:48:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:05,240 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,361 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 17:48:05,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219572988] [2020-09-04 17:48:05,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:05,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642985956] [2020-09-04 17:48:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:05,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:05,366 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 7 states. [2020-09-04 17:48:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:05,643 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-09-04 17:48:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 17:48:05,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-09-04 17:48:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:05,648 INFO L225 Difference]: With dead ends: 99 [2020-09-04 17:48:05,648 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 17:48:05,651 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 17:48:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 17:48:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-09-04 17:48:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-09-04 17:48:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-09-04 17:48:05,685 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 35 [2020-09-04 17:48:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:05,686 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-09-04 17:48:05,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-09-04 17:48:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 17:48:05,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:05,689 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 17:48:05,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:48:05,689 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1188311592, now seen corresponding path program 1 times [2020-09-04 17:48:05,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:05,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214858791] [2020-09-04 17:48:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:05,693 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 17:48:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:48:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:48:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-04 17:48:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 17:48:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 17:48:05,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214858791] [2020-09-04 17:48:05,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:05,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 17:48:05,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268249955] [2020-09-04 17:48:05,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 17:48:05,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 17:48:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:48:05,868 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2020-09-04 17:48:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:05,924 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2020-09-04 17:48:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 17:48:05,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 17:48:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:05,927 INFO L225 Difference]: With dead ends: 140 [2020-09-04 17:48:05,928 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 17:48:05,929 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 17:48:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 17:48:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-09-04 17:48:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-09-04 17:48:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2020-09-04 17:48:05,948 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 65 [2020-09-04 17:48:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:05,949 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2020-09-04 17:48:05,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 17:48:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-09-04 17:48:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 17:48:05,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:05,952 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 17:48:05,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:48:05,953 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2082475577, now seen corresponding path program 1 times [2020-09-04 17:48:05,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:05,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727910886] [2020-09-04 17:48:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:05,956 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 17:48:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:48:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:48:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:48:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 17:48:06,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727910886] [2020-09-04 17:48:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:06,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441514390] [2020-09-04 17:48:06,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:06,157 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 7 states. [2020-09-04 17:48:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:06,416 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2020-09-04 17:48:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 17:48:06,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-09-04 17:48:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:06,419 INFO L225 Difference]: With dead ends: 103 [2020-09-04 17:48:06,419 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 17:48:06,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 17:48:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-09-04 17:48:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-04 17:48:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2020-09-04 17:48:06,441 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 68 [2020-09-04 17:48:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:06,442 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2020-09-04 17:48:06,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-09-04 17:48:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-04 17:48:06,445 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:06,445 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 17:48:06,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:48:06,446 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1342891699, now seen corresponding path program 1 times [2020-09-04 17:48:06,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:06,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371096541] [2020-09-04 17:48:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:06,449 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 17:48:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:48:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:48:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:48:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 17:48:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:48:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 17:48:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 17:48:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 17:48:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:48:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 17:48:06,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371096541] [2020-09-04 17:48:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:06,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:06,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067426618] [2020-09-04 17:48:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:06,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:06,694 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 7 states. [2020-09-04 17:48:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:06,826 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2020-09-04 17:48:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 17:48:06,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-09-04 17:48:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:06,829 INFO L225 Difference]: With dead ends: 129 [2020-09-04 17:48:06,830 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 17:48:06,830 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 17:48:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 17:48:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-09-04 17:48:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 17:48:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-09-04 17:48:06,851 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 114 [2020-09-04 17:48:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:06,852 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-09-04 17:48:06,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-09-04 17:48:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-04 17:48:06,855 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:06,855 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 17:48:06,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:48:06,855 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -279016842, now seen corresponding path program 1 times [2020-09-04 17:48:06,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:06,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133996761] [2020-09-04 17:48:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:06,858 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 17:48:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:48:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:48:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:48:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:06,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 17:48:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:48:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 17:48:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 17:48:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 17:48:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:48:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 17:48:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 17:48:07,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133996761] [2020-09-04 17:48:07,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:07,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:48:07,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380908707] [2020-09-04 17:48:07,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:48:07,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:07,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:48:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:48:07,041 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 6 states. [2020-09-04 17:48:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:07,158 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2020-09-04 17:48:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:48:07,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-09-04 17:48:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:07,161 INFO L225 Difference]: With dead ends: 125 [2020-09-04 17:48:07,161 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 17:48:07,162 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 17:48:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 17:48:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 17:48:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 17:48:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2020-09-04 17:48:07,180 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 119 [2020-09-04 17:48:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:07,181 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-09-04 17:48:07,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:48:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-09-04 17:48:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-04 17:48:07,184 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:07,185 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 17:48:07,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:48:07,185 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 486899888, now seen corresponding path program 1 times [2020-09-04 17:48:07,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:07,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743169313] [2020-09-04 17:48:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:07,188 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 17:48:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 17:48:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:48:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:48:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:48:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 17:48:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:48:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 17:48:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 17:48:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 17:48:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:48:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 17:48:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 17:48:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-09-04 17:48:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 17:48:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 17:48:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-09-04 17:48:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-09-04 17:48:07,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743169313] [2020-09-04 17:48:07,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:07,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:48:07,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485536029] [2020-09-04 17:48:07,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:48:07,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:07,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:48:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:48:07,367 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 6 states. [2020-09-04 17:48:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:07,476 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2020-09-04 17:48:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:48:07,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-09-04 17:48:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:07,478 INFO L225 Difference]: With dead ends: 128 [2020-09-04 17:48:07,478 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:48:07,479 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 17:48:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:48:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:48:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:48:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:48:07,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-09-04 17:48:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:07,481 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:48:07,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:48:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:48:07,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:48:07,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:48:07,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:48:09,119 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,120 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,120 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,120 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,121 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,121 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:48:09,121 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:09,121 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:09,122 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:48:09,122 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:48:09,122 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:09,122 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 17:48:09,123 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 17:48:09,123 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 72) the Hoare annotation is: true [2020-09-04 17:48:09,123 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 17:48:09,123 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 17:48:09,123 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 17:48:09,123 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-09-04 17:48:09,124 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-09-04 17:48:09,124 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 17:48:09,124 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 17:48:09,124 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 17:48:09,125 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-09-04 17:48:09,125 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-09-04 17:48:09,125 INFO L271 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-09-04 17:48:09,125 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 17:48:09,125 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 17:48:09,126 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-09-04 17:48:09,126 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 17:48:09,126 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 17:48:09,126 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 17:48:09,127 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 17:48:09,127 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 17:48:09,127 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 17:48:09,127 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 17:48:09,127 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 17:48:09,128 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 17:48:09,128 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 72) the Hoare annotation is: true [2020-09-04 17:48:09,128 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 17:48:09,128 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 17:48:09,128 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 17:48:09,129 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-09-04 17:48:09,129 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 17:48:09,129 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-09-04 17:48:09,129 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 17:48:09,129 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 17:48:09,130 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 17:48:09,130 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 17:48:09,130 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-09-04 17:48:09,130 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 17:48:09,130 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-09-04 17:48:09,131 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 17:48:09,131 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 17:48:09,131 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 17:48:09,131 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 17:48:09,131 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 17:48:09,132 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 17:48:09,132 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 17:48:09,132 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 17:48:09,132 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 17:48:09,132 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 17:48:09,132 INFO L271 CegarLoopResult]: At program point L24-1(lines 14 72) the Hoare annotation is: true [2020-09-04 17:48:09,133 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 17:48:09,133 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 17:48:09,133 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-09-04 17:48:09,133 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 17:48:09,133 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 17:48:09,133 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 17:48:09,134 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 17:48:09,134 INFO L271 CegarLoopResult]: At program point L25(lines 14 72) the Hoare annotation is: true [2020-09-04 17:48:09,134 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 17:48:09,134 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 17:48:09,135 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 17:48:09,135 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 17:48:09,135 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 17:48:09,135 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 17:48:09,135 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 17:48:09,135 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 17:48:09,136 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-09-04 17:48:09,136 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 17:48:09,136 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 17:48:09,136 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 17:48:09,136 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 17:48:09,137 INFO L264 CegarLoopResult]: At program point L26(lines 14 72) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-09-04 17:48:09,137 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 17:48:09,137 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 17:48:09,137 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 17:48:09,137 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 17:48:09,138 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 17:48:09,138 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 17:48:09,138 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 17:48:09,138 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:48:09,138 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 17:48:09,139 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:48:09,139 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 17:48:09,139 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 17:48:09,139 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:48:09,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:48:09 BoogieIcfgContainer [2020-09-04 17:48:09,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:48:09,177 INFO L168 Benchmark]: Toolchain (without parser) took 5892.02 ms. Allocated memory was 146.3 MB in the beginning and 277.9 MB in the end (delta: 131.6 MB). Free memory was 104.0 MB in the beginning and 110.0 MB in the end (delta: -6.0 MB). Peak memory consumption was 125.9 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:09,178 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 146.3 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:48:09,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.99 ms. Allocated memory is still 146.3 MB. Free memory was 103.8 MB in the beginning and 93.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:09,180 INFO L168 Benchmark]: Boogie Preprocessor took 150.33 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.2 MB in the beginning and 182.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:09,181 INFO L168 Benchmark]: RCFGBuilder took 449.67 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 160.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:09,182 INFO L168 Benchmark]: TraceAbstraction took 4937.10 ms. Allocated memory was 203.9 MB in the beginning and 277.9 MB in the end (delta: 73.9 MB). Free memory was 160.0 MB in the beginning and 110.0 MB in the end (delta: 50.0 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:09,187 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 146.3 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.99 ms. Allocated memory is still 146.3 MB. Free memory was 103.8 MB in the beginning and 93.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.33 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.2 MB in the beginning and 182.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.67 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 160.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4937.10 ms. Allocated memory was 203.9 MB in the beginning and 277.9 MB in the end (delta: 73.9 MB). Free memory was 160.0 MB in the beginning and 110.0 MB in the end (delta: 50.0 MB). Peak memory consumption was 124.2 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.1s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 680 SDtfs, 310 SDslu, 2021 SDs, 0 SdLazy, 509 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 398 PreInvPairs, 534 NumberOfFragments, 1150 HoareAnnotationTreeSize, 398 FomulaSimplifications, 717 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 92 FomulaSimplificationsInter, 579 FormulaSimplificationTreeSizeReductionInter, 1.1s 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...