/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:02:33,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:02:33,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:02:34,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:02:34,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:02:34,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:02:34,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:02:34,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:02:34,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:02:34,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:02:34,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:02:34,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:02:34,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:02:34,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:02:34,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:02:34,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:02:34,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:02:34,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:02:34,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:02:34,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:02:34,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:02:34,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:02:34,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:02:34,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:02:34,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:02:34,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:02:34,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:02:34,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:02:34,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:02:34,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:02:34,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:02:34,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:02:34,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:02:34,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:02:34,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:02:34,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:02:34,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:02:34,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:02:34,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:02:34,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:02:34,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:02:34,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:02:34,107 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:02:34,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:02:34,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:02:34,110 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:02:34,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:02:34,112 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:02:34,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:02:34,113 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:02:34,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:02:34,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:02:34,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:02:34,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:02:34,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:02:34,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:02:34,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:02:34,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:02:34,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:02:34,115 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:02:34,115 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:02:34,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:02:34,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:02:34,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:02:34,507 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:02:34,508 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:02:34,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2021-05-02 23:02:34,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4366331/f03b86a9b3a344e79e23fdffd921ba33/FLAG944434a01 [2021-05-02 23:02:34,940 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:02:34,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2021-05-02 23:02:34,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4366331/f03b86a9b3a344e79e23fdffd921ba33/FLAG944434a01 [2021-05-02 23:02:35,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4366331/f03b86a9b3a344e79e23fdffd921ba33 [2021-05-02 23:02:35,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:02:35,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:02:35,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:35,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:02:35,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:02:35,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5005d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35, skipping insertion in model container [2021-05-02 23:02:35,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:02:35,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:02:35,532 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2021-05-02 23:02:35,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:35,561 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:02:35,582 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2021-05-02 23:02:35,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:35,622 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:02:35,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35 WrapperNode [2021-05-02 23:02:35,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:35,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:02:35,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:02:35,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:02:35,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... [2021-05-02 23:02:35,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:02:35,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:02:35,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:02:35,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:02:35,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2021-05-02 23:02:35,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:02:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:02:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:02:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:02:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:02:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:02:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:02:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:02:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:02:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:02:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:02:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:02:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:02:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:02:36,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:02:36,026 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:02:36,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:36 BoogieIcfgContainer [2021-05-02 23:02:36,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:02:36,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:02:36,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:02:36,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:02:36,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:02:35" (1/3) ... [2021-05-02 23:02:36,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253998c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:36, skipping insertion in model container [2021-05-02 23:02:36,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:35" (2/3) ... [2021-05-02 23:02:36,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253998c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:36, skipping insertion in model container [2021-05-02 23:02:36,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:36" (3/3) ... [2021-05-02 23:02:36,033 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2021-05-02 23:02:36,038 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:02:36,041 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:02:36,055 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:02:36,072 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:02:36,073 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:02:36,073 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:02:36,073 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:02:36,073 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:02:36,073 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:02:36,073 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:02:36,073 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:02:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:02:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 23:02:36,090 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:36,091 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:36,091 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 1 times [2021-05-02 23:02:36,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:36,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1866110954] [2021-05-02 23:02:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:36,156 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:36,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:36,391 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:36,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1866110954] [2021-05-02 23:02:36,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1866110954] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:36,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:36,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:02:36,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882206460] [2021-05-02 23:02:36,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:02:36,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:02:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:02:36,410 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:36,640 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2021-05-02 23:02:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:02:36,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 23:02:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:36,647 INFO L225 Difference]: With dead ends: 39 [2021-05-02 23:02:36,647 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:02:36,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:02:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:02:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-05-02 23:02:36,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2021-05-02 23:02:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:36,682 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-05-02 23:02:36,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-05-02 23:02:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:02:36,682 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:36,683 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:36,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:02:36,683 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 1 times [2021-05-02 23:02:36,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:36,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [665894509] [2021-05-02 23:02:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:36,762 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_8 v_main_~n~0_8) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:02:36,780 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:36,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:36,820 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:36,866 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:36,898 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:37,223 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:37,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [665894509] [2021-05-02 23:02:37,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [665894509] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:37,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:37,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:37,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448601630] [2021-05-02 23:02:37,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:37,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:37,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:37,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:37,232 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:37,566 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2021-05-02 23:02:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:02:37,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:02:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:37,569 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:02:37,569 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:02:37,571 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 372.8ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:02:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:02:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:02:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-05-02 23:02:37,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2021-05-02 23:02:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:37,581 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-05-02 23:02:37,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-05-02 23:02:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:02:37,582 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:37,583 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:37,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:02:37,583 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1799219726, now seen corresponding path program 2 times [2021-05-02 23:02:37,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:37,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125531857] [2021-05-02 23:02:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:37,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_12 v_main_~n~0_9) InVars {main_~i~0=v_main_~i~0_12, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_12, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,605 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:37,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,634 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:37,649 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:37,670 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:37,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_14 1) v_main_~n~0_10) InVars {main_~i~0=v_main_~i~0_14, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_14, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,682 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:37,698 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:37,730 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:37,750 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:38,085 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:38,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125531857] [2021-05-02 23:02:38,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2125531857] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:38,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:38,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:02:38,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032319293] [2021-05-02 23:02:38,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:02:38,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:02:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:38,088 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:38,429 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-05-02 23:02:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:02:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 23:02:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:38,430 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:02:38,430 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:02:38,430 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 440.3ms TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:02:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:02:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:02:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-05-02 23:02:38,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2021-05-02 23:02:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:38,435 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-05-02 23:02:38,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-05-02 23:02:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 23:02:38,436 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:38,436 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:38,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:02:38,436 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1341755824, now seen corresponding path program 3 times [2021-05-02 23:02:38,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:38,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130540926] [2021-05-02 23:02:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:38,449 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_19 v_main_~n~0_11) InVars {main_~i~0=v_main_~i~0_19, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_19, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:02:38,453 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:38,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:38,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:38,486 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:38,502 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:38,506 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_21 1) v_main_~n~0_12) InVars {main_~i~0=v_main_~i~0_21, main_~n~0=v_main_~n~0_12} OutVars{main_~i~0=v_main_~i~0_21, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] [2021-05-02 23:02:38,510 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:38,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:38,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:38,545 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:38,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:38,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:38,827 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:38,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130540926] [2021-05-02 23:02:38,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2130540926] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:38,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:38,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:02:38,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528115935] [2021-05-02 23:02:38,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:02:38,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:02:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:02:38,829 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:39,261 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2021-05-02 23:02:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:02:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 23:02:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:39,263 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:02:39,263 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:02:39,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 482.3ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:02:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:02:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:02:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2021-05-02 23:02:39,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2021-05-02 23:02:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:39,269 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2021-05-02 23:02:39,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-05-02 23:02:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:02:39,270 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:39,270 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:39,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:02:39,270 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 194389806, now seen corresponding path program 4 times [2021-05-02 23:02:39,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:39,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756350074] [2021-05-02 23:02:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:39,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_27 v_main_~n~0_13) InVars {main_~i~0=v_main_~i~0_27, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_27, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:02:39,282 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:39,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:39,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:39,321 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:39,339 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:39,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_29 1) v_main_~n~0_14) InVars {main_~i~0=v_main_~i~0_29, main_~n~0=v_main_~n~0_14} OutVars{main_~i~0=v_main_~i~0_29, main_~n~0=v_main_~n~0_14} AuxVars[] AssignedVars[] [2021-05-02 23:02:39,346 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:39,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:39,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:39,384 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:39,401 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:39,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:39,715 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:39,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756350074] [2021-05-02 23:02:39,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1756350074] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:39,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:39,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:02:39,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457729640] [2021-05-02 23:02:39,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:02:39,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:02:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:02:39,717 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:40,226 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2021-05-02 23:02:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 23:02:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:40,227 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:02:40,227 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:02:40,228 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 602.1ms TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:02:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:02:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:02:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-05-02 23:02:40,233 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2021-05-02 23:02:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:40,233 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-05-02 23:02:40,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-05-02 23:02:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 23:02:40,234 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:40,234 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:40,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:02:40,235 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1038409588, now seen corresponding path program 5 times [2021-05-02 23:02:40,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:40,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111980078] [2021-05-02 23:02:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:40,247 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_36 v_main_~n~0_15) InVars {main_~i~0=v_main_~i~0_36, main_~n~0=v_main_~n~0_15} OutVars{main_~i~0=v_main_~i~0_36, main_~n~0=v_main_~n~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,252 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:40,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:40,288 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:40,302 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:40,306 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_38 1) v_main_~n~0_16) InVars {main_~i~0=v_main_~i~0_38, main_~n~0=v_main_~n~0_16} OutVars{main_~i~0=v_main_~i~0_38, main_~n~0=v_main_~n~0_16} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,308 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:40,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:40,341 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:40,356 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:40,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:40,700 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:40,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111980078] [2021-05-02 23:02:40,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1111980078] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:40,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:40,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:02:40,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080258761] [2021-05-02 23:02:40,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:02:40,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:02:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:02:40,702 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:41,334 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2021-05-02 23:02:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:02:41,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 23:02:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:41,336 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:02:41,336 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:02:41,337 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 669.2ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:02:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:02:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:02:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2021-05-02 23:02:41,347 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2021-05-02 23:02:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:41,348 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2021-05-02 23:02:41,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2021-05-02 23:02:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 23:02:41,350 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:41,350 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:41,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:02:41,351 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -347653526, now seen corresponding path program 6 times [2021-05-02 23:02:41,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:41,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188008214] [2021-05-02 23:02:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:41,362 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_46 v_main_~n~0_17) InVars {main_~i~0=v_main_~i~0_46, main_~n~0=v_main_~n~0_17} OutVars{main_~i~0=v_main_~i~0_46, main_~n~0=v_main_~n~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:02:41,364 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:41,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:41,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:41,413 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:41,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:41,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_48 1) v_main_~n~0_18) InVars {main_~i~0=v_main_~i~0_48, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_48, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[] [2021-05-02 23:02:41,444 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:41,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:41,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:41,482 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:41,500 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:41,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:41,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:41,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188008214] [2021-05-02 23:02:41,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1188008214] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:41,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:41,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:02:41,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841070706] [2021-05-02 23:02:41,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:02:41,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:02:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:02:41,900 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:42,549 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2021-05-02 23:02:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:02:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-02 23:02:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:42,550 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:02:42,551 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:02:42,551 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 718.4ms TimeCoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:02:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:02:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:02:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-05-02 23:02:42,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2021-05-02 23:02:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:42,557 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-05-02 23:02:42,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-05-02 23:02:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:02:42,558 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:42,558 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:42,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:02:42,558 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2043958472, now seen corresponding path program 7 times [2021-05-02 23:02:42,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:42,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68564624] [2021-05-02 23:02:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:42,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_57 v_main_~n~0_19) InVars {main_~i~0=v_main_~i~0_57, main_~n~0=v_main_~n~0_19} OutVars{main_~i~0=v_main_~i~0_57, main_~n~0=v_main_~n~0_19} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,567 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:42,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:42,597 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:42,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:42,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_59 1) v_main_~n~0_20) InVars {main_~i~0=v_main_~i~0_59, main_~n~0=v_main_~n~0_20} OutVars{main_~i~0=v_main_~i~0_59, main_~n~0=v_main_~n~0_20} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,619 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:42,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:42,651 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:42,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:42,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:43,103 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:43,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68564624] [2021-05-02 23:02:43,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [68564624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:43,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:43,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:02:43,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882297843] [2021-05-02 23:02:43,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:02:43,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:02:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:02:43,105 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:43,856 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2021-05-02 23:02:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:02:43,856 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-02 23:02:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:43,857 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:02:43,857 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:02:43,858 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 873.7ms TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:02:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:02:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:02:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2021-05-02 23:02:43,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2021-05-02 23:02:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:43,863 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2021-05-02 23:02:43,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2021-05-02 23:02:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 23:02:43,864 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:43,864 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:43,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:02:43,864 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1719382106, now seen corresponding path program 8 times [2021-05-02 23:02:43,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:43,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961056425] [2021-05-02 23:02:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:43,873 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_69 v_main_~n~0_21) InVars {main_~i~0=v_main_~i~0_69, main_~n~0=v_main_~n~0_21} OutVars{main_~i~0=v_main_~i~0_69, main_~n~0=v_main_~n~0_21} AuxVars[] AssignedVars[] [2021-05-02 23:02:43,876 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:43,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:43,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:43,907 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:43,922 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:43,924 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_71 1) v_main_~n~0_22) InVars {main_~i~0=v_main_~i~0_71, main_~n~0=v_main_~n~0_22} OutVars{main_~i~0=v_main_~i~0_71, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:02:43,928 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:43,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:43,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:43,958 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:43,971 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:44,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:44,429 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:44,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961056425] [2021-05-02 23:02:44,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [961056425] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:44,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:44,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:02:44,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968231154] [2021-05-02 23:02:44,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:02:44,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:02:44,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:02:44,431 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:45,353 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2021-05-02 23:02:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:02:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-05-02 23:02:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:45,354 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:02:45,354 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:02:45,355 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 970.5ms TimeCoverageRelationStatistics Valid=187, Invalid=1975, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:02:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:02:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:02:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2021-05-02 23:02:45,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2021-05-02 23:02:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:45,360 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2021-05-02 23:02:45,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2021-05-02 23:02:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 23:02:45,361 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:45,361 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:45,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:02:45,362 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1927214332, now seen corresponding path program 9 times [2021-05-02 23:02:45,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:45,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [933078335] [2021-05-02 23:02:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:45,367 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_82 v_main_~n~0_23) InVars {main_~i~0=v_main_~i~0_82, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_82, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,369 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:45,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:45,398 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:45,417 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:45,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_84 1) v_main_~n~0_24) InVars {main_~i~0=v_main_~i~0_84, main_~n~0=v_main_~n~0_24} OutVars{main_~i~0=v_main_~i~0_84, main_~n~0=v_main_~n~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,431 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:45,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:45,466 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:45,481 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:45,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:46,012 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:46,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [933078335] [2021-05-02 23:02:46,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [933078335] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:46,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:46,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:02:46,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226618262] [2021-05-02 23:02:46,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:02:46,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:02:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:02:46,014 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:46,924 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2021-05-02 23:02:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:02:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-02 23:02:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:46,925 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:02:46,925 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:02:46,926 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1047.5ms TimeCoverageRelationStatistics Valid=203, Invalid=2347, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:02:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:02:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:02:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2021-05-02 23:02:46,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2021-05-02 23:02:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:46,931 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2021-05-02 23:02:46,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2021-05-02 23:02:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:02:46,932 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:46,932 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:46,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:02:46,932 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash 209479394, now seen corresponding path program 10 times [2021-05-02 23:02:46,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:46,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1556357148] [2021-05-02 23:02:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:46,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_96 v_main_~n~0_25) InVars {main_~i~0=v_main_~i~0_96, main_~n~0=v_main_~n~0_25} OutVars{main_~i~0=v_main_~i~0_96, main_~n~0=v_main_~n~0_25} AuxVars[] AssignedVars[] [2021-05-02 23:02:46,943 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:46,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:46,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:46,972 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:46,986 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:46,988 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_98 1) v_main_~n~0_26) InVars {main_~i~0=v_main_~i~0_98, main_~n~0=v_main_~n~0_26} OutVars{main_~i~0=v_main_~i~0_98, main_~n~0=v_main_~n~0_26} AuxVars[] AssignedVars[] [2021-05-02 23:02:46,990 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:47,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:47,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:47,018 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:47,031 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:47,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:47,635 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:47,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1556357148] [2021-05-02 23:02:47,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1556357148] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:47,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:47,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:02:47,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215883272] [2021-05-02 23:02:47,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:02:47,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:47,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:02:47,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:02:47,636 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:48,724 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2021-05-02 23:02:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:02:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-02 23:02:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:48,725 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:02:48,725 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:02:48,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1265.8ms TimeCoverageRelationStatistics Valid=219, Invalid=2751, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:02:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:02:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:02:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2021-05-02 23:02:48,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2021-05-02 23:02:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:48,732 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2021-05-02 23:02:48,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2021-05-02 23:02:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 23:02:48,733 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:48,733 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:48,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:02:48,733 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 577782592, now seen corresponding path program 11 times [2021-05-02 23:02:48,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:48,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034199844] [2021-05-02 23:02:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:48,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_111 v_main_~n~0_27) InVars {main_~i~0=v_main_~i~0_111, main_~n~0=v_main_~n~0_27} OutVars{main_~i~0=v_main_~i~0_111, main_~n~0=v_main_~n~0_27} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,742 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:48,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:48,770 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:48,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:48,785 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_113 1) v_main_~n~0_28) InVars {main_~i~0=v_main_~i~0_113, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_113, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,787 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:48,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:48,820 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:48,833 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:48,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:49,468 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:49,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034199844] [2021-05-02 23:02:49,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2034199844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:49,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:49,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:02:49,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509064133] [2021-05-02 23:02:49,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:02:49,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:02:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:02:49,470 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:50,598 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2021-05-02 23:02:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:02:50,599 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-05-02 23:02:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:50,602 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:02:50,602 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:02:50,603 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1335.4ms TimeCoverageRelationStatistics Valid=235, Invalid=3187, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:02:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:02:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:02:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2021-05-02 23:02:50,608 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2021-05-02 23:02:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:50,609 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2021-05-02 23:02:50,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2021-05-02 23:02:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-02 23:02:50,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:50,610 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:50,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:02:50,610 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1965129698, now seen corresponding path program 12 times [2021-05-02 23:02:50,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:50,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633508408] [2021-05-02 23:02:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:50,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_127 v_main_~n~0_29) InVars {main_~i~0=v_main_~i~0_127, main_~n~0=v_main_~n~0_29} OutVars{main_~i~0=v_main_~i~0_127, main_~n~0=v_main_~n~0_29} AuxVars[] AssignedVars[] [2021-05-02 23:02:50,621 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:50,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:50,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:50,652 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:50,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:50,670 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_129 1) v_main_~n~0_30) InVars {main_~i~0=v_main_~i~0_129, main_~n~0=v_main_~n~0_30} OutVars{main_~i~0=v_main_~i~0_129, main_~n~0=v_main_~n~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:02:50,672 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:50,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:50,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:50,704 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:50,744 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:50,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:51,471 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:51,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633508408] [2021-05-02 23:02:51,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1633508408] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:51,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:51,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:02:51,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847558619] [2021-05-02 23:02:51,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:02:51,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:02:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:02:51,473 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:52,743 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2021-05-02 23:02:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:02:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-05-02 23:02:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:52,744 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:02:52,744 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:02:52,745 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1503.0ms TimeCoverageRelationStatistics Valid=251, Invalid=3655, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:02:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:02:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-02 23:02:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2021-05-02 23:02:52,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2021-05-02 23:02:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:52,750 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2021-05-02 23:02:52,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2021-05-02 23:02:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 23:02:52,750 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:52,750 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:52,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:02:52,751 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1867448964, now seen corresponding path program 13 times [2021-05-02 23:02:52,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:52,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068864027] [2021-05-02 23:02:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:52,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_144 v_main_~n~0_31) InVars {main_~i~0=v_main_~i~0_144, main_~n~0=v_main_~n~0_31} OutVars{main_~i~0=v_main_~i~0_144, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[] [2021-05-02 23:02:52,764 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:52,776 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:52,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:52,793 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:52,808 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:52,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_146 1) v_main_~n~0_32) InVars {main_~i~0=v_main_~i~0_146, main_~n~0=v_main_~n~0_32} OutVars{main_~i~0=v_main_~i~0_146, main_~n~0=v_main_~n~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:02:52,812 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:52,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:52,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:52,841 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:52,858 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:52,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:53,611 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:53,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068864027] [2021-05-02 23:02:53,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068864027] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:53,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:53,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:02:53,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846579155] [2021-05-02 23:02:53,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:02:53,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:02:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:02:53,613 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:55,060 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2021-05-02 23:02:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:02:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-05-02 23:02:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:55,061 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:02:55,061 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:02:55,062 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1688.0ms TimeCoverageRelationStatistics Valid=267, Invalid=4155, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:02:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:02:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-02 23:02:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2021-05-02 23:02:55,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2021-05-02 23:02:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:55,067 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2021-05-02 23:02:55,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2021-05-02 23:02:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 23:02:55,068 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:55,068 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:55,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:02:55,068 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1809423194, now seen corresponding path program 14 times [2021-05-02 23:02:55,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:55,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50006804] [2021-05-02 23:02:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:55,074 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_162 v_main_~n~0_33) InVars {main_~i~0=v_main_~i~0_162, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_162, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[] [2021-05-02 23:02:55,085 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:55,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:55,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:55,112 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:55,128 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:55,130 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_164 1) v_main_~n~0_34) InVars {main_~i~0=v_main_~i~0_164, main_~n~0=v_main_~n~0_34} OutVars{main_~i~0=v_main_~i~0_164, main_~n~0=v_main_~n~0_34} AuxVars[] AssignedVars[] [2021-05-02 23:02:55,133 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:55,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:55,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:55,160 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:55,173 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:55,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:55,952 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:55,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50006804] [2021-05-02 23:02:55,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [50006804] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:55,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:55,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:02:55,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067238108] [2021-05-02 23:02:55,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:02:55,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:02:55,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:02:55,953 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:57,459 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2021-05-02 23:02:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:02:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-05-02 23:02:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:57,460 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:02:57,460 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:02:57,461 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1764.3ms TimeCoverageRelationStatistics Valid=283, Invalid=4687, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:02:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:02:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:02:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2021-05-02 23:02:57,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2021-05-02 23:02:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:57,467 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2021-05-02 23:02:57,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2021-05-02 23:02:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-02 23:02:57,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:57,468 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:57,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:02:57,468 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash 525482424, now seen corresponding path program 15 times [2021-05-02 23:02:57,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:57,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225442732] [2021-05-02 23:02:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:57,481 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_181 v_main_~n~0_35) InVars {main_~i~0=v_main_~i~0_181, main_~n~0=v_main_~n~0_35} OutVars{main_~i~0=v_main_~i~0_181, main_~n~0=v_main_~n~0_35} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,483 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:02:57,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:02:57,512 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:02:57,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:57,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_183 1) v_main_~n~0_36) InVars {main_~i~0=v_main_~i~0_183, main_~n~0=v_main_~n~0_36} OutVars{main_~i~0=v_main_~i~0_183, main_~n~0=v_main_~n~0_36} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,531 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:02:57,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:02:57,560 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:02:57,573 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:57,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:58,488 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:58,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225442732] [2021-05-02 23:02:58,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [225442732] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:58,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:58,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:02:58,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919991932] [2021-05-02 23:02:58,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:02:58,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:02:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:02:58,490 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:00,158 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2021-05-02 23:03:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:03:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-05-02 23:03:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:00,159 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:03:00,159 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:03:00,161 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1998.8ms TimeCoverageRelationStatistics Valid=299, Invalid=5251, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:03:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:03:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:03:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2021-05-02 23:03:00,165 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2021-05-02 23:03:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:00,165 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2021-05-02 23:03:00,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2021-05-02 23:03:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:03:00,166 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:00,166 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:00,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:03:00,167 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash -685983594, now seen corresponding path program 16 times [2021-05-02 23:03:00,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:00,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124274642] [2021-05-02 23:03:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:00,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_201 v_main_~n~0_37) InVars {main_~i~0=v_main_~i~0_201, main_~n~0=v_main_~n~0_37} OutVars{main_~i~0=v_main_~i~0_201, main_~n~0=v_main_~n~0_37} AuxVars[] AssignedVars[] [2021-05-02 23:03:00,175 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:00,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:00,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:00,202 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:00,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:00,217 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_203 1) v_main_~n~0_38) InVars {main_~i~0=v_main_~i~0_203, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_203, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[] [2021-05-02 23:03:00,218 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:00,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:00,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:00,241 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:00,255 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:00,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:01,218 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:01,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124274642] [2021-05-02 23:03:01,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2124274642] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:01,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:01,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:03:01,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13812162] [2021-05-02 23:03:01,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:03:01,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:03:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:03:01,220 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:03,031 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2021-05-02 23:03:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:03:03,031 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-02 23:03:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:03,032 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:03:03,032 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:03:03,033 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2144.3ms TimeCoverageRelationStatistics Valid=315, Invalid=5847, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:03:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:03:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:03:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2021-05-02 23:03:03,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2021-05-02 23:03:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:03,038 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2021-05-02 23:03:03,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2021-05-02 23:03:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 23:03:03,039 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:03,039 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:03,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:03:03,040 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash -968689676, now seen corresponding path program 17 times [2021-05-02 23:03:03,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:03,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1283371904] [2021-05-02 23:03:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:03,062 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_222 v_main_~n~0_39) InVars {main_~i~0=v_main_~i~0_222, main_~n~0=v_main_~n~0_39} OutVars{main_~i~0=v_main_~i~0_222, main_~n~0=v_main_~n~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:03:03,064 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:03,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:03,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:03,093 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:03,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:03,110 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_224 1) v_main_~n~0_40) InVars {main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_40} OutVars{main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[] [2021-05-02 23:03:03,112 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:03,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:03,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:03,137 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:03,150 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:03,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:04,248 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:04,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1283371904] [2021-05-02 23:03:04,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1283371904] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:04,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:04,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:03:04,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267760911] [2021-05-02 23:03:04,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:03:04,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:03:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1764, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:03:04,250 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:06,232 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2021-05-02 23:03:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:03:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-05-02 23:03:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:06,233 INFO L225 Difference]: With dead ends: 54 [2021-05-02 23:03:06,233 INFO L226 Difference]: Without dead ends: 49 [2021-05-02 23:03:06,234 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 2341.5ms TimeCoverageRelationStatistics Valid=331, Invalid=6475, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:03:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-02 23:03:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-02 23:03:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2021-05-02 23:03:06,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2021-05-02 23:03:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:06,241 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2021-05-02 23:03:06,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2021-05-02 23:03:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-05-02 23:03:06,241 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:06,242 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:06,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:03:06,242 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2066294830, now seen corresponding path program 18 times [2021-05-02 23:03:06,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:06,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004175077] [2021-05-02 23:03:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:06,248 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_244 v_main_~n~0_41) InVars {main_~i~0=v_main_~i~0_244, main_~n~0=v_main_~n~0_41} OutVars{main_~i~0=v_main_~i~0_244, main_~n~0=v_main_~n~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:03:06,249 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:06,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:06,274 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:06,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:06,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_246 1) v_main_~n~0_42) InVars {main_~i~0=v_main_~i~0_246, main_~n~0=v_main_~n~0_42} OutVars{main_~i~0=v_main_~i~0_246, main_~n~0=v_main_~n~0_42} AuxVars[] AssignedVars[] [2021-05-02 23:03:06,291 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:06,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,306 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:06,315 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:06,329 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:07,491 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:07,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004175077] [2021-05-02 23:03:07,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2004175077] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:07,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:07,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:03:07,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550208] [2021-05-02 23:03:07,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:03:07,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:03:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1936, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:03:07,493 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:09,712 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2021-05-02 23:03:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:03:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-05-02 23:03:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:09,713 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:03:09,713 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:03:09,714 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 2603.7ms TimeCoverageRelationStatistics Valid=347, Invalid=7135, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:03:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:03:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:03:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2021-05-02 23:03:09,719 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2021-05-02 23:03:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:09,719 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2021-05-02 23:03:09,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2021-05-02 23:03:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:03:09,720 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:09,720 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:09,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:03:09,720 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -302893008, now seen corresponding path program 19 times [2021-05-02 23:03:09,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:09,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070409537] [2021-05-02 23:03:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:09,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_267 v_main_~n~0_43) InVars {main_~i~0=v_main_~i~0_267, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_267, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,728 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:09,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:09,755 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:09,768 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:09,770 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_269 1) v_main_~n~0_44) InVars {main_~i~0=v_main_~i~0_269, main_~n~0=v_main_~n~0_44} OutVars{main_~i~0=v_main_~i~0_269, main_~n~0=v_main_~n~0_44} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,772 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:09,773 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:09,804 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:09,822 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:09,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:10,975 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:10,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070409537] [2021-05-02 23:03:10,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1070409537] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:10,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:10,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:03:10,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547258987] [2021-05-02 23:03:10,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:03:10,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:03:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2116, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:03:10,977 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:13,262 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2021-05-02 23:03:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:03:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-02 23:03:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:13,263 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:03:13,263 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:03:13,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 2645.7ms TimeCoverageRelationStatistics Valid=363, Invalid=7827, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:03:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:03:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:03:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2021-05-02 23:03:13,269 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2021-05-02 23:03:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:13,269 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2021-05-02 23:03:13,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2021-05-02 23:03:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-02 23:03:13,270 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:13,270 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:13,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:03:13,270 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2109143310, now seen corresponding path program 20 times [2021-05-02 23:03:13,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:13,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1637983375] [2021-05-02 23:03:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:13,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_291 v_main_~n~0_45) InVars {main_~i~0=v_main_~i~0_291, main_~n~0=v_main_~n~0_45} OutVars{main_~i~0=v_main_~i~0_291, main_~n~0=v_main_~n~0_45} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,278 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:13,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:13,301 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:13,314 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:13,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_293 1) v_main_~n~0_46) InVars {main_~i~0=v_main_~i~0_293, main_~n~0=v_main_~n~0_46} OutVars{main_~i~0=v_main_~i~0_293, main_~n~0=v_main_~n~0_46} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,318 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:13,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:13,347 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:13,361 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:14,653 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:14,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1637983375] [2021-05-02 23:03:14,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1637983375] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:14,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:14,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:03:14,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741920957] [2021-05-02 23:03:14,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:03:14,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:03:14,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2304, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:03:14,655 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:17,186 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2021-05-02 23:03:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:03:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-05-02 23:03:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:17,194 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:03:17,195 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:03:17,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 2918.7ms TimeCoverageRelationStatistics Valid=379, Invalid=8551, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:03:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:03:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:03:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2021-05-02 23:03:17,199 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2021-05-02 23:03:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:17,200 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2021-05-02 23:03:17,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2021-05-02 23:03:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-02 23:03:17,200 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:17,200 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:17,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:03:17,200 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 793705068, now seen corresponding path program 21 times [2021-05-02 23:03:17,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:17,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327507034] [2021-05-02 23:03:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:17,206 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_316 v_main_~n~0_47) InVars {main_~i~0=v_main_~i~0_316, main_~n~0=v_main_~n~0_47} OutVars{main_~i~0=v_main_~i~0_316, main_~n~0=v_main_~n~0_47} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,207 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:17,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:17,236 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:17,252 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:17,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_318 1) v_main_~n~0_48) InVars {main_~i~0=v_main_~i~0_318, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_318, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,256 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:17,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:17,282 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:17,296 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:17,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:18,757 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:18,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327507034] [2021-05-02 23:03:18,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1327507034] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:18,758 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:18,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:03:18,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711851342] [2021-05-02 23:03:18,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:03:18,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:03:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2500, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:03:18,759 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:21,464 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2021-05-02 23:03:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:03:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2021-05-02 23:03:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:21,467 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:03:21,467 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:03:21,467 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 3161.2ms TimeCoverageRelationStatistics Valid=395, Invalid=9307, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:03:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:03:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:03:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2021-05-02 23:03:21,473 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2021-05-02 23:03:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:21,473 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2021-05-02 23:03:21,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2021-05-02 23:03:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:03:21,473 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:21,474 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:21,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:03:21,474 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -622060470, now seen corresponding path program 22 times [2021-05-02 23:03:21,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:21,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30155624] [2021-05-02 23:03:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:21,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_342 v_main_~n~0_49) InVars {main_~i~0=v_main_~i~0_342, main_~n~0=v_main_~n~0_49} OutVars{main_~i~0=v_main_~i~0_342, main_~n~0=v_main_~n~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:03:21,482 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:21,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:21,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:21,508 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:21,523 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:21,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_344 1) v_main_~n~0_50) InVars {main_~i~0=v_main_~i~0_344, main_~n~0=v_main_~n~0_50} OutVars{main_~i~0=v_main_~i~0_344, main_~n~0=v_main_~n~0_50} AuxVars[] AssignedVars[] [2021-05-02 23:03:21,533 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:21,543 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:21,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:21,563 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:21,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:21,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:23,055 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:23,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30155624] [2021-05-02 23:03:23,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [30155624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:23,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:23,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:03:23,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264534014] [2021-05-02 23:03:23,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:03:23,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:03:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2704, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:03:23,056 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:26,005 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2021-05-02 23:03:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:03:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:03:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:26,006 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:03:26,006 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:03:26,007 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 3386.1ms TimeCoverageRelationStatistics Valid=411, Invalid=10095, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:03:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:03:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:03:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2021-05-02 23:03:26,012 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2021-05-02 23:03:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:26,012 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2021-05-02 23:03:26,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2021-05-02 23:03:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-02 23:03:26,013 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:26,013 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:26,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:03:26,013 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash 331890344, now seen corresponding path program 23 times [2021-05-02 23:03:26,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:26,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029252597] [2021-05-02 23:03:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:26,019 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_369 v_main_~n~0_51) InVars {main_~i~0=v_main_~i~0_369, main_~n~0=v_main_~n~0_51} OutVars{main_~i~0=v_main_~i~0_369, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:03:26,021 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:26,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:26,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:26,047 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:26,061 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:26,063 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_371 1) v_main_~n~0_52) InVars {main_~i~0=v_main_~i~0_371, main_~n~0=v_main_~n~0_52} OutVars{main_~i~0=v_main_~i~0_371, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[] [2021-05-02 23:03:26,064 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:26,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:26,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:26,087 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:26,100 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:26,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:27,648 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:27,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029252597] [2021-05-02 23:03:27,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1029252597] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:27,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:27,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:03:27,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622042545] [2021-05-02 23:03:27,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:03:27,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:03:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2916, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:03:27,650 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:30,773 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2021-05-02 23:03:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:03:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-05-02 23:03:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:30,774 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:03:30,775 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:03:30,776 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 3563.2ms TimeCoverageRelationStatistics Valid=427, Invalid=10915, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:03:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:03:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:03:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2021-05-02 23:03:30,780 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2021-05-02 23:03:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:30,780 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2021-05-02 23:03:30,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2021-05-02 23:03:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-02 23:03:30,781 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:30,781 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:30,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 23:03:30,781 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2044378746, now seen corresponding path program 24 times [2021-05-02 23:03:30,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:30,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968503416] [2021-05-02 23:03:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:30,786 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_397 v_main_~n~0_53) InVars {main_~i~0=v_main_~i~0_397, main_~n~0=v_main_~n~0_53} OutVars{main_~i~0=v_main_~i~0_397, main_~n~0=v_main_~n~0_53} AuxVars[] AssignedVars[] [2021-05-02 23:03:30,787 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:30,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:30,810 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:30,824 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:30,826 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_399 1) v_main_~n~0_54) InVars {main_~i~0=v_main_~i~0_399, main_~n~0=v_main_~n~0_54} OutVars{main_~i~0=v_main_~i~0_399, main_~n~0=v_main_~n~0_54} AuxVars[] AssignedVars[] [2021-05-02 23:03:30,827 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:30,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:30,862 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:30,876 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:30,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:32,560 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:32,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968503416] [2021-05-02 23:03:32,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [968503416] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:32,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:32,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:03:32,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323314125] [2021-05-02 23:03:32,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:03:32,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:32,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:03:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3136, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:03:32,562 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:35,889 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2021-05-02 23:03:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:03:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-05-02 23:03:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:35,891 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:03:35,891 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:03:35,892 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 3831.2ms TimeCoverageRelationStatistics Valid=443, Invalid=11767, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:03:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:03:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:03:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2021-05-02 23:03:35,897 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2021-05-02 23:03:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:35,897 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2021-05-02 23:03:35,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2021-05-02 23:03:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:03:35,897 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:35,898 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:35,898 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:03:35,898 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -716372764, now seen corresponding path program 25 times [2021-05-02 23:03:35,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:35,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294785109] [2021-05-02 23:03:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:35,904 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_426 v_main_~n~0_55) InVars {main_~i~0=v_main_~i~0_426, main_~n~0=v_main_~n~0_55} OutVars{main_~i~0=v_main_~i~0_426, main_~n~0=v_main_~n~0_55} AuxVars[] AssignedVars[] [2021-05-02 23:03:35,905 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:35,906 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:35,929 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:35,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:35,944 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_428 1) v_main_~n~0_56) InVars {main_~i~0=v_main_~i~0_428, main_~n~0=v_main_~n~0_56} OutVars{main_~i~0=v_main_~i~0_428, main_~n~0=v_main_~n~0_56} AuxVars[] AssignedVars[] [2021-05-02 23:03:35,945 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:35,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:35,985 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:36,004 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:36,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:37,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:37,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294785109] [2021-05-02 23:03:37,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1294785109] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:37,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:37,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:03:37,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833220193] [2021-05-02 23:03:37,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:03:37,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:03:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3364, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:03:37,857 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:41,436 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-05-02 23:03:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:03:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:03:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:41,437 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:03:41,437 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:03:41,438 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 4163.9ms TimeCoverageRelationStatistics Valid=459, Invalid=12651, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:03:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:03:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:03:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2021-05-02 23:03:41,443 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2021-05-02 23:03:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:41,444 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2021-05-02 23:03:41,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2021-05-02 23:03:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-02 23:03:41,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:41,444 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:41,445 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:03:41,445 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash -107910974, now seen corresponding path program 26 times [2021-05-02 23:03:41,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:41,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026281322] [2021-05-02 23:03:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:41,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_456 v_main_~n~0_57) InVars {main_~i~0=v_main_~i~0_456, main_~n~0=v_main_~n~0_57} OutVars{main_~i~0=v_main_~i~0_456, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[] [2021-05-02 23:03:41,453 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:41,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:41,482 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:41,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:41,501 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_458 1) v_main_~n~0_58) InVars {main_~i~0=v_main_~i~0_458, main_~n~0=v_main_~n~0_58} OutVars{main_~i~0=v_main_~i~0_458, main_~n~0=v_main_~n~0_58} AuxVars[] AssignedVars[] [2021-05-02 23:03:41,505 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:41,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,522 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:41,534 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:41,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:43,594 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:43,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026281322] [2021-05-02 23:03:43,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1026281322] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:43,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:43,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:03:43,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886593652] [2021-05-02 23:03:43,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:03:43,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:03:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3600, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:03:43,595 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 60 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:47,403 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2021-05-02 23:03:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-02 23:03:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-05-02 23:03:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:47,404 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:03:47,404 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:03:47,405 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 4483.0ms TimeCoverageRelationStatistics Valid=475, Invalid=13567, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:03:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:03:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:03:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2021-05-02 23:03:47,409 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2021-05-02 23:03:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:47,409 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2021-05-02 23:03:47,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2021-05-02 23:03:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 23:03:47,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:47,410 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:47,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:03:47,410 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 508316960, now seen corresponding path program 27 times [2021-05-02 23:03:47,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:47,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706586876] [2021-05-02 23:03:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:47,422 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_487 v_main_~n~0_59) InVars {main_~i~0=v_main_~i~0_487, main_~n~0=v_main_~n~0_59} OutVars{main_~i~0=v_main_~i~0_487, main_~n~0=v_main_~n~0_59} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,434 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:47,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:47,481 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:47,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:47,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_489 1) v_main_~n~0_60) InVars {main_~i~0=v_main_~i~0_489, main_~n~0=v_main_~n~0_60} OutVars{main_~i~0=v_main_~i~0_489, main_~n~0=v_main_~n~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,505 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:47,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:47,535 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:47,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:47,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:49,713 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:49,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706586876] [2021-05-02 23:03:49,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [706586876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:49,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:49,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:03:49,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412861142] [2021-05-02 23:03:49,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:03:49,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:03:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3844, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:03:49,714 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 62 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:53,785 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-05-02 23:03:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-02 23:03:53,786 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 23:03:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:53,786 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:03:53,786 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:03:53,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 4784.2ms TimeCoverageRelationStatistics Valid=491, Invalid=14515, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:03:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:03:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:03:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2021-05-02 23:03:53,792 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2021-05-02 23:03:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:53,792 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2021-05-02 23:03:53,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2021-05-02 23:03:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:03:53,793 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:53,793 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:53,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:03:53,793 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2125314, now seen corresponding path program 28 times [2021-05-02 23:03:53,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:53,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [671748271] [2021-05-02 23:03:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:53,799 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_519 v_main_~n~0_61) InVars {main_~i~0=v_main_~i~0_519, main_~n~0=v_main_~n~0_61} OutVars{main_~i~0=v_main_~i~0_519, main_~n~0=v_main_~n~0_61} AuxVars[] AssignedVars[] [2021-05-02 23:03:53,801 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:03:53,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:53,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:03:53,824 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:03:53,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:53,851 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_521 1) v_main_~n~0_62) InVars {main_~i~0=v_main_~i~0_521, main_~n~0=v_main_~n~0_62} OutVars{main_~i~0=v_main_~i~0_521, main_~n~0=v_main_~n~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:03:53,853 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:03:53,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:53,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:03:53,885 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:03:53,904 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:53,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:56,085 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:56,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [671748271] [2021-05-02 23:03:56,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [671748271] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:56,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:56,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:03:56,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803577997] [2021-05-02 23:03:56,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:03:56,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:03:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4096, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:03:56,086 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 64 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:00,503 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2021-05-02 23:04:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-02 23:04:00,504 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:04:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:00,504 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:04:00,504 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:04:00,505 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 5040.7ms TimeCoverageRelationStatistics Valid=507, Invalid=15495, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:04:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:04:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-02 23:04:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2021-05-02 23:04:00,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2021-05-02 23:04:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:00,510 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2021-05-02 23:04:00,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2021-05-02 23:04:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-02 23:04:00,510 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:00,510 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:00,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:04:00,511 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash -910878884, now seen corresponding path program 29 times [2021-05-02 23:04:00,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:00,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242808895] [2021-05-02 23:04:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:00,525 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_552 v_main_~n~0_63) InVars {main_~i~0=v_main_~i~0_552, main_~n~0=v_main_~n~0_63} OutVars{main_~i~0=v_main_~i~0_552, main_~n~0=v_main_~n~0_63} AuxVars[] AssignedVars[] [2021-05-02 23:04:00,526 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:00,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:00,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:00,551 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:00,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:00,566 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_554 1) v_main_~n~0_64) InVars {main_~i~0=v_main_~i~0_554, main_~n~0=v_main_~n~0_64} OutVars{main_~i~0=v_main_~i~0_554, main_~n~0=v_main_~n~0_64} AuxVars[] AssignedVars[] [2021-05-02 23:04:00,567 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:00,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:00,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:00,590 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:00,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:00,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:03,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:03,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242808895] [2021-05-02 23:04:03,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [242808895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:03,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:03,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:04:03,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430767677] [2021-05-02 23:04:03,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:04:03,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:04:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=4356, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:04:03,017 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 66 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 64 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:07,681 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2021-05-02 23:04:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-02 23:04:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 64 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2021-05-02 23:04:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:07,683 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:04:07,683 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:04:07,684 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2498 ImplicationChecksByTransitivity, 5365.8ms TimeCoverageRelationStatistics Valid=523, Invalid=16507, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:04:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:04:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-02 23:04:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2021-05-02 23:04:07,690 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2021-05-02 23:04:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:07,690 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2021-05-02 23:04:07,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 64 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2021-05-02 23:04:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-02 23:04:07,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:07,691 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:07,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 23:04:07,691 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1950268730, now seen corresponding path program 30 times [2021-05-02 23:04:07,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:07,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586105292] [2021-05-02 23:04:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:07,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_586 v_main_~n~0_65) InVars {main_~i~0=v_main_~i~0_586, main_~n~0=v_main_~n~0_65} OutVars{main_~i~0=v_main_~i~0_586, main_~n~0=v_main_~n~0_65} AuxVars[] AssignedVars[] [2021-05-02 23:04:07,700 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:07,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:07,707 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:07,727 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:07,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:07,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_588 1) v_main_~n~0_66) InVars {main_~i~0=v_main_~i~0_588, main_~n~0=v_main_~n~0_66} OutVars{main_~i~0=v_main_~i~0_588, main_~n~0=v_main_~n~0_66} AuxVars[] AssignedVars[] [2021-05-02 23:04:07,744 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:07,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:07,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:07,769 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:07,784 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:07,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:10,356 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:10,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586105292] [2021-05-02 23:04:10,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586105292] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:10,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:10,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:04:10,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591832145] [2021-05-02 23:04:10,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:04:10,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:04:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4624, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:04:10,358 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 68 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:15,244 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2021-05-02 23:04:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-02 23:04:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-05-02 23:04:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:15,245 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:04:15,245 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:04:15,246 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2643 ImplicationChecksByTransitivity, 5669.6ms TimeCoverageRelationStatistics Valid=539, Invalid=17551, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 23:04:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:04:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:04:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2021-05-02 23:04:15,252 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2021-05-02 23:04:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:15,252 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2021-05-02 23:04:15,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2021-05-02 23:04:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:04:15,253 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:15,253 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:15,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:04:15,253 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1560910952, now seen corresponding path program 31 times [2021-05-02 23:04:15,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:15,254 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870902161] [2021-05-02 23:04:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:15,259 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_621 v_main_~n~0_67) InVars {main_~i~0=v_main_~i~0_621, main_~n~0=v_main_~n~0_67} OutVars{main_~i~0=v_main_~i~0_621, main_~n~0=v_main_~n~0_67} AuxVars[] AssignedVars[] [2021-05-02 23:04:15,261 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:15,272 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:15,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:15,286 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:15,301 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:15,310 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_623 1) v_main_~n~0_68) InVars {main_~i~0=v_main_~i~0_623, main_~n~0=v_main_~n~0_68} OutVars{main_~i~0=v_main_~i~0_623, main_~n~0=v_main_~n~0_68} AuxVars[] AssignedVars[] [2021-05-02 23:04:15,311 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:15,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:15,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:15,334 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:15,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:15,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:18,008 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:18,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1870902161] [2021-05-02 23:04:18,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1870902161] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:18,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:18,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:04:18,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742239469] [2021-05-02 23:04:18,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:04:18,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:04:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=4900, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:04:18,010 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 70 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:23,383 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2021-05-02 23:04:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-02 23:04:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-02 23:04:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:23,384 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:04:23,384 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:04:23,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2792 ImplicationChecksByTransitivity, 6077.5ms TimeCoverageRelationStatistics Valid=555, Invalid=18627, Unknown=0, NotChecked=0, Total=19182 [2021-05-02 23:04:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:04:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:04:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2021-05-02 23:04:23,390 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2021-05-02 23:04:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:23,390 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2021-05-02 23:04:23,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2021-05-02 23:04:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-02 23:04:23,390 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:23,390 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:23,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:04:23,390 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 39709302, now seen corresponding path program 32 times [2021-05-02 23:04:23,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:23,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990746236] [2021-05-02 23:04:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:23,395 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_657 v_main_~n~0_69) InVars {main_~i~0=v_main_~i~0_657, main_~n~0=v_main_~n~0_69} OutVars{main_~i~0=v_main_~i~0_657, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[] [2021-05-02 23:04:23,397 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:23,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:23,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:23,425 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:23,453 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:23,455 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_659 1) v_main_~n~0_70) InVars {main_~i~0=v_main_~i~0_659, main_~n~0=v_main_~n~0_70} OutVars{main_~i~0=v_main_~i~0_659, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[] [2021-05-02 23:04:23,457 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:23,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:23,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:23,489 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:23,508 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:23,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:26,494 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:26,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990746236] [2021-05-02 23:04:26,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990746236] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:26,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:26,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-02 23:04:26,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729040728] [2021-05-02 23:04:26,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-02 23:04:26,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-02 23:04:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=5184, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:04:26,495 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 72 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:32,212 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2021-05-02 23:04:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-02 23:04:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2021-05-02 23:04:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:32,214 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:04:32,214 INFO L226 Difference]: Without dead ends: 79 [2021-05-02 23:04:32,215 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 6640.4ms TimeCoverageRelationStatistics Valid=571, Invalid=19735, Unknown=0, NotChecked=0, Total=20306 [2021-05-02 23:04:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-02 23:04:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-02 23:04:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2021-05-02 23:04:32,221 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2021-05-02 23:04:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:32,222 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2021-05-02 23:04:32,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2021-05-02 23:04:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 23:04:32,222 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:32,222 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:32,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:04:32,223 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 637481428, now seen corresponding path program 33 times [2021-05-02 23:04:32,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:32,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908446338] [2021-05-02 23:04:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:32,232 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_694 v_main_~n~0_71) InVars {main_~i~0=v_main_~i~0_694, main_~n~0=v_main_~n~0_71} OutVars{main_~i~0=v_main_~i~0_694, main_~n~0=v_main_~n~0_71} AuxVars[] AssignedVars[] [2021-05-02 23:04:32,235 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:32,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:32,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:32,265 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:32,281 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:32,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_696 1) v_main_~n~0_72) InVars {main_~i~0=v_main_~i~0_696, main_~n~0=v_main_~n~0_72} OutVars{main_~i~0=v_main_~i~0_696, main_~n~0=v_main_~n~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:04:32,285 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:32,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:32,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:32,324 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:32,345 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:32,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:35,453 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:35,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908446338] [2021-05-02 23:04:35,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [908446338] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:35,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:35,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-02 23:04:35,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354018037] [2021-05-02 23:04:35,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-02 23:04:35,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-02 23:04:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=5476, Unknown=0, NotChecked=0, Total=5700 [2021-05-02 23:04:35,454 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 74 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:41,554 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2021-05-02 23:04:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-02 23:04:41,555 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 23:04:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:41,555 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:04:41,556 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:04:41,557 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3102 ImplicationChecksByTransitivity, 6993.3ms TimeCoverageRelationStatistics Valid=587, Invalid=20875, Unknown=0, NotChecked=0, Total=21462 [2021-05-02 23:04:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:04:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:04:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2021-05-02 23:04:41,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2021-05-02 23:04:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2021-05-02 23:04:41,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2021-05-02 23:04:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 23:04:41,564 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:41,564 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:41,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 23:04:41,564 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -429123150, now seen corresponding path program 34 times [2021-05-02 23:04:41,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:41,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421853042] [2021-05-02 23:04:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:41,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_732 v_main_~n~0_73) InVars {main_~i~0=v_main_~i~0_732, main_~n~0=v_main_~n~0_73} OutVars{main_~i~0=v_main_~i~0_732, main_~n~0=v_main_~n~0_73} AuxVars[] AssignedVars[] [2021-05-02 23:04:41,574 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:41,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:41,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:41,604 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:41,620 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:41,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_734 1) v_main_~n~0_74) InVars {main_~i~0=v_main_~i~0_734, main_~n~0=v_main_~n~0_74} OutVars{main_~i~0=v_main_~i~0_734, main_~n~0=v_main_~n~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:04:41,625 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:41,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:41,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:41,651 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:41,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:41,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:45,068 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:45,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421853042] [2021-05-02 23:04:45,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [421853042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:45,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:45,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-02 23:04:45,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987432890] [2021-05-02 23:04:45,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-02 23:04:45,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-02 23:04:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5776, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:04:45,069 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand has 76 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 74 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:51,706 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2021-05-02 23:04:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-02 23:04:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 74 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 23:04:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:51,707 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:04:51,707 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:04:51,708 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3263 ImplicationChecksByTransitivity, 7617.8ms TimeCoverageRelationStatistics Valid=603, Invalid=22047, Unknown=0, NotChecked=0, Total=22650 [2021-05-02 23:04:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:04:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:04:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2021-05-02 23:04:51,714 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2021-05-02 23:04:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:51,714 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2021-05-02 23:04:51,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 74 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2021-05-02 23:04:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-02 23:04:51,715 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:51,715 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:51,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:04:51,715 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1061061136, now seen corresponding path program 35 times [2021-05-02 23:04:51,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:51,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728265111] [2021-05-02 23:04:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:51,722 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_771 v_main_~n~0_75) InVars {main_~i~0=v_main_~i~0_771, main_~n~0=v_main_~n~0_75} OutVars{main_~i~0=v_main_~i~0_771, main_~n~0=v_main_~n~0_75} AuxVars[] AssignedVars[] [2021-05-02 23:04:51,723 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:04:51,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:51,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:04:51,749 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:04:51,766 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:51,767 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_773 1) v_main_~n~0_76) InVars {main_~i~0=v_main_~i~0_773, main_~n~0=v_main_~n~0_76} OutVars{main_~i~0=v_main_~i~0_773, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[] [2021-05-02 23:04:51,769 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:04:51,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:51,775 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:04:51,796 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:04:51,812 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:04:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:51,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:55,350 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:55,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728265111] [2021-05-02 23:04:55,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1728265111] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:55,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:55,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-02 23:04:55,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594732908] [2021-05-02 23:04:55,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-02 23:04:55,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-02 23:04:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=6084, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 23:04:55,352 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 76 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:02,425 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2021-05-02 23:05:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-02 23:05:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 76 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2021-05-02 23:05:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:02,427 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:05:02,427 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:05:02,428 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 8024.1ms TimeCoverageRelationStatistics Valid=619, Invalid=23251, Unknown=0, NotChecked=0, Total=23870 [2021-05-02 23:05:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:05:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:05:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2021-05-02 23:05:02,433 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2021-05-02 23:05:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:02,433 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2021-05-02 23:05:02,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 76 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2021-05-02 23:05:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-05-02 23:05:02,433 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:02,434 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:02,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-02 23:05:02,434 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1390916882, now seen corresponding path program 36 times [2021-05-02 23:05:02,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:02,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100395145] [2021-05-02 23:05:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:02,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_811 v_main_~n~0_77) InVars {main_~i~0=v_main_~i~0_811, main_~n~0=v_main_~n~0_77} OutVars{main_~i~0=v_main_~i~0_811, main_~n~0=v_main_~n~0_77} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,445 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:05:02,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:05:02,472 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:05:02,488 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:02,490 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_813 1) v_main_~n~0_78) InVars {main_~i~0=v_main_~i~0_813, main_~n~0=v_main_~n~0_78} OutVars{main_~i~0=v_main_~i~0_813, main_~n~0=v_main_~n~0_78} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,492 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:05:02,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:05:02,518 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:05:02,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:02,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:06,364 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:06,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100395145] [2021-05-02 23:05:06,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [100395145] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:06,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:06,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-02 23:05:06,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038566663] [2021-05-02 23:05:06,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-02 23:05:06,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-02 23:05:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=6400, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 23:05:06,366 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:14,178 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2021-05-02 23:05:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-02 23:05:14,178 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2021-05-02 23:05:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:14,179 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:05:14,179 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:05:14,180 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3597 ImplicationChecksByTransitivity, 8735.0ms TimeCoverageRelationStatistics Valid=635, Invalid=24487, Unknown=0, NotChecked=0, Total=25122 [2021-05-02 23:05:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:05:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:05:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2021-05-02 23:05:14,187 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2021-05-02 23:05:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:14,188 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2021-05-02 23:05:14,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2021-05-02 23:05:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-02 23:05:14,188 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:14,188 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:14,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:05:14,189 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 195253324, now seen corresponding path program 37 times [2021-05-02 23:05:14,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:14,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430197291] [2021-05-02 23:05:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:14,195 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_852 v_main_~n~0_79) InVars {main_~i~0=v_main_~i~0_852, main_~n~0=v_main_~n~0_79} OutVars{main_~i~0=v_main_~i~0_852, main_~n~0=v_main_~n~0_79} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,196 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:05:14,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:05:14,225 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:05:14,242 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:14,244 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_854 1) v_main_~n~0_80) InVars {main_~i~0=v_main_~i~0_854, main_~n~0=v_main_~n~0_80} OutVars{main_~i~0=v_main_~i~0_854, main_~n~0=v_main_~n~0_80} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,247 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:05:14,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:05:14,276 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:05:14,293 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:14,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:18,459 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:18,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430197291] [2021-05-02 23:05:18,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [430197291] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:18,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:18,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-02 23:05:18,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761428586] [2021-05-02 23:05:18,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-02 23:05:18,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:18,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-02 23:05:18,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=6724, Unknown=0, NotChecked=0, Total=6972 [2021-05-02 23:05:18,461 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 82 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 80 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:27,010 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2021-05-02 23:05:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-02 23:05:27,011 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 80 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-05-02 23:05:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:27,012 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:05:27,012 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:05:27,013 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3770 ImplicationChecksByTransitivity, 9534.3ms TimeCoverageRelationStatistics Valid=651, Invalid=25755, Unknown=0, NotChecked=0, Total=26406 [2021-05-02 23:05:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:05:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:05:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2021-05-02 23:05:27,021 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2021-05-02 23:05:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:27,021 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2021-05-02 23:05:27,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 80 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2021-05-02 23:05:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-05-02 23:05:27,022 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:27,022 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:27,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-02 23:05:27,022 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -208568790, now seen corresponding path program 38 times [2021-05-02 23:05:27,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:27,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642641427] [2021-05-02 23:05:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:27,030 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_894 v_main_~n~0_81) InVars {main_~i~0=v_main_~i~0_894, main_~n~0=v_main_~n~0_81} OutVars{main_~i~0=v_main_~i~0_894, main_~n~0=v_main_~n~0_81} AuxVars[] AssignedVars[] [2021-05-02 23:05:27,034 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:05:27,035 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:27,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:05:27,072 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:05:27,095 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:27,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_896 1) v_main_~n~0_82) InVars {main_~i~0=v_main_~i~0_896, main_~n~0=v_main_~n~0_82} OutVars{main_~i~0=v_main_~i~0_896, main_~n~0=v_main_~n~0_82} AuxVars[] AssignedVars[] [2021-05-02 23:05:27,099 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:05:27,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:27,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:05:27,129 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:05:27,148 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:27,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:31,797 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:31,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642641427] [2021-05-02 23:05:31,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [642641427] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:31,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:31,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-02 23:05:31,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524555096] [2021-05-02 23:05:31,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-02 23:05:31,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-02 23:05:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=7056, Unknown=0, NotChecked=0, Total=7310 [2021-05-02 23:05:31,799 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 84 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:41,446 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2021-05-02 23:05:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-02 23:05:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2021-05-02 23:05:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:41,447 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:05:41,447 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:05:41,448 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 10712.9ms TimeCoverageRelationStatistics Valid=667, Invalid=27055, Unknown=0, NotChecked=0, Total=27722 [2021-05-02 23:05:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:05:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:05:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2021-05-02 23:05:41,454 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2021-05-02 23:05:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:41,454 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2021-05-02 23:05:41,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2021-05-02 23:05:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-05-02 23:05:41,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:41,455 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:41,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:05:41,455 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1734563704, now seen corresponding path program 39 times [2021-05-02 23:05:41,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:41,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284455682] [2021-05-02 23:05:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:41,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_937 v_main_~n~0_83) InVars {main_~i~0=v_main_~i~0_937, main_~n~0=v_main_~n~0_83} OutVars{main_~i~0=v_main_~i~0_937, main_~n~0=v_main_~n~0_83} AuxVars[] AssignedVars[] [2021-05-02 23:05:41,464 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:05:41,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:41,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:05:41,496 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:05:41,515 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:41,517 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_939 1) v_main_~n~0_84) InVars {main_~i~0=v_main_~i~0_939, main_~n~0=v_main_~n~0_84} OutVars{main_~i~0=v_main_~i~0_939, main_~n~0=v_main_~n~0_84} AuxVars[] AssignedVars[] [2021-05-02 23:05:41,519 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:05:41,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:41,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:05:41,551 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:05:41,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:41,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:46,759 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:46,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284455682] [2021-05-02 23:05:46,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1284455682] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:46,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:46,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-02 23:05:46,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38889721] [2021-05-02 23:05:46,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-02 23:05:46,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-02 23:05:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=7396, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:05:46,761 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 86 states, 85 states have (on average 1.011764705882353) internal successors, (86), 84 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:57,705 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2021-05-02 23:05:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-02 23:05:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.011764705882353) internal successors, (86), 84 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2021-05-02 23:05:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:57,707 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:05:57,707 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:05:57,708 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4128 ImplicationChecksByTransitivity, 11958.2ms TimeCoverageRelationStatistics Valid=683, Invalid=28387, Unknown=0, NotChecked=0, Total=29070 [2021-05-02 23:05:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:05:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:05:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2021-05-02 23:05:57,714 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2021-05-02 23:05:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:57,714 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2021-05-02 23:05:57,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 85 states have (on average 1.011764705882353) internal successors, (86), 84 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2021-05-02 23:05:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-02 23:05:57,714 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:57,715 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:57,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-02 23:05:57,715 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 663139174, now seen corresponding path program 40 times [2021-05-02 23:05:57,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:57,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411134813] [2021-05-02 23:05:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:57,722 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_981 v_main_~n~0_85) InVars {main_~i~0=v_main_~i~0_981, main_~n~0=v_main_~n~0_85} OutVars{main_~i~0=v_main_~i~0_981, main_~n~0=v_main_~n~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:05:57,724 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:05:57,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:57,733 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:05:57,761 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:05:57,784 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:57,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_983 1) v_main_~n~0_86) InVars {main_~i~0=v_main_~i~0_983, main_~n~0=v_main_~n~0_86} OutVars{main_~i~0=v_main_~i~0_983, main_~n~0=v_main_~n~0_86} AuxVars[] AssignedVars[] [2021-05-02 23:05:57,791 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:05:57,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:57,800 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:05:57,828 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:05:57,852 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:05:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:57,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:06:04,213 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:04,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411134813] [2021-05-02 23:06:04,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1411134813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:04,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:04,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-02 23:06:04,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446866092] [2021-05-02 23:06:04,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-02 23:06:04,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-02 23:06:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=7744, Unknown=0, NotChecked=0, Total=8010 [2021-05-02 23:06:04,215 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 88 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 86 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:17,261 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2021-05-02 23:06:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-02 23:06:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 86 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2021-05-02 23:06:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:17,263 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:06:17,263 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:06:17,264 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 14347.1ms TimeCoverageRelationStatistics Valid=699, Invalid=29751, Unknown=0, NotChecked=0, Total=30450 [2021-05-02 23:06:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:06:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:06:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2021-05-02 23:06:17,271 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2021-05-02 23:06:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:17,271 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2021-05-02 23:06:17,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 86 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2021-05-02 23:06:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-05-02 23:06:17,272 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:17,272 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:17,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:06:17,272 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1541833020, now seen corresponding path program 41 times [2021-05-02 23:06:17,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:17,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274987965] [2021-05-02 23:06:17,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:17,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1026 v_main_~n~0_87) InVars {main_~i~0=v_main_~i~0_1026, main_~n~0=v_main_~n~0_87} OutVars{main_~i~0=v_main_~i~0_1026, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:06:17,283 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:06:17,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:17,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:06:17,320 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:06:17,343 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:06:17,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1028 1) v_main_~n~0_88) InVars {main_~i~0=v_main_~i~0_1028, main_~n~0=v_main_~n~0_88} OutVars{main_~i~0=v_main_~i~0_1028, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[] [2021-05-02 23:06:17,347 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:06:17,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:17,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:06:17,384 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:06:17,409 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:06:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:17,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:06:23,870 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:23,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274987965] [2021-05-02 23:06:23,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [274987965] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:23,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:23,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-02 23:06:23,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471245222] [2021-05-02 23:06:23,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-02 23:06:23,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-02 23:06:23,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=8100, Unknown=0, NotChecked=0, Total=8372 [2021-05-02 23:06:23,872 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 90 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 88 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:37,394 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2021-05-02 23:06:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-05-02 23:06:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 88 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2021-05-02 23:06:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:37,396 INFO L225 Difference]: With dead ends: 102 [2021-05-02 23:06:37,396 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:06:37,397 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4502 ImplicationChecksByTransitivity, 14652.9ms TimeCoverageRelationStatistics Valid=715, Invalid=31147, Unknown=0, NotChecked=0, Total=31862 [2021-05-02 23:06:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:06:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:06:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2021-05-02 23:06:37,405 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2021-05-02 23:06:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:37,405 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2021-05-02 23:06:37,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 88 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2021-05-02 23:06:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-05-02 23:06:37,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:37,406 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:37,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-02 23:06:37,406 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1193732770, now seen corresponding path program 42 times [2021-05-02 23:06:37,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:37,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793844656] [2021-05-02 23:06:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:37,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1072 v_main_~n~0_89) InVars {main_~i~0=v_main_~i~0_1072, main_~n~0=v_main_~n~0_89} OutVars{main_~i~0=v_main_~i~0_1072, main_~n~0=v_main_~n~0_89} AuxVars[] AssignedVars[] [2021-05-02 23:06:37,422 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:06:37,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:37,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:06:37,465 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:06:37,490 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:06:37,493 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1074 1) v_main_~n~0_90) InVars {main_~i~0=v_main_~i~0_1074, main_~n~0=v_main_~n~0_90} OutVars{main_~i~0=v_main_~i~0_1074, main_~n~0=v_main_~n~0_90} AuxVars[] AssignedVars[] [2021-05-02 23:06:37,494 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:06:37,496 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:37,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:06:37,534 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:06:37,560 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:06:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:37,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:06:45,374 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:45,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793844656] [2021-05-02 23:06:45,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1793844656] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:45,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:45,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2021-05-02 23:06:45,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365743548] [2021-05-02 23:06:45,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2021-05-02 23:06:45,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-05-02 23:06:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=8464, Unknown=0, NotChecked=0, Total=8742 [2021-05-02 23:06:45,376 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand has 92 states, 91 states have (on average 1.010989010989011) internal successors, (92), 90 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:01,900 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2021-05-02 23:07:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-05-02 23:07:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 91 states have (on average 1.010989010989011) internal successors, (92), 90 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2021-05-02 23:07:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:01,903 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:07:01,903 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:07:01,904 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4695 ImplicationChecksByTransitivity, 17783.6ms TimeCoverageRelationStatistics Valid=731, Invalid=32575, Unknown=0, NotChecked=0, Total=33306 [2021-05-02 23:07:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:07:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:07:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2021-05-02 23:07:01,910 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2021-05-02 23:07:01,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:01,911 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2021-05-02 23:07:01,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 92 states, 91 states have (on average 1.010989010989011) internal successors, (92), 90 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2021-05-02 23:07:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:07:01,911 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:01,911 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:01,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:07:01,912 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1552471808, now seen corresponding path program 43 times [2021-05-02 23:07:01,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:01,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076105843] [2021-05-02 23:07:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:01,921 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1119 v_main_~n~0_91) InVars {main_~i~0=v_main_~i~0_1119, main_~n~0=v_main_~n~0_91} OutVars{main_~i~0=v_main_~i~0_1119, main_~n~0=v_main_~n~0_91} AuxVars[] AssignedVars[] [2021-05-02 23:07:01,923 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:07:01,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:01,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:07:01,972 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:07:02,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:07:02,007 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1121 1) v_main_~n~0_92) InVars {main_~i~0=v_main_~i~0_1121, main_~n~0=v_main_~n~0_92} OutVars{main_~i~0=v_main_~i~0_1121, main_~n~0=v_main_~n~0_92} AuxVars[] AssignedVars[] [2021-05-02 23:07:02,009 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:07:02,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:02,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:07:02,058 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:07:02,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:07:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:02,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:07:11,257 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:11,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076105843] [2021-05-02 23:07:11,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076105843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:11,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:11,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-02 23:07:11,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261535730] [2021-05-02 23:07:11,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-02 23:07:11,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-02 23:07:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=8836, Unknown=0, NotChecked=0, Total=9120 [2021-05-02 23:07:11,259 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 94 states, 93 states have (on average 1.010752688172043) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:28,935 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2021-05-02 23:07:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-05-02 23:07:28,936 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 1.010752688172043) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-02 23:07:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:28,937 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:07:28,937 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:07:28,938 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4892 ImplicationChecksByTransitivity, 19798.0ms TimeCoverageRelationStatistics Valid=747, Invalid=34035, Unknown=0, NotChecked=0, Total=34782 [2021-05-02 23:07:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:07:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-02 23:07:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2021-05-02 23:07:28,945 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2021-05-02 23:07:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:28,945 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2021-05-02 23:07:28,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 93 states have (on average 1.010752688172043) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2021-05-02 23:07:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-05-02 23:07:28,946 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:28,946 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:28,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-02 23:07:28,946 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1591663650, now seen corresponding path program 44 times [2021-05-02 23:07:28,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:28,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829444582] [2021-05-02 23:07:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:28,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1167 v_main_~n~0_93) InVars {main_~i~0=v_main_~i~0_1167, main_~n~0=v_main_~n~0_93} OutVars{main_~i~0=v_main_~i~0_1167, main_~n~0=v_main_~n~0_93} AuxVars[] AssignedVars[] [2021-05-02 23:07:28,963 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:07:28,981 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:28,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:07:29,010 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:07:29,046 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:07:29,050 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1169 1) v_main_~n~0_94) InVars {main_~i~0=v_main_~i~0_1169, main_~n~0=v_main_~n~0_94} OutVars{main_~i~0=v_main_~i~0_1169, main_~n~0=v_main_~n~0_94} AuxVars[] AssignedVars[] [2021-05-02 23:07:29,052 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:07:29,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:29,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:07:29,106 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:07:29,135 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:07:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:29,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:07:38,881 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:38,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829444582] [2021-05-02 23:07:38,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [829444582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:38,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:38,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-02 23:07:38,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139671395] [2021-05-02 23:07:38,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-02 23:07:38,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-02 23:07:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=9216, Unknown=0, NotChecked=0, Total=9506 [2021-05-02 23:07:38,883 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 94 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:00,786 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2021-05-02 23:08:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-05-02 23:08:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 94 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2021-05-02 23:08:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:00,789 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:08:00,789 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:08:00,791 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5093 ImplicationChecksByTransitivity, 22746.0ms TimeCoverageRelationStatistics Valid=763, Invalid=35527, Unknown=0, NotChecked=0, Total=36290 [2021-05-02 23:08:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:08:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-02 23:08:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2021-05-02 23:08:00,800 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2021-05-02 23:08:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2021-05-02 23:08:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 94 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2021-05-02 23:08:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-05-02 23:08:00,801 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:00,802 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:00,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:08:00,802 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 551137596, now seen corresponding path program 45 times [2021-05-02 23:08:00,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:00,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684401015] [2021-05-02 23:08:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:00,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1216 v_main_~n~0_95) InVars {main_~i~0=v_main_~i~0_1216, main_~n~0=v_main_~n~0_95} OutVars{main_~i~0=v_main_~i~0_1216, main_~n~0=v_main_~n~0_95} AuxVars[] AssignedVars[] [2021-05-02 23:08:00,821 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:08:00,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:00,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:08:00,897 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:08:00,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:08:00,955 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1218 1) v_main_~n~0_96) InVars {main_~i~0=v_main_~i~0_1218, main_~n~0=v_main_~n~0_96} OutVars{main_~i~0=v_main_~i~0_1218, main_~n~0=v_main_~n~0_96} AuxVars[] AssignedVars[] [2021-05-02 23:08:00,957 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:08:00,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:01,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:08:01,034 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:08:01,078 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:08:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:01,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:08:14,741 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:14,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684401015] [2021-05-02 23:08:14,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [684401015] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:14,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:14,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2021-05-02 23:08:14,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805975431] [2021-05-02 23:08:14,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2021-05-02 23:08:14,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:14,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-05-02 23:08:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=9604, Unknown=0, NotChecked=0, Total=9900 [2021-05-02 23:08:14,743 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 98 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:40,437 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-05-02 23:08:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:41,044 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2021-05-02 23:08:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-05-02 23:08:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2021-05-02 23:08:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:41,047 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:08:41,047 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:08:41,049 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5298 ImplicationChecksByTransitivity, 29103.1ms TimeCoverageRelationStatistics Valid=779, Invalid=37051, Unknown=0, NotChecked=0, Total=37830 [2021-05-02 23:08:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:08:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:08:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2021-05-02 23:08:41,058 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2021-05-02 23:08:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:41,058 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2021-05-02 23:08:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 98 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2021-05-02 23:08:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 23:08:41,059 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:41,059 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:41,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-02 23:08:41,059 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1801167078, now seen corresponding path program 46 times [2021-05-02 23:08:41,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:41,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476360089] [2021-05-02 23:08:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:41,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1266 v_main_~n~0_97) InVars {main_~i~0=v_main_~i~0_1266, main_~n~0=v_main_~n~0_97} OutVars{main_~i~0=v_main_~i~0_1266, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[] [2021-05-02 23:08:41,076 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:08:41,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:41,091 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:08:41,151 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:08:41,211 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:08:41,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1268 1) v_main_~n~0_98) InVars {main_~i~0=v_main_~i~0_1268, main_~n~0=v_main_~n~0_98} OutVars{main_~i~0=v_main_~i~0_1268, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[] [2021-05-02 23:08:41,220 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:08:41,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:41,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:08:41,293 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:08:41,352 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:08:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:41,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:08:55,629 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:55,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476360089] [2021-05-02 23:08:55,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [476360089] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:55,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:55,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [100] imperfect sequences [] total 100 [2021-05-02 23:08:55,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812103851] [2021-05-02 23:08:55,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2021-05-02 23:08:55,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2021-05-02 23:08:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=10000, Unknown=0, NotChecked=0, Total=10302 [2021-05-02 23:08:55,632 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:26,654 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-05-02 23:09:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:09:27,500 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2021-05-02 23:09:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-05-02 23:09:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-02 23:09:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:09:27,504 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:09:27,504 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:09:27,507 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 32897.9ms TimeCoverageRelationStatistics Valid=795, Invalid=38607, Unknown=0, NotChecked=0, Total=39402 [2021-05-02 23:09:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:09:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-02 23:09:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2021-05-02 23:09:27,517 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2021-05-02 23:09:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:09:27,517 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2021-05-02 23:09:27,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2021-05-02 23:09:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-05-02 23:09:27,518 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:09:27,518 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:09:27,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:09:27,518 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:09:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:09:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1081806200, now seen corresponding path program 47 times [2021-05-02 23:09:27,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:09:27,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1800868179] [2021-05-02 23:09:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:09:27,531 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1317 v_main_~n~0_99) InVars {main_~i~0=v_main_~i~0_1317, main_~n~0=v_main_~n~0_99} OutVars{main_~i~0=v_main_~i~0_1317, main_~n~0=v_main_~n~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:09:27,534 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:09:27,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:27,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:09:27,636 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:09:27,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:09:27,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1319 1) v_main_~n~0_100) InVars {main_~i~0=v_main_~i~0_1319, main_~n~0=v_main_~n~0_100} OutVars{main_~i~0=v_main_~i~0_1319, main_~n~0=v_main_~n~0_100} AuxVars[] AssignedVars[] [2021-05-02 23:09:27,703 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:09:27,734 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:27,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:09:27,778 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:09:27,835 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:09:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:28,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:09:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:09:45,228 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:09:45,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1800868179] [2021-05-02 23:09:45,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1800868179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:09:45,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:09:45,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2021-05-02 23:09:45,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796782657] [2021-05-02 23:09:45,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2021-05-02 23:09:45,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:09:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-05-02 23:09:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=10404, Unknown=0, NotChecked=0, Total=10712 [2021-05-02 23:09:45,230 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:46,442 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2021-05-02 23:10:23,227 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-05-02 23:10:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:10:24,189 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2021-05-02 23:10:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-05-02 23:10:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2021-05-02 23:10:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:10:24,193 INFO L225 Difference]: With dead ends: 114 [2021-05-02 23:10:24,193 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:10:24,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 39904.3ms TimeCoverageRelationStatistics Valid=811, Invalid=40195, Unknown=0, NotChecked=0, Total=41006 [2021-05-02 23:10:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:10:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-02 23:10:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:10:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2021-05-02 23:10:24,205 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2021-05-02 23:10:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:10:24,205 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2021-05-02 23:10:24,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:10:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2021-05-02 23:10:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-05-02 23:10:24,206 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:10:24,206 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:10:24,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-02 23:10:24,206 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:10:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:10:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1365220438, now seen corresponding path program 48 times [2021-05-02 23:10:24,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:10:24,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749927021] [2021-05-02 23:10:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:10:24,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1369 v_main_~n~0_101) InVars {main_~i~0=v_main_~i~0_1369, main_~n~0=v_main_~n~0_101} OutVars{main_~i~0=v_main_~i~0_1369, main_~n~0=v_main_~n~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:10:24,224 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:10:24,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:24,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:10:24,302 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:10:24,355 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:10:24,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1371 1) v_main_~n~0_102) InVars {main_~i~0=v_main_~i~0_1371, main_~n~0=v_main_~n~0_102} OutVars{main_~i~0=v_main_~i~0_1371, main_~n~0=v_main_~n~0_102} AuxVars[] AssignedVars[] [2021-05-02 23:10:24,362 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:10:24,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:24,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:10:24,455 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:10:24,528 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:10:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:24,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:10:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:10:24,895 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-05-02 23:10:45,281 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:10:45,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749927021] [2021-05-02 23:10:45,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [749927021] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:10:45,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:10:45,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2021-05-02 23:10:45,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908533410] [2021-05-02 23:10:45,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2021-05-02 23:10:45,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:10:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-05-02 23:10:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=10816, Unknown=0, NotChecked=0, Total=11130 [2021-05-02 23:10:45,284 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 104 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:10:46,464 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2021-05-02 23:11:31,523 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-05-02 23:11:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:11:32,679 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2021-05-02 23:11:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-05-02 23:11:32,684 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2021-05-02 23:11:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:11:32,684 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:11:32,685 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:11:32,688 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5937 ImplicationChecksByTransitivity, 48094.0ms TimeCoverageRelationStatistics Valid=827, Invalid=41815, Unknown=0, NotChecked=0, Total=42642 [2021-05-02 23:11:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:11:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:11:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2021-05-02 23:11:32,698 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2021-05-02 23:11:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:11:32,698 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2021-05-02 23:11:32,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 104 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2021-05-02 23:11:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-02 23:11:32,699 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:11:32,699 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:11:32,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:11:32,700 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:11:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:11:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1151603788, now seen corresponding path program 49 times [2021-05-02 23:11:32,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:11:32,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743347210] [2021-05-02 23:11:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:11:32,715 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1422 v_main_~n~0_103) InVars {main_~i~0=v_main_~i~0_1422, main_~n~0=v_main_~n~0_103} OutVars{main_~i~0=v_main_~i~0_1422, main_~n~0=v_main_~n~0_103} AuxVars[] AssignedVars[] [2021-05-02 23:11:32,719 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:11:32,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:32,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:11:32,814 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:11:32,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:11:32,912 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1424 1) v_main_~n~0_104) InVars {main_~i~0=v_main_~i~0_1424, main_~n~0=v_main_~n~0_104} OutVars{main_~i~0=v_main_~i~0_1424, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[] [2021-05-02 23:11:32,916 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:11:32,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:32,941 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:11:33,035 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:11:33,131 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:11:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:33,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:11:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:11:33,611 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-05-02 23:11:57,801 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:11:57,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743347210] [2021-05-02 23:11:57,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [743347210] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:11:57,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:11:57,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [106] imperfect sequences [] total 106 [2021-05-02 23:11:57,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060804049] [2021-05-02 23:11:57,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2021-05-02 23:11:57,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:11:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2021-05-02 23:11:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=11236, Unknown=0, NotChecked=0, Total=11556 [2021-05-02 23:11:57,803 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 104 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:59,480 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2021-05-02 23:12:48,449 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:12:49,814 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-05-02 23:12:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:12:51,292 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2021-05-02 23:12:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-05-02 23:12:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 104 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-02 23:12:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:12:51,299 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:12:51,299 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:12:51,302 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6158 ImplicationChecksByTransitivity, 55074.1ms TimeCoverageRelationStatistics Valid=843, Invalid=43467, Unknown=0, NotChecked=0, Total=44310 [2021-05-02 23:12:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:12:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:12:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:12:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2021-05-02 23:12:51,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2021-05-02 23:12:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:12:51,314 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2021-05-02 23:12:51,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 104 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:12:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2021-05-02 23:12:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-05-02 23:12:51,315 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:12:51,315 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:12:51,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-02 23:12:51,315 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:12:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:12:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1753097326, now seen corresponding path program 50 times [2021-05-02 23:12:51,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:12:51,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026696389] [2021-05-02 23:12:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:12:51,333 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1476 v_main_~n~0_105) InVars {main_~i~0=v_main_~i~0_1476, main_~n~0=v_main_~n~0_105} OutVars{main_~i~0=v_main_~i~0_1476, main_~n~0=v_main_~n~0_105} AuxVars[] AssignedVars[] [2021-05-02 23:12:51,336 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:12:51,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:51,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:12:51,460 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:12:51,563 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-05-02 23:12:51,570 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:12:51,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1478 1) v_main_~n~0_106) InVars {main_~i~0=v_main_~i~0_1478, main_~n~0=v_main_~n~0_106} OutVars{main_~i~0=v_main_~i~0_1478, main_~n~0=v_main_~n~0_106} AuxVars[] AssignedVars[] [2021-05-02 23:12:51,581 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:12:51,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:51,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:12:51,721 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:12:51,842 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-05-02 23:12:51,851 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:12:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:52,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:12:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:12:52,565 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-05-02 23:13:20,511 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:13:20,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026696389] [2021-05-02 23:13:20,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1026696389] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:13:20,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:13:20,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2021-05-02 23:13:20,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84576787] [2021-05-02 23:13:20,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2021-05-02 23:13:20,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:13:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2021-05-02 23:13:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=11664, Unknown=0, NotChecked=0, Total=11990 [2021-05-02 23:13:20,513 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 108 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 106 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:13:22,210 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2021-05-02 23:13:37,868 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:13:54,627 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:14:04,954 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:14:06,893 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:14:07,580 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:14:09,634 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:14:21,249 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-05-02 23:14:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:14:23,008 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2021-05-02 23:14:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-05-02 23:14:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 106 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2021-05-02 23:14:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:14:23,016 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:14:23,016 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:14:23,018 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6383 ImplicationChecksByTransitivity, 63983.1ms TimeCoverageRelationStatistics Valid=859, Invalid=45151, Unknown=0, NotChecked=0, Total=46010 [2021-05-02 23:14:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:14:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:14:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:14:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2021-05-02 23:14:23,028 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2021-05-02 23:14:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:14:23,028 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2021-05-02 23:14:23,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 108 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 106 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:14:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2021-05-02 23:14:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-05-02 23:14:23,029 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:14:23,029 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:14:23,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:14:23,029 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:14:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:14:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 32197616, now seen corresponding path program 51 times [2021-05-02 23:14:23,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:14:23,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568992083] [2021-05-02 23:14:23,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:14:23,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= v_main_~i~0_1531 v_main_~n~0_107) InVars {main_~i~0=v_main_~i~0_1531, main_~n~0=v_main_~n~0_107} OutVars{main_~i~0=v_main_~i~0_1531, main_~n~0=v_main_~n~0_107} AuxVars[] AssignedVars[] [2021-05-02 23:14:23,050 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size [2021-05-02 23:14:23,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:23,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:14:23,181 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 89.1 percent of original size 57 [2021-05-02 23:14:23,285 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-05-02 23:14:23,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:14:23,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (<= (+ v_main_~i~0_1533 1) v_main_~n~0_108) InVars {main_~i~0=v_main_~i~0_1533, main_~n~0=v_main_~n~0_108} OutVars{main_~i~0=v_main_~i~0_1533, main_~n~0=v_main_~n~0_108} AuxVars[] AssignedVars[] [2021-05-02 23:14:23,302 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size [2021-05-02 23:14:23,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:23,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-05-02 23:14:23,420 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 90.0 percent of original size 63 [2021-05-02 23:14:23,525 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-05-02 23:14:23,533 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:14:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:23,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:14:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:14:24,187 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-05-02 23:14:56,813 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:14:56,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568992083] [2021-05-02 23:14:56,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [568992083] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:14:56,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:14:56,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2021-05-02 23:14:56,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921415761] [2021-05-02 23:14:56,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2021-05-02 23:14:56,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:14:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-05-02 23:14:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=12100, Unknown=0, NotChecked=0, Total=12432 [2021-05-02 23:14:56,815 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand has 110 states, 109 states have (on average 1.0091743119266054) internal successors, (110), 108 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:14:58,402 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31