/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/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:14:38,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:14:38,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:14:38,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:14:38,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:14:38,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:14:38,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:14:38,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:14:38,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:14:38,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:14:38,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:14:38,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:14:38,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:14:38,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:14:38,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:14:38,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:14:38,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:14:38,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:14:38,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:14:38,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:14:38,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:14:38,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:14:38,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:14:38,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:14:38,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:14:38,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:14:38,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:14:38,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:14:38,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:14:38,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:14:38,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:14:38,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:14:38,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:14:38,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:14:38,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:14:38,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:14:38,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:14:38,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:14:38,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:14:38,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:14:38,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:14:38,733 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:14:38,769 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:14:38,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:14:38,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:14:38,774 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:14:38,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:14:38,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:14:38,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:14:38,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:14:38,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:14:38,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:14:38,776 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:14:38,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:14:38,776 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:14:38,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:14:38,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:14:38,777 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:14:38,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:14:38,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:14:38,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:14:38,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:14:38,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:14:38,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:14:38,780 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:14:39,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:14:39,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:14:39,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:14:39,309 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:14:39,309 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:14:39,311 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2020-09-04 23:14:39,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1ccd43e5/6c928d8dcc38468f895daa31ac673ea1/FLAG08c6ed39c [2020-09-04 23:14:39,980 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:14:39,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/large_const.i [2020-09-04 23:14:39,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1ccd43e5/6c928d8dcc38468f895daa31ac673ea1/FLAG08c6ed39c [2020-09-04 23:14:40,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1ccd43e5/6c928d8dcc38468f895daa31ac673ea1 [2020-09-04 23:14:40,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:14:40,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:14:40,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:40,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:14:40,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:14:40,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b6e365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40, skipping insertion in model container [2020-09-04 23:14:40,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:14:40,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:14:40,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:40,705 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:14:40,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:40,747 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:14:40,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40 WrapperNode [2020-09-04 23:14:40,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:40,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:14:40,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:14:40,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:14:40,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (1/1) ... [2020-09-04 23:14:40,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:14:40,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:14:40,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:14:40,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:14:40,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (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:14:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:14:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:14:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:14:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:14:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:14:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:14:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:14:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:14:41,260 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:14:41,261 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 23:14:41,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:41 BoogieIcfgContainer [2020-09-04 23:14:41,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:14:41,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:14:41,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:14:41,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:14:41,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:14:40" (1/3) ... [2020-09-04 23:14:41,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a020a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:41, skipping insertion in model container [2020-09-04 23:14:41,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:40" (2/3) ... [2020-09-04 23:14:41,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a020a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:41, skipping insertion in model container [2020-09-04 23:14:41,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:41" (3/3) ... [2020-09-04 23:14:41,279 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-09-04 23:14:41,295 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:14:41,307 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:14:41,333 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:14:41,377 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:14:41,377 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:14:41,377 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:14:41,378 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:14:41,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:14:41,378 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:14:41,378 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:14:41,378 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:14:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-09-04 23:14:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 23:14:41,416 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:41,417 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] [2020-09-04 23:14:41,418 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash 288343897, now seen corresponding path program 1 times [2020-09-04 23:14:41,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:41,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [140469264] [2020-09-04 23:14:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:41,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:41,617 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:14:41,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [140469264] [2020-09-04 23:14:41,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-04 23:14:41,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781823848] [2020-09-04 23:14:41,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-04 23:14:41,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:41,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-04 23:14:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 23:14:41,657 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-09-04 23:14:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:41,724 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2020-09-04 23:14:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-04 23:14:41,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-09-04 23:14:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:41,743 INFO L225 Difference]: With dead ends: 75 [2020-09-04 23:14:41,743 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 23:14:41,747 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 23:14:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 23:14:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 23:14:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 23:14:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-09-04 23:14:41,806 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2020-09-04 23:14:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:41,807 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-09-04 23:14:41,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-04 23:14:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-09-04 23:14:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 23:14:41,808 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:41,808 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] [2020-09-04 23:14:41,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:14:41,809 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash 320540924, now seen corresponding path program 1 times [2020-09-04 23:14:41,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:41,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [490578451] [2020-09-04 23:14:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:41,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:41,913 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:14:41,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [490578451] [2020-09-04 23:14:41,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:41,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:14:41,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941727579] [2020-09-04 23:14:41,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:14:41,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:41,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:14:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:14:41,919 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2020-09-04 23:14:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:42,026 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-09-04 23:14:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 23:14:42,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-09-04 23:14:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:42,029 INFO L225 Difference]: With dead ends: 67 [2020-09-04 23:14:42,029 INFO L226 Difference]: Without dead ends: 51 [2020-09-04 23:14:42,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-04 23:14:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-09-04 23:14:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-09-04 23:14:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-09-04 23:14:42,043 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2020-09-04 23:14:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:42,043 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-09-04 23:14:42,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:14:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-09-04 23:14:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 23:14:42,045 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:42,045 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:42,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:14:42,046 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:42,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash 751787059, now seen corresponding path program 1 times [2020-09-04 23:14:42,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:42,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629950436] [2020-09-04 23:14:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:42,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629950436] [2020-09-04 23:14:42,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:42,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:14:42,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375782382] [2020-09-04 23:14:42,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:42,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:42,252 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2020-09-04 23:14:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:42,441 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-09-04 23:14:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:14:42,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-09-04 23:14:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:42,444 INFO L225 Difference]: With dead ends: 88 [2020-09-04 23:14:42,444 INFO L226 Difference]: Without dead ends: 86 [2020-09-04 23:14:42,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:14:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-04 23:14:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-09-04 23:14:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 23:14:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-09-04 23:14:42,466 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-09-04 23:14:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:42,467 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-09-04 23:14:42,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-09-04 23:14:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 23:14:42,469 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:42,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:42,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:14:42,470 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash 3796503, now seen corresponding path program 1 times [2020-09-04 23:14:42,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:42,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708628623] [2020-09-04 23:14:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:42,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708628623] [2020-09-04 23:14:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:42,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:14:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849287544] [2020-09-04 23:14:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:42,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:42,650 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 7 states. [2020-09-04 23:14:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:42,801 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-09-04 23:14:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:14:42,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-09-04 23:14:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:42,806 INFO L225 Difference]: With dead ends: 105 [2020-09-04 23:14:42,806 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 23:14:42,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:14:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 23:14:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2020-09-04 23:14:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 23:14:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-09-04 23:14:42,828 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 38 [2020-09-04 23:14:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:42,829 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-09-04 23:14:42,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-09-04 23:14:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 23:14:42,830 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:42,831 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:42,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:14:42,831 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 197728887, now seen corresponding path program 1 times [2020-09-04 23:14:42,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:42,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178748226] [2020-09-04 23:14:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:42,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178748226] [2020-09-04 23:14:42,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:42,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:14:42,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37959170] [2020-09-04 23:14:42,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:42,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:42,927 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2020-09-04 23:14:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:43,061 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-09-04 23:14:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:14:43,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-09-04 23:14:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:43,064 INFO L225 Difference]: With dead ends: 116 [2020-09-04 23:14:43,064 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 23:14:43,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:14:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 23:14:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2020-09-04 23:14:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-09-04 23:14:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-09-04 23:14:43,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2020-09-04 23:14:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:43,088 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-09-04 23:14:43,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-09-04 23:14:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-04 23:14:43,090 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:43,094 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:43,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:14:43,095 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash 88652198, now seen corresponding path program 1 times [2020-09-04 23:14:43,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:43,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98091426] [2020-09-04 23:14:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:14:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:43,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98091426] [2020-09-04 23:14:43,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:43,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:14:43,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831918137] [2020-09-04 23:14:43,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:43,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:43,217 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 9 states. [2020-09-04 23:14:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:43,427 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2020-09-04 23:14:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 23:14:43,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-09-04 23:14:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:43,430 INFO L225 Difference]: With dead ends: 129 [2020-09-04 23:14:43,430 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 23:14:43,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 23:14:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2020-09-04 23:14:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 23:14:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2020-09-04 23:14:43,452 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 49 [2020-09-04 23:14:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:43,453 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2020-09-04 23:14:43,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2020-09-04 23:14:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 23:14:43,455 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:43,455 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 23:14:43,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:14:43,456 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1084443264, now seen corresponding path program 1 times [2020-09-04 23:14:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:43,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [885583035] [2020-09-04 23:14:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:43,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [885583035] [2020-09-04 23:14:43,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 23:14:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4734764] [2020-09-04 23:14:43,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:14:43,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:14:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:14:43,522 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 6 states. [2020-09-04 23:14:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:43,589 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2020-09-04 23:14:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:14:43,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-09-04 23:14:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:43,591 INFO L225 Difference]: With dead ends: 150 [2020-09-04 23:14:43,592 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 23:14:43,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 23:14:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-09-04 23:14:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 23:14:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-09-04 23:14:43,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 48 [2020-09-04 23:14:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:43,609 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-09-04 23:14:43,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:14:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-09-04 23:14:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 23:14:43,611 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:43,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:43,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:14:43,612 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1391225462, now seen corresponding path program 1 times [2020-09-04 23:14:43,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:43,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025629749] [2020-09-04 23:14:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:43,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025629749] [2020-09-04 23:14:43,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:43,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:14:43,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661277044] [2020-09-04 23:14:43,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:43,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:43,738 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-09-04 23:14:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:43,923 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2020-09-04 23:14:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 23:14:43,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-09-04 23:14:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:43,926 INFO L225 Difference]: With dead ends: 96 [2020-09-04 23:14:43,926 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 23:14:43,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 23:14:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2020-09-04 23:14:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 23:14:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-09-04 23:14:43,939 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 50 [2020-09-04 23:14:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:43,940 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-09-04 23:14:43,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-09-04 23:14:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 23:14:43,941 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:43,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:43,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:14:43,942 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -798805526, now seen corresponding path program 1 times [2020-09-04 23:14:43,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:43,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984033881] [2020-09-04 23:14:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:44,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984033881] [2020-09-04 23:14:44,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:44,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:14:44,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381107352] [2020-09-04 23:14:44,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:44,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:44,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:44,040 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-09-04 23:14:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:44,216 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-09-04 23:14:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 23:14:44,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-09-04 23:14:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:44,218 INFO L225 Difference]: With dead ends: 94 [2020-09-04 23:14:44,218 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 23:14:44,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 23:14:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2020-09-04 23:14:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 23:14:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2020-09-04 23:14:44,231 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 50 [2020-09-04 23:14:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:44,232 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2020-09-04 23:14:44,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-09-04 23:14:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 23:14:44,234 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:44,234 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-09-04 23:14:44,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:14:44,234 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1367702887, now seen corresponding path program 2 times [2020-09-04 23:14:44,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:44,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51833205] [2020-09-04 23:14:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:14:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:14:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 23:14:44,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51833205] [2020-09-04 23:14:44,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:44,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:14:44,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762182457] [2020-09-04 23:14:44,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:14:44,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:14:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:14:44,301 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 6 states. [2020-09-04 23:14:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:44,374 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-09-04 23:14:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:14:44,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-09-04 23:14:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:44,374 INFO L225 Difference]: With dead ends: 67 [2020-09-04 23:14:44,375 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:14:44,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:14:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:14:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:14:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:14:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:14:44,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-09-04 23:14:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:44,377 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:14:44,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:14:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:14:44,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:14:44,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:14:44,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:14:45,897 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2020-09-04 23:14:46,041 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,041 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,041 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,041 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:14:46,042 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:46,042 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:46,042 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:14:46,042 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:14:46,042 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:46,043 INFO L264 CegarLoopResult]: At program point L35-2(lines 35 39) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 main_~j~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse3 (<= main_~n~0 1)) (.cse2 (<= 2000 main_~c2~0)) (.cse4 (<= 10000 main_~c3~0))) (or (and .cse0 .cse1 (<= 1999 main_~k~0) (<= main_~n~0 main_~i~0) .cse2 .cse3 .cse4) (and .cse0 (<= main_~i~0 0) (<= main_~n~0 0)) (and .cse1 (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)) .cse3 .cse2 .cse4))) [2020-09-04 23:14:46,043 INFO L271 CegarLoopResult]: At program point L35-3(lines 35 39) the Hoare annotation is: true [2020-09-04 23:14:46,043 INFO L264 CegarLoopResult]: At program point L27(lines 27 32) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,044 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 41) the Hoare annotation is: true [2020-09-04 23:14:46,044 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 33) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= main_~n~0 0)) (and (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= main_~n~0 main_~i~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0))) [2020-09-04 23:14:46,044 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,044 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,044 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,045 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (<= 4000 main_~c1~0) [2020-09-04 23:14:46,045 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,045 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 (+ main_~j~0 1)) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,045 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,045 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,046 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,046 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0) (<= 0 |main_#t~post1|)) [2020-09-04 23:14:46,046 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0) (<= 0 |main_#t~post1|)) [2020-09-04 23:14:46,046 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,047 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-09-04 23:14:46,047 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-09-04 23:14:46,047 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 (+ main_~j~0 1)) (<= main_~n~0 (+ |main_#t~post3| 1)) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,047 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= main_~n~0 main_~j~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 (+ |main_#t~post3| 1)) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,048 INFO L264 CegarLoopResult]: At program point L29(lines 29 32) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,048 INFO L264 CegarLoopResult]: At program point L29-2(lines 23 33) the Hoare annotation is: (let ((.cse0 (<= 4000 main_~c1~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 10000 main_~c3~0))) (or (and .cse0 (<= main_~i~0 0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) .cse1 .cse2) (and .cse0 (<= 1 main_~i~0) (<= 2000 main_~k~0) .cse1 (<= main_~n~0 1) .cse2))) [2020-09-04 23:14:46,048 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,048 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,048 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,049 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,049 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,049 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,049 INFO L271 CegarLoopResult]: At program point L13(lines 13 41) the Hoare annotation is: true [2020-09-04 23:14:46,049 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 41) the Hoare annotation is: true [2020-09-04 23:14:46,050 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= main_~n~0 main_~j~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,050 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 |main_#t~post4|) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,050 INFO L264 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= main_~n~0 main_~j~0) (<= 1 main_~i~0) (<= 1999 main_~k~0) (<= 2000 |main_#t~post4|) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,050 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,050 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 41) the Hoare annotation is: true [2020-09-04 23:14:46,051 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,051 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-09-04 23:14:46,051 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,051 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,051 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,052 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-09-04 23:14:46,052 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-09-04 23:14:46,052 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:14:46,052 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:14:46,052 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:14:46,052 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:14:46,053 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:14:46,053 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:14:46,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:14:46 BoogieIcfgContainer [2020-09-04 23:14:46,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:14:46,084 INFO L168 Benchmark]: Toolchain (without parser) took 5763.45 ms. Allocated memory was 137.4 MB in the beginning and 291.5 MB in the end (delta: 154.1 MB). Free memory was 102.4 MB in the beginning and 223.0 MB in the end (delta: -120.6 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,085 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.75 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 92.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,087 INFO L168 Benchmark]: Boogie Preprocessor took 114.46 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 92.0 MB in the beginning and 178.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,088 INFO L168 Benchmark]: RCFGBuilder took 405.53 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 162.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,089 INFO L168 Benchmark]: TraceAbstraction took 4811.17 ms. Allocated memory was 200.3 MB in the beginning and 291.5 MB in the end (delta: 91.2 MB). Free memory was 161.3 MB in the beginning and 223.0 MB in the end (delta: -61.7 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:46,093 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.28 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 425.75 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 92.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.46 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 92.0 MB in the beginning and 178.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.53 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 162.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4811.17 ms. Allocated memory was 200.3 MB in the beginning and 291.5 MB in the end (delta: 91.2 MB). Free memory was 161.3 MB in the beginning and 223.0 MB in the end (delta: -61.7 MB). Peak memory consumption was 120.9 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: 23]: Loop Invariant Derived loop invariant: (((((((4000 <= c1 && i <= 0) && 10000 <= c3 + k) && 0 <= i) && 4000 <= c1 + k) && 2000 <= c2 + k) && 2000 <= c2) && 10000 <= c3) || (((((4000 <= c1 && 1 <= i) && 2000 <= k) && 2000 <= c2) && n <= 1) && 10000 <= c3) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((n <= j && 4000 <= c1) && 1999 <= k) && n <= i) && 2000 <= c2) && n <= 1) && 10000 <= c3) || ((n <= j && i <= 0) && n <= 0)) || ((((((4000 <= c1 && 1 <= i) && 2000 <= k) && n <= j + 1) && n <= 1) && 2000 <= c2) && 10000 <= c3) - 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, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 564 SDtfs, 481 SDslu, 1894 SDs, 0 SdLazy, 481 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred 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, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 97 PreInvPairs, 130 NumberOfFragments, 838 HoareAnnotationTreeSize, 97 FomulaSimplifications, 4365 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 55 FomulaSimplificationsInter, 798 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 45031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 37/50 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...