/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:02:18,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:02:18,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:02:18,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:02:18,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:02:18,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:02:18,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:02:18,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:02:18,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:02:18,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:02:18,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:02:18,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:02:18,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:02:18,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:02:18,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:02:18,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:02:18,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:02:18,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:02:18,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:02:18,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:02:18,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:02:18,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:02:18,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:02:18,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:02:18,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:02:18,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:02:18,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:02:18,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:02:18,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:02:18,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:02:18,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:02:18,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:02:18,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:02:18,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:02:18,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:02:18,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:02:18,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:02:18,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:02:18,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:02:18,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:02:18,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:02:18,285 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:18,300 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:02:18,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:02:18,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:02:18,303 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:02:18,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:02:18,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:02:18,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:02:18,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:02:18,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:02:18,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:02:18,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:02:18,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:02:18,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:02:18,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:02:18,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:02:18,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:02:18,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:02:18,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:02:18,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:02:18,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:02:18,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:02:18,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:02:18,307 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:02:18,307 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:18,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:02:18,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:02:18,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:02:18,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:02:18,707 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:02:18,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2021-05-02 23:02:18,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c791ff35/27ac623ecf2744a78c235f3820ca9087/FLAGebaf46e41 [2021-05-02 23:02:19,193 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:02:19,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2021-05-02 23:02:19,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c791ff35/27ac623ecf2744a78c235f3820ca9087/FLAGebaf46e41 [2021-05-02 23:02:19,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c791ff35/27ac623ecf2744a78c235f3820ca9087 [2021-05-02 23:02:19,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:02:19,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:02:19,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:19,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:02:19,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:02:19,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:19" (1/1) ... [2021-05-02 23:02:19,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487fb85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:19, skipping insertion in model container [2021-05-02 23:02:19,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:19" (1/1) ... [2021-05-02 23:02:19,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:02:19,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:02:19,743 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-1.i[808,821] [2021-05-02 23:02:19,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:19,757 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:02:19,770 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-1.i[808,821] [2021-05-02 23:02:19,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:19,784 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:02:19,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:19 WrapperNode [2021-05-02 23:02:19,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:19,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:02:19,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:02:19,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:02:19,803 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:19" (1/1) ... [2021-05-02 23:02:19,804 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:19" (1/1) ... [2021-05-02 23:02:19,813 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:19" (1/1) ... [2021-05-02 23:02:19,813 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:19" (1/1) ... [2021-05-02 23:02:19,816 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:19" (1/1) ... [2021-05-02 23:02:19,819 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:19" (1/1) ... [2021-05-02 23:02:19,820 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:19" (1/1) ... [2021-05-02 23:02:19,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:02:19,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:02:19,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:02:19,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:02:19,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:19" (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:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:02:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:02:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:02:19,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:02:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:02:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:02:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:02:20,152 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:02:20,152 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:02:20,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:20 BoogieIcfgContainer [2021-05-02 23:02:20,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:02:20,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:02:20,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:02:20,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:02:20,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:02:19" (1/3) ... [2021-05-02 23:02:20,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee0db9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:20, skipping insertion in model container [2021-05-02 23:02:20,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:19" (2/3) ... [2021-05-02 23:02:20,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee0db9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:20, skipping insertion in model container [2021-05-02 23:02:20,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:20" (3/3) ... [2021-05-02 23:02:20,160 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2021-05-02 23:02:20,181 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:02:20,184 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:02:20,205 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:02:20,256 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:02:20,256 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:02:20,256 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:02:20,256 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:02:20,256 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:02:20,256 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:02:20,257 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:02:20,257 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:02:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:02:20,287 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,288 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:20,288 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2021-05-02 23:02:20,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [919532108] [2021-05-02 23:02:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,377 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,553 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:20,556 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:20,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [919532108] [2021-05-02 23:02:20,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [919532108] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:20,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:20,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:02:20,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368729133] [2021-05-02 23:02:20,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:02:20,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:02:20,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:02:20,576 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:20,643 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-02 23:02:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:02:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2021-05-02 23:02:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:20,650 INFO L225 Difference]: With dead ends: 31 [2021-05-02 23:02:20,650 INFO L226 Difference]: Without dead ends: 14 [2021-05-02 23:02:20,654 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:02:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-02 23:02:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-02 23:02:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-02 23:02:20,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-02 23:02:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:20,695 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-02 23:02:20,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-02 23:02:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:02:20,696 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,696 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:20,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:02:20,697 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2021-05-02 23:02:20,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99664570] [2021-05-02 23:02:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,711 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,867 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:20,867 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:20,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99664570] [2021-05-02 23:02:20,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99664570] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:20,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:20,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:02:20,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028204674] [2021-05-02 23:02:20,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:02:20,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:02:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:02:20,870 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:21,067 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-05-02 23:02:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:02:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2021-05-02 23:02:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:21,068 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:02:21,069 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:02:21,070 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:02:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:02:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:02:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-05-02 23:02:21,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-05-02 23:02:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:21,084 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-05-02 23:02:21,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-05-02 23:02:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:02:21,085 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:21,085 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:21,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:02:21,085 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2021-05-02 23:02:21,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:21,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238401317] [2021-05-02 23:02:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:21,129 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_11 v_main_~n~0_6) (< v_main_~i~0_11 10)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] [2021-05-02 23:02:21,154 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:21,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:21,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:21,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:21,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:21,258 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:21,290 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,438 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:21,609 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:21,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238401317] [2021-05-02 23:02:21,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1238401317] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:21,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:21,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:21,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220765508] [2021-05-02 23:02:21,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:21,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:21,615 INFO L87 Difference]: Start difference. First operand 17 states and 19 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:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:21,989 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-05-02 23:02:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:02:21,990 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:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:21,991 INFO L225 Difference]: With dead ends: 33 [2021-05-02 23:02:21,991 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:02:21,992 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 435.0ms TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:02:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:02:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:02:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:02:21,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2021-05-02 23:02:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:21,997 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:02:21,997 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:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:02:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:02:21,998 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:21,998 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:21,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:02:21,999 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 473295148, now seen corresponding path program 2 times [2021-05-02 23:02:21,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:21,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114931557] [2021-05-02 23:02:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:22,008 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_15 10) (<= (+ v_main_~i~0_15 1) v_main_~n~0_7)) InVars {main_~i~0=v_main_~i~0_15, main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_15, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] [2021-05-02 23:02:22,014 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:22,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:22,021 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:22,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:22,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:22,088 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:22,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:22,118 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_17 10) (<= v_main_~i~0_17 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_17, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_17, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:02:22,124 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:22,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:22,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:22,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:22,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:22,206 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:22,234 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,367 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:22,573 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:22,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114931557] [2021-05-02 23:02:22,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1114931557] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:22,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:22,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:02:22,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216508960] [2021-05-02 23:02:22,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:02:22,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:02:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:02:22,575 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:23,065 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-05-02 23:02:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:02:23,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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 17 [2021-05-02 23:02:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:23,067 INFO L225 Difference]: With dead ends: 33 [2021-05-02 23:02:23,067 INFO L226 Difference]: Without dead ends: 22 [2021-05-02 23:02:23,067 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 585.1ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:02:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-02 23:02:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-02 23:02:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-05-02 23:02:23,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-05-02 23:02:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:23,072 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-05-02 23:02:23,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-05-02 23:02:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:02:23,073 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:23,073 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:23,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:02:23,073 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1107532713, now seen corresponding path program 3 times [2021-05-02 23:02:23,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:23,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1395291638] [2021-05-02 23:02:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:23,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_22 10) (<= (+ v_main_~i~0_22 1) v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_22, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_22, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[] [2021-05-02 23:02:23,086 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:23,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:23,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:23,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:23,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:23,161 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:23,186 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:23,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_24 10) (<= v_main_~i~0_24 v_main_~n~0_10)) InVars {main_~i~0=v_main_~i~0_24, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_24, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] [2021-05-02 23:02:23,210 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:23,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:23,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:23,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:23,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:23,267 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:23,301 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,424 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:23,666 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:23,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1395291638] [2021-05-02 23:02:23,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1395291638] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:23,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:23,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:02:23,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729240860] [2021-05-02 23:02:23,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:02:23,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:02:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:02:23,668 INFO L87 Difference]: Start difference. First operand 22 states and 23 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:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:24,280 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-02 23:02:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:24,281 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:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:24,282 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:02:24,283 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:02:24,285 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 660.0ms TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:02:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:02:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:02:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:02:24,299 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2021-05-02 23:02:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:24,299 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:02:24,299 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:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:02:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:02:24,300 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:24,300 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:24,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:02:24,300 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2117696524, now seen corresponding path program 4 times [2021-05-02 23:02:24,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:24,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930809674] [2021-05-02 23:02:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:24,309 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_30 10) (<= (+ v_main_~i~0_30 1) v_main_~n~0_11)) InVars {main_~i~0=v_main_~i~0_30, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_30, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:02:24,318 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:24,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:24,343 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:24,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:24,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:24,386 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:24,408 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:24,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_32 10) (<= v_main_~i~0_32 v_main_~n~0_12)) InVars {main_~i~0=v_main_~i~0_32, main_~n~0=v_main_~n~0_12} OutVars{main_~i~0=v_main_~i~0_32, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] [2021-05-02 23:02:24,421 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:24,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:24,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:24,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:24,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:24,488 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:24,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:24,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:24,624 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:24,945 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:24,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930809674] [2021-05-02 23:02:24,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1930809674] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:24,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:24,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:02:24,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048777435] [2021-05-02 23:02:24,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:02:24,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:02:24,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:02:24,947 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 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:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:25,658 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2021-05-02 23:02:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:02:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 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 23 [2021-05-02 23:02:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:25,659 INFO L225 Difference]: With dead ends: 39 [2021-05-02 23:02:25,659 INFO L226 Difference]: Without dead ends: 28 [2021-05-02 23:02:25,660 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 836.7ms TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:02:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-05-02 23:02:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-05-02 23:02:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-02 23:02:25,665 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2021-05-02 23:02:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:25,666 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-02 23:02:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 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:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-02 23:02:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:02:25,666 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:25,667 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:25,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:02:25,667 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1071946953, now seen corresponding path program 5 times [2021-05-02 23:02:25,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:25,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846996475] [2021-05-02 23:02:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:25,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_39 10) (<= (+ v_main_~i~0_39 1) v_main_~n~0_13)) InVars {main_~i~0=v_main_~i~0_39, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_39, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:02:25,680 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:25,682 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:25,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:25,703 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:25,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:25,737 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:25,769 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:25,773 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_41 10) (<= v_main_~i~0_41 v_main_~n~0_14)) InVars {main_~i~0=v_main_~i~0_41, main_~n~0=v_main_~n~0_14} OutVars{main_~i~0=v_main_~i~0_41, main_~n~0=v_main_~n~0_14} AuxVars[] AssignedVars[] [2021-05-02 23:02:25,776 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:25,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:25,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:25,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:25,828 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:25,848 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:25,866 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:25,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:25,940 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:26,282 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:26,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846996475] [2021-05-02 23:02:26,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1846996475] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:26,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:26,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:02:26,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682292846] [2021-05-02 23:02:26,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:02:26,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:02:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:02:26,284 INFO L87 Difference]: Start difference. First operand 28 states and 29 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:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:27,077 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:02:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:02:27,078 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:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:27,078 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:02:27,078 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:02:27,079 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 912.5ms TimeCoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:02:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:02:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:02:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:02:27,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2021-05-02 23:02:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:27,085 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:02:27,085 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:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:02:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:02:27,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:27,086 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:27,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:02:27,086 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1455724820, now seen corresponding path program 6 times [2021-05-02 23:02:27,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:27,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683821971] [2021-05-02 23:02:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:27,094 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_49 1) v_main_~n~0_15) (< v_main_~i~0_49 10)) InVars {main_~i~0=v_main_~i~0_49, main_~n~0=v_main_~n~0_15} OutVars{main_~i~0=v_main_~i~0_49, main_~n~0=v_main_~n~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:02:27,097 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:27,114 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:27,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:27,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:27,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:27,149 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:27,170 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:27,183 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_51 v_main_~n~0_16) (< v_main_~i~0_51 10)) InVars {main_~i~0=v_main_~i~0_51, main_~n~0=v_main_~n~0_16} OutVars{main_~i~0=v_main_~i~0_51, main_~n~0=v_main_~n~0_16} AuxVars[] AssignedVars[] [2021-05-02 23:02:27,186 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:27,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:27,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:27,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:27,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:27,238 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:27,258 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:27,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:27,343 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:27,750 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:27,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683821971] [2021-05-02 23:02:27,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [683821971] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:27,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:27,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:02:27,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110024138] [2021-05-02 23:02:27,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:02:27,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:27,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:02:27,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:02:27,752 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 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:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:28,761 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-05-02 23:02:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:02:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 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 29 [2021-05-02 23:02:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:28,762 INFO L225 Difference]: With dead ends: 45 [2021-05-02 23:02:28,762 INFO L226 Difference]: Without dead ends: 34 [2021-05-02 23:02:28,763 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1080.8ms TimeCoverageRelationStatistics Valid=209, Invalid=2143, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:02:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-02 23:02:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-05-02 23:02:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-02 23:02:28,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2021-05-02 23:02:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:28,769 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-02 23:02:28,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 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:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-02 23:02:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:02:28,770 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:28,770 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:28,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:02:28,770 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash 336086505, now seen corresponding path program 7 times [2021-05-02 23:02:28,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:28,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014292117] [2021-05-02 23:02:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:28,776 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_60 10) (<= (+ v_main_~i~0_60 1) v_main_~n~0_17)) InVars {main_~i~0=v_main_~i~0_60, main_~n~0=v_main_~n~0_17} OutVars{main_~i~0=v_main_~i~0_60, main_~n~0=v_main_~n~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:02:28,778 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:28,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:28,797 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:28,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:28,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:28,832 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:28,853 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:28,857 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_62 v_main_~n~0_18) (< v_main_~i~0_62 10)) InVars {main_~i~0=v_main_~i~0_62, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_62, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[] [2021-05-02 23:02:28,859 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:28,875 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:28,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:28,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:28,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:28,914 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:28,936 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:29,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:29,030 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:29,505 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:29,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014292117] [2021-05-02 23:02:29,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014292117] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:29,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:29,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:02:29,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316551839] [2021-05-02 23:02:29,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:02:29,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:02:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:02:29,506 INFO L87 Difference]: Start difference. First operand 34 states and 35 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:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:30,533 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:02:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:02:30,533 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:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:30,534 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:02:30,534 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:02:30,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1212.3ms TimeCoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:02:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:02:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:02:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:02:30,541 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-05-02 23:02:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:30,541 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:02:30,541 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:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:02:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:02:30,542 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:30,542 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:30,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:02:30,542 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1961252404, now seen corresponding path program 8 times [2021-05-02 23:02:30,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:30,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895518176] [2021-05-02 23:02:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:30,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_72 1) v_main_~n~0_19) (< v_main_~i~0_72 10)) InVars {main_~i~0=v_main_~i~0_72, main_~n~0=v_main_~n~0_19} OutVars{main_~i~0=v_main_~i~0_72, main_~n~0=v_main_~n~0_19} AuxVars[] AssignedVars[] [2021-05-02 23:02:30,552 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:30,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:30,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:30,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:30,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:30,601 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:30,619 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:30,622 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_74 10) (<= v_main_~i~0_74 v_main_~n~0_20)) InVars {main_~i~0=v_main_~i~0_74, main_~n~0=v_main_~n~0_20} OutVars{main_~i~0=v_main_~i~0_74, main_~n~0=v_main_~n~0_20} AuxVars[] AssignedVars[] [2021-05-02 23:02:30,624 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:30,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:30,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:30,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:30,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:30,680 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:30,702 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:30,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:30,799 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:31,398 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:31,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895518176] [2021-05-02 23:02:31,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1895518176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:31,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:31,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:02:31,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325198262] [2021-05-02 23:02:31,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:02:31,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:31,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:02:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:02:31,400 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 29 states have internal predecessors, (31), 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:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:32,593 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-05-02 23:02:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:02:32,594 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 29 states have internal predecessors, (31), 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 35 [2021-05-02 23:02:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:32,594 INFO L225 Difference]: With dead ends: 51 [2021-05-02 23:02:32,594 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 23:02:32,596 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1480.4ms TimeCoverageRelationStatistics Valid=263, Invalid=3397, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:02:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 23:02:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-02 23:02:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 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:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-05-02 23:02:32,602 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2021-05-02 23:02:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:32,602 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-05-02 23:02:32,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 29 states have internal predecessors, (31), 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:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-05-02 23:02:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 23:02:32,603 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:32,603 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:32,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:02:32,603 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1680828663, now seen corresponding path program 9 times [2021-05-02 23:02:32,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:32,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441299648] [2021-05-02 23:02:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:32,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_85 1) v_main_~n~0_21) (< v_main_~i~0_85 10)) InVars {main_~i~0=v_main_~i~0_85, main_~n~0=v_main_~n~0_21} OutVars{main_~i~0=v_main_~i~0_85, main_~n~0=v_main_~n~0_21} AuxVars[] AssignedVars[] [2021-05-02 23:02:32,619 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:32,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:32,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:32,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:32,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:32,673 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:32,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:32,698 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_87 v_main_~n~0_22) (< v_main_~i~0_87 10)) InVars {main_~i~0=v_main_~i~0_87, main_~n~0=v_main_~n~0_22} OutVars{main_~i~0=v_main_~i~0_87, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:02:32,700 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:32,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:32,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:32,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:32,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:32,751 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:32,772 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:32,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:32,853 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:33,468 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:33,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441299648] [2021-05-02 23:02:33,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [441299648] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:33,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:33,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:02:33,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143026930] [2021-05-02 23:02:33,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:02:33,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:02:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:02:33,470 INFO L87 Difference]: Start difference. First operand 40 states and 41 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:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:34,975 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-02 23:02:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:02:34,975 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:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:34,977 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:02:34,978 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:02:34,979 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1660.3ms TimeCoverageRelationStatistics Valid=300, Invalid=4256, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:02:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:02:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-02 23:02:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:02:34,989 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2021-05-02 23:02:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:34,989 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:02:34,989 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:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:02:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:02:34,992 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:34,992 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:34,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:02:34,993 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash 486456110, now seen corresponding path program 1 times [2021-05-02 23:02:34,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:34,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922785904] [2021-05-02 23:02:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:35,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_99 10) (<= (+ v_main_~i~0_99 1) v_main_~n~0_23)) InVars {main_~i~0=v_main_~i~0_99, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_99, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[] [2021-05-02 23:02:35,005 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:35,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:35,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:35,062 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:35,084 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:02:35,088 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_101) (<= v_main_~i~0_101 v_main_~n~0_24)) InVars {main_~i~0=v_main_~i~0_101, main_~n~0=v_main_~n~0_24} OutVars{main_~i~0=v_main_~i~0_101, main_~n~0=v_main_~n~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:02:35,090 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:35,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:35,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:35,131 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:35,148 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_103 v_main_~n~0_25) (< v_main_~i~0_103 10)) InVars {main_~i~0=v_main_~i~0_103, main_~n~0=v_main_~n~0_25} OutVars{main_~i~0=v_main_~i~0_103, main_~n~0=v_main_~n~0_25} AuxVars[] AssignedVars[] [2021-05-02 23:02:35,150 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:35,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,153 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:35,168 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:35,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:35,208 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:35,232 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:35,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:35,342 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:35,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:35,995 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:35,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922785904] [2021-05-02 23:02:35,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [922785904] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:35,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:35,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:02:35,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622305831] [2021-05-02 23:02:35,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:02:35,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:02:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:02:35,997 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:37,514 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-02 23:02:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:02:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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 41 [2021-05-02 23:02:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:37,517 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:02:37,517 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:02:37,518 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1614.3ms TimeCoverageRelationStatistics Valid=284, Invalid=4138, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:02:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:02:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 23:02:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 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:02:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-05-02 23:02:37,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2021-05-02 23:02:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:37,530 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-05-02 23:02:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-05-02 23:02:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:02:37,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:37,532 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:37,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:02:37,532 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -176232215, now seen corresponding path program 2 times [2021-05-02 23:02:37,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:37,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100447240] [2021-05-02 23:02:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:37,542 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_117 10) (<= (+ v_main_~i~0_117 1) v_main_~n~0_26)) InVars {main_~i~0=v_main_~i~0_117, main_~n~0=v_main_~n~0_26} OutVars{main_~i~0=v_main_~i~0_117, main_~n~0=v_main_~n~0_26} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,545 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:37,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:37,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:37,596 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:37,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_119 1) v_main_~n~0_27) (<= 10 v_main_~i~0_119)) InVars {main_~i~0=v_main_~i~0_119, main_~n~0=v_main_~n~0_27} OutVars{main_~i~0=v_main_~i~0_119, main_~n~0=v_main_~n~0_27} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,620 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:37,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:37,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:37,664 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:37,680 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:37,682 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_121) (<= v_main_~i~0_121 v_main_~n~0_28)) InVars {main_~i~0=v_main_~i~0_121, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_121, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,684 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:37,685 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:37,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:37,719 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:37,736 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_123 v_main_~n~0_29) (< v_main_~i~0_123 10)) InVars {main_~i~0=v_main_~i~0_123, main_~n~0=v_main_~n~0_29} OutVars{main_~i~0=v_main_~i~0_123, main_~n~0=v_main_~n~0_29} AuxVars[] AssignedVars[] [2021-05-02 23:02:37,738 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:37,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:37,756 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:37,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:37,791 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:37,812 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:37,910 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,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:38,589 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:38,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100447240] [2021-05-02 23:02:38,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1100447240] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:38,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:38,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:02:38,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361467072] [2021-05-02 23:02:38,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:02:38,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:02:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:02:38,591 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 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:02:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:40,009 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:02:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:02:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 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:02:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:40,011 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:02:40,011 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 23:02:40,012 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 1616.8ms TimeCoverageRelationStatistics Valid=299, Invalid=4671, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:02:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 23:02:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-02 23:02:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:02:40,019 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2021-05-02 23:02:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:40,019 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:02:40,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 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:02:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:02:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:02:40,020 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:40,020 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:40,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:02:40,021 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1640537422, now seen corresponding path program 3 times [2021-05-02 23:02:40,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:40,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039587640] [2021-05-02 23:02:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:40,028 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_138 10) (<= (+ v_main_~i~0_138 1) v_main_~n~0_30)) InVars {main_~i~0=v_main_~i~0_138, main_~n~0=v_main_~n~0_30} OutVars{main_~i~0=v_main_~i~0_138, main_~n~0=v_main_~n~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,030 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:40,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:40,067 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:40,081 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:40,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_140 1) v_main_~n~0_31) (<= 10 v_main_~i~0_140)) InVars {main_~i~0=v_main_~i~0_140, main_~n~0=v_main_~n~0_31} OutVars{main_~i~0=v_main_~i~0_140, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,106 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:40,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:40,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:40,145 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:40,158 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:40,162 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_142) (<= v_main_~i~0_142 v_main_~n~0_32)) InVars {main_~i~0=v_main_~i~0_142, main_~n~0=v_main_~n~0_32} OutVars{main_~i~0=v_main_~i~0_142, main_~n~0=v_main_~n~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,164 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:40,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:40,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:40,211 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:40,226 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_144 10) (<= v_main_~i~0_144 v_main_~n~0_33)) InVars {main_~i~0=v_main_~i~0_144, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_144, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[] [2021-05-02 23:02:40,228 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:40,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:40,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:40,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:40,283 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:40,302 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:40,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:40,381 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,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:41,112 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:41,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039587640] [2021-05-02 23:02:41,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2039587640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:41,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:41,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:02:41,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505759616] [2021-05-02 23:02:41,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:02:41,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:02:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:02:41,114 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 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,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:42,479 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-05-02 23:02:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:02:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 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 47 [2021-05-02 23:02:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:42,480 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:02:42,480 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:02:42,481 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1676.0ms TimeCoverageRelationStatistics Valid=314, Invalid=5236, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:02:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:02:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-05-02 23:02:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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:02:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-05-02 23:02:42,487 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2021-05-02 23:02:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:42,488 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-05-02 23:02:42,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 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,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-05-02 23:02:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:02:42,488 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:42,488 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:42,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-02 23:02:42,489 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -153070903, now seen corresponding path program 4 times [2021-05-02 23:02:42,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:42,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159264829] [2021-05-02 23:02:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:42,497 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_160 1) v_main_~n~0_34) (< v_main_~i~0_160 10)) InVars {main_~i~0=v_main_~i~0_160, main_~n~0=v_main_~n~0_34} OutVars{main_~i~0=v_main_~i~0_160, main_~n~0=v_main_~n~0_34} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,499 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:42,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:42,530 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:42,556 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:42,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_162 1) v_main_~n~0_35) (<= 10 v_main_~i~0_162)) InVars {main_~i~0=v_main_~i~0_162, main_~n~0=v_main_~n~0_35} OutVars{main_~i~0=v_main_~i~0_162, main_~n~0=v_main_~n~0_35} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,579 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:42,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:42,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:42,620 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:42,635 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:42,637 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_164 v_main_~n~0_36) (<= 10 v_main_~i~0_164)) InVars {main_~i~0=v_main_~i~0_164, main_~n~0=v_main_~n~0_36} OutVars{main_~i~0=v_main_~i~0_164, main_~n~0=v_main_~n~0_36} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,640 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:42,652 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:42,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:42,684 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:42,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_166 10) (<= v_main_~i~0_166 v_main_~n~0_37)) InVars {main_~i~0=v_main_~i~0_166, main_~n~0=v_main_~n~0_37} OutVars{main_~i~0=v_main_~i~0_166, main_~n~0=v_main_~n~0_37} AuxVars[] AssignedVars[] [2021-05-02 23:02:42,703 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:42,716 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:42,733 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:42,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:42,754 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:42,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:42,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:42,872 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:42,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:43,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:43,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159264829] [2021-05-02 23:02:43,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1159264829] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:43,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:43,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:02:43,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225061352] [2021-05-02 23:02:43,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:02:43,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:02:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1678, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:02:43,745 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 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:02:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:45,265 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:02:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:02:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 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:02:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:45,266 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:02:45,266 INFO L226 Difference]: Without dead ends: 56 [2021-05-02 23:02:45,267 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1856.8ms TimeCoverageRelationStatistics Valid=329, Invalid=5833, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:02:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-02 23:02:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-05-02 23:02:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:02:45,274 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2021-05-02 23:02:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:45,274 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:02:45,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 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:02:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:02:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:02:45,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:45,275 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:45,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:02:45,275 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash 149448558, now seen corresponding path program 5 times [2021-05-02 23:02:45,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:45,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660731231] [2021-05-02 23:02:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:45,282 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_183 10) (<= (+ v_main_~i~0_183 1) v_main_~n~0_38)) InVars {main_~i~0=v_main_~i~0_183, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_183, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,290 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:45,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:45,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:45,348 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:45,372 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_185) (<= (+ v_main_~i~0_185 1) v_main_~n~0_39)) InVars {main_~i~0=v_main_~i~0_185, main_~n~0=v_main_~n~0_39} OutVars{main_~i~0=v_main_~i~0_185, main_~n~0=v_main_~n~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,374 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:45,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:45,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:45,409 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:45,422 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:45,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_187) (<= v_main_~i~0_187 v_main_~n~0_40)) InVars {main_~i~0=v_main_~i~0_187, main_~n~0=v_main_~n~0_40} OutVars{main_~i~0=v_main_~i~0_187, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,434 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:45,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:45,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:45,480 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:45,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_189 10) (<= v_main_~i~0_189 v_main_~n~0_41)) InVars {main_~i~0=v_main_~i~0_189, main_~n~0=v_main_~n~0_41} OutVars{main_~i~0=v_main_~i~0_189, main_~n~0=v_main_~n~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:02:45,502 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:45,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:45,520 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:45,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:45,553 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:45,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:45,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:45,645 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:45,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:46,503 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:46,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660731231] [2021-05-02 23:02:46,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [660731231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:46,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:46,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:02:46,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762731094] [2021-05-02 23:02:46,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:02:46,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:02:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:02:46,505 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:48,088 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-05-02 23:02:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:02:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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 53 [2021-05-02 23:02:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:48,089 INFO L225 Difference]: With dead ends: 67 [2021-05-02 23:02:48,089 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:02:48,090 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 1881.7ms TimeCoverageRelationStatistics Valid=344, Invalid=6462, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:02:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:02:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-02 23:02:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 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:02:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-05-02 23:02:48,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2021-05-02 23:02:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:48,097 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-05-02 23:02:48,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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,097 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-05-02 23:02:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:02:48,098 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:48,098 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:48,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-02 23:02:48,098 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1665324201, now seen corresponding path program 6 times [2021-05-02 23:02:48,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:48,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503082649] [2021-05-02 23:02:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:48,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_207 1) v_main_~n~0_42) (< v_main_~i~0_207 10)) InVars {main_~i~0=v_main_~i~0_207, main_~n~0=v_main_~n~0_42} OutVars{main_~i~0=v_main_~i~0_207, main_~n~0=v_main_~n~0_42} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,107 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:48,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:48,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:48,154 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:48,174 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_209) (<= (+ v_main_~i~0_209 1) v_main_~n~0_43)) InVars {main_~i~0=v_main_~i~0_209, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_209, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,176 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:48,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:48,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:48,218 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:48,235 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:48,237 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_211 v_main_~n~0_44) (<= 10 v_main_~i~0_211)) InVars {main_~i~0=v_main_~i~0_211, main_~n~0=v_main_~n~0_44} OutVars{main_~i~0=v_main_~i~0_211, main_~n~0=v_main_~n~0_44} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,239 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:48,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:48,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:48,273 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:48,288 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_213 10) (<= v_main_~i~0_213 v_main_~n~0_45)) InVars {main_~i~0=v_main_~i~0_213, main_~n~0=v_main_~n~0_45} OutVars{main_~i~0=v_main_~i~0_213, main_~n~0=v_main_~n~0_45} AuxVars[] AssignedVars[] [2021-05-02 23:02:48,289 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:48,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:48,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:48,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:48,339 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:48,358 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:48,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:48,451 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:48,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:49,326 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:49,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503082649] [2021-05-02 23:02:49,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1503082649] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:49,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:49,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:02:49,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908470727] [2021-05-02 23:02:49,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:02:49,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:02:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2024, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:02:49,328 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 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:02:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:51,113 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:02:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:02:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 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:02:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:51,114 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:02:51,114 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 23:02:51,115 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2026.5ms TimeCoverageRelationStatistics Valid=359, Invalid=7123, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:02:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 23:02:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-05-02 23:02:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:02:51,121 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2021-05-02 23:02:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:51,121 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:02:51,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 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:02:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:02:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:02:51,121 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:51,122 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:51,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:02:51,122 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash -464512626, now seen corresponding path program 7 times [2021-05-02 23:02:51,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:51,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903001705] [2021-05-02 23:02:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:51,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_232 10) (<= (+ v_main_~i~0_232 1) v_main_~n~0_46)) InVars {main_~i~0=v_main_~i~0_232, main_~n~0=v_main_~n~0_46} OutVars{main_~i~0=v_main_~i~0_232, main_~n~0=v_main_~n~0_46} AuxVars[] AssignedVars[] [2021-05-02 23:02:51,145 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:51,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,161 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:51,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:51,199 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:51,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_234) (<= (+ v_main_~i~0_234 1) v_main_~n~0_47)) InVars {main_~i~0=v_main_~i~0_234, main_~n~0=v_main_~n~0_47} OutVars{main_~i~0=v_main_~i~0_234, main_~n~0=v_main_~n~0_47} AuxVars[] AssignedVars[] [2021-05-02 23:02:51,221 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:51,231 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:51,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:51,259 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:51,272 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:51,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_236) (<= v_main_~i~0_236 v_main_~n~0_48)) InVars {main_~i~0=v_main_~i~0_236, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_236, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[] [2021-05-02 23:02:51,276 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:51,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,291 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:51,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:51,314 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:51,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_238 v_main_~n~0_49) (< v_main_~i~0_238 10)) InVars {main_~i~0=v_main_~i~0_238, main_~n~0=v_main_~n~0_49} OutVars{main_~i~0=v_main_~i~0_238, main_~n~0=v_main_~n~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:02:51,337 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:51,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:51,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:51,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:51,383 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:51,401 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:51,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:51,472 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,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:52,421 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:52,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903001705] [2021-05-02 23:02:52,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [903001705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:52,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:52,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:02:52,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922486559] [2021-05-02 23:02:52,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:02:52,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:02:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2209, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:02:52,423 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 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:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:54,238 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-02 23:02:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:02:54,238 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 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 59 [2021-05-02 23:02:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:54,238 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:02:54,238 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:02:54,239 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 2114.8ms TimeCoverageRelationStatistics Valid=374, Invalid=7816, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:02:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:02:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-02 23:02:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 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:02:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-02 23:02:54,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2021-05-02 23:02:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:54,246 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-02 23:02:54,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 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:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-02 23:02:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:02:54,247 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:54,247 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:54,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-02 23:02:54,247 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash -881561975, now seen corresponding path program 8 times [2021-05-02 23:02:54,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:54,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863667336] [2021-05-02 23:02:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:54,258 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_258 10) (<= (+ v_main_~i~0_258 1) v_main_~n~0_50)) InVars {main_~i~0=v_main_~i~0_258, main_~n~0=v_main_~n~0_50} OutVars{main_~i~0=v_main_~i~0_258, main_~n~0=v_main_~n~0_50} AuxVars[] AssignedVars[] [2021-05-02 23:02:54,261 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:54,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,288 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:54,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:54,307 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:54,326 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_260 1) v_main_~n~0_51) (<= 10 v_main_~i~0_260)) InVars {main_~i~0=v_main_~i~0_260, main_~n~0=v_main_~n~0_51} OutVars{main_~i~0=v_main_~i~0_260, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:02:54,327 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:54,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:54,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:54,359 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:54,372 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:54,383 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_262 v_main_~n~0_52) (<= 10 v_main_~i~0_262)) InVars {main_~i~0=v_main_~i~0_262, main_~n~0=v_main_~n~0_52} OutVars{main_~i~0=v_main_~i~0_262, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[] [2021-05-02 23:02:54,384 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:54,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:54,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:54,418 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:54,433 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_264 10) (<= v_main_~i~0_264 v_main_~n~0_53)) InVars {main_~i~0=v_main_~i~0_264, main_~n~0=v_main_~n~0_53} OutVars{main_~i~0=v_main_~i~0_264, main_~n~0=v_main_~n~0_53} AuxVars[] AssignedVars[] [2021-05-02 23:02:54,438 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:54,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:54,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:54,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:54,502 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:54,528 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:54,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:54,621 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:54,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:55,680 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:55,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863667336] [2021-05-02 23:02:55,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863667336] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:55,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:55,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:02:55,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171636672] [2021-05-02 23:02:55,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:02:55,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:02:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:02:55,682 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 48 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:02:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:57,633 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:02:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:02:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 48 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:02:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:57,634 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:02:57,634 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:02:57,635 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 2300.7ms TimeCoverageRelationStatistics Valid=389, Invalid=8541, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:02:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:02:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-05-02 23:02:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:02:57,643 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2021-05-02 23:02:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:57,643 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:02:57,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 48 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:02:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:02:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:02:57,644 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:57,644 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:57,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:02:57,644 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 141669294, now seen corresponding path program 9 times [2021-05-02 23:02:57,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:57,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1245731471] [2021-05-02 23:02:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:57,656 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_285 10) (<= (+ v_main_~i~0_285 1) v_main_~n~0_54)) InVars {main_~i~0=v_main_~i~0_285, main_~n~0=v_main_~n~0_54} OutVars{main_~i~0=v_main_~i~0_285, main_~n~0=v_main_~n~0_54} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,658 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:02:57,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:57,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:57,709 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:02:57,732 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_287 1) v_main_~n~0_55) (<= 10 v_main_~i~0_287)) InVars {main_~i~0=v_main_~i~0_287, main_~n~0=v_main_~n~0_55} OutVars{main_~i~0=v_main_~i~0_287, main_~n~0=v_main_~n~0_55} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,734 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:02:57,745 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,762 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:02:57,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:02:57,777 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:02:57,791 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:57,793 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_289 v_main_~n~0_56) (<= 10 v_main_~i~0_289)) InVars {main_~i~0=v_main_~i~0_289, main_~n~0=v_main_~n~0_56} OutVars{main_~i~0=v_main_~i~0_289, main_~n~0=v_main_~n~0_56} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,794 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:02:57,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:57,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:57,832 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:02:57,851 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_291 v_main_~n~0_57) (< v_main_~i~0_291 10)) InVars {main_~i~0=v_main_~i~0_291, main_~n~0=v_main_~n~0_57} OutVars{main_~i~0=v_main_~i~0_291, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[] [2021-05-02 23:02:57,854 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:02:57,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,875 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:02:57,889 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:02:57,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:02:57,910 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:02:57,929 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:02:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:57,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:58,002 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,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:02:59,105 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:59,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1245731471] [2021-05-02 23:02:59,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1245731471] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:59,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:59,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:02:59,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935431511] [2021-05-02 23:02:59,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:02:59,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:02:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:02:59,106 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 50 states have internal predecessors, (61), 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:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:01,264 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-05-02 23:03:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:03:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 50 states have internal predecessors, (61), 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 65 [2021-05-02 23:03:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:01,266 INFO L225 Difference]: With dead ends: 79 [2021-05-02 23:03:01,266 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:03:01,267 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2464.6ms TimeCoverageRelationStatistics Valid=404, Invalid=9298, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:03:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:03:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-02 23:03:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 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:03:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-02 23:03:01,273 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2021-05-02 23:03:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:01,273 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-02 23:03:01,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 50 states have internal predecessors, (61), 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:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-02 23:03:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:03:01,274 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:01,274 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:01,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-02 23:03:01,274 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:01,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1841504361, now seen corresponding path program 10 times [2021-05-02 23:03:01,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:01,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2100932512] [2021-05-02 23:03:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:01,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_313 10) (<= (+ v_main_~i~0_313 1) v_main_~n~0_58)) InVars {main_~i~0=v_main_~i~0_313, main_~n~0=v_main_~n~0_58} OutVars{main_~i~0=v_main_~i~0_313, main_~n~0=v_main_~n~0_58} AuxVars[] AssignedVars[] [2021-05-02 23:03:01,286 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:01,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:01,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:01,331 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:01,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_315) (<= (+ v_main_~i~0_315 1) v_main_~n~0_59)) InVars {main_~i~0=v_main_~i~0_315, main_~n~0=v_main_~n~0_59} OutVars{main_~i~0=v_main_~i~0_315, main_~n~0=v_main_~n~0_59} AuxVars[] AssignedVars[] [2021-05-02 23:03:01,352 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:01,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,386 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:01,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:01,399 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:01,412 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:01,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_317 v_main_~n~0_60) (<= 10 v_main_~i~0_317)) InVars {main_~i~0=v_main_~i~0_317, main_~n~0=v_main_~n~0_60} OutVars{main_~i~0=v_main_~i~0_317, main_~n~0=v_main_~n~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:03:01,415 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:01,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:01,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:01,447 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:01,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_319 v_main_~n~0_61) (< v_main_~i~0_319 10)) InVars {main_~i~0=v_main_~i~0_319, main_~n~0=v_main_~n~0_61} OutVars{main_~i~0=v_main_~i~0_319, main_~n~0=v_main_~n~0_61} AuxVars[] AssignedVars[] [2021-05-02 23:03:01,463 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:01,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:01,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:01,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:01,509 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:01,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:01,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:01,601 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,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:02,760 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:02,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2100932512] [2021-05-02 23:03:02,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2100932512] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:02,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:02,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:03:02,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997680874] [2021-05-02 23:03:02,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:03:02,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:03:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:03:02,762 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 52 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:03:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:04,988 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:03:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:03:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 52 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:03:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:04,990 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:03:04,990 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:03:04,991 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3216 ImplicationChecksByTransitivity, 2556.7ms TimeCoverageRelationStatistics Valid=419, Invalid=10087, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:03:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:03:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-02 23:03:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:03:04,999 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2021-05-02 23:03:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:04,999 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:03:04,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 52 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:03:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:03:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:03:05,000 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:05,000 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:05,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:03:05,000 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -331401778, now seen corresponding path program 11 times [2021-05-02 23:03:05,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:05,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589411395] [2021-05-02 23:03:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:05,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_342 10) (<= (+ v_main_~i~0_342 1) v_main_~n~0_62)) InVars {main_~i~0=v_main_~i~0_342, main_~n~0=v_main_~n~0_62} OutVars{main_~i~0=v_main_~i~0_342, main_~n~0=v_main_~n~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:03:05,014 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:05,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:05,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:05,067 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:05,086 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_344 1) v_main_~n~0_63) (<= 10 v_main_~i~0_344)) InVars {main_~i~0=v_main_~i~0_344, main_~n~0=v_main_~n~0_63} OutVars{main_~i~0=v_main_~i~0_344, main_~n~0=v_main_~n~0_63} AuxVars[] AssignedVars[] [2021-05-02 23:03:05,089 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:05,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,124 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:05,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:05,140 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:05,166 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:05,168 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_346 v_main_~n~0_64) (<= 10 v_main_~i~0_346)) InVars {main_~i~0=v_main_~i~0_346, main_~n~0=v_main_~n~0_64} OutVars{main_~i~0=v_main_~i~0_346, main_~n~0=v_main_~n~0_64} AuxVars[] AssignedVars[] [2021-05-02 23:03:05,170 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:05,182 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,191 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:05,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:05,203 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:05,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_348 10) (<= v_main_~i~0_348 v_main_~n~0_65)) InVars {main_~i~0=v_main_~i~0_348, main_~n~0=v_main_~n~0_65} OutVars{main_~i~0=v_main_~i~0_348, main_~n~0=v_main_~n~0_65} AuxVars[] AssignedVars[] [2021-05-02 23:03:05,227 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:05,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:05,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:05,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:05,289 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:05,316 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:05,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:05,399 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:05,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:06,671 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:06,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589411395] [2021-05-02 23:03:06,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1589411395] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:06,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:06,671 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:03:06,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244489905] [2021-05-02 23:03:06,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:03:06,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:03:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3029, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:03:06,673 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 56 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 54 states have internal predecessors, (67), 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,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:09,067 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-05-02 23:03:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:03:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 54 states have internal predecessors, (67), 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 71 [2021-05-02 23:03:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:09,070 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:03:09,070 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:03:09,071 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3517 ImplicationChecksByTransitivity, 2738.2ms TimeCoverageRelationStatistics Valid=434, Invalid=10908, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:03:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:03:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-05-02 23:03:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 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:03:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-05-02 23:03:09,077 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2021-05-02 23:03:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:09,077 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-05-02 23:03:09,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 54 states have internal predecessors, (67), 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,077 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-05-02 23:03:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:03:09,078 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:09,078 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:09,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-02 23:03:09,078 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 368896585, now seen corresponding path program 12 times [2021-05-02 23:03:09,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:09,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142941938] [2021-05-02 23:03:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:09,085 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_372 10) (<= (+ v_main_~i~0_372 1) v_main_~n~0_66)) InVars {main_~i~0=v_main_~i~0_372, main_~n~0=v_main_~n~0_66} OutVars{main_~i~0=v_main_~i~0_372, main_~n~0=v_main_~n~0_66} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,098 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:09,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:09,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:09,143 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:09,169 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_374 1) v_main_~n~0_67) (<= 10 v_main_~i~0_374)) InVars {main_~i~0=v_main_~i~0_374, main_~n~0=v_main_~n~0_67} OutVars{main_~i~0=v_main_~i~0_374, main_~n~0=v_main_~n~0_67} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,173 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:09,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,189 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:09,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:09,210 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:09,223 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:09,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_376) (<= v_main_~i~0_376 v_main_~n~0_68)) InVars {main_~i~0=v_main_~i~0_376, main_~n~0=v_main_~n~0_68} OutVars{main_~i~0=v_main_~i~0_376, main_~n~0=v_main_~n~0_68} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,226 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:09,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,252 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:09,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:09,279 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:09,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_378 v_main_~n~0_69) (< v_main_~i~0_378 10)) InVars {main_~i~0=v_main_~i~0_378, main_~n~0=v_main_~n~0_69} OutVars{main_~i~0=v_main_~i~0_378, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,303 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:09,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:09,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:09,365 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:09,389 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:09,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:09,476 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:09,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:10,786 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:10,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142941938] [2021-05-02 23:03:10,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2142941938] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:10,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:10,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:03:10,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869782080] [2021-05-02 23:03:10,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:03:10,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:03:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3254, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:03:10,788 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 58 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 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:03:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:13,296 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:03:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:03:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 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:03:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:13,297 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:03:13,297 INFO L226 Difference]: Without dead ends: 80 [2021-05-02 23:03:13,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 2857.2ms TimeCoverageRelationStatistics Valid=449, Invalid=11761, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:03:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-02 23:03:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-02 23:03:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:03:13,304 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2021-05-02 23:03:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:13,305 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:03:13,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 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:03:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:03:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:03:13,305 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:13,305 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:13,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-02 23:03:13,305 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1993695250, now seen corresponding path program 13 times [2021-05-02 23:03:13,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:13,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639760428] [2021-05-02 23:03:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:13,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_403 10) (<= (+ v_main_~i~0_403 1) v_main_~n~0_70)) InVars {main_~i~0=v_main_~i~0_403, main_~n~0=v_main_~n~0_70} OutVars{main_~i~0=v_main_~i~0_403, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,314 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:13,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:13,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:13,360 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:13,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_405 1) v_main_~n~0_71) (<= 10 v_main_~i~0_405)) InVars {main_~i~0=v_main_~i~0_405, main_~n~0=v_main_~n~0_71} OutVars{main_~i~0=v_main_~i~0_405, main_~n~0=v_main_~n~0_71} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,381 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:13,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:13,405 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:13,428 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:13,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:13,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_407 v_main_~n~0_72) (<= 10 v_main_~i~0_407)) InVars {main_~i~0=v_main_~i~0_407, main_~n~0=v_main_~n~0_72} OutVars{main_~i~0=v_main_~i~0_407, main_~n~0=v_main_~n~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,449 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:13,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:13,479 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:13,492 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:13,514 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_409 v_main_~n~0_73) (< v_main_~i~0_409 10)) InVars {main_~i~0=v_main_~i~0_409, main_~n~0=v_main_~n~0_73} OutVars{main_~i~0=v_main_~i~0_409, main_~n~0=v_main_~n~0_73} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,516 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:13,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:13,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:13,566 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:13,589 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,668 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:13,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:15,048 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:15,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639760428] [2021-05-02 23:03:15,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1639760428] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:15,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:15,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:03:15,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991149152] [2021-05-02 23:03:15,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:03:15,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:03:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3487, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:03:15,050 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 58 states have internal predecessors, (73), 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,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:17,718 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-02 23:03:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:03:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 58 states have internal predecessors, (73), 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 77 [2021-05-02 23:03:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:17,719 INFO L225 Difference]: With dead ends: 91 [2021-05-02 23:03:17,720 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:03:17,721 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4149 ImplicationChecksByTransitivity, 2993.9ms TimeCoverageRelationStatistics Valid=464, Invalid=12646, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:03:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:03:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-05-02 23:03:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 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:03:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-02 23:03:17,729 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2021-05-02 23:03:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:17,729 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-02 23:03:17,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 58 states have internal predecessors, (73), 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,729 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-02 23:03:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 23:03:17,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:17,730 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:17,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-05-02 23:03:17,730 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -43004887, now seen corresponding path program 14 times [2021-05-02 23:03:17,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:17,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153204665] [2021-05-02 23:03:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:17,739 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_435 1) v_main_~n~0_74) (< v_main_~i~0_435 10)) InVars {main_~i~0=v_main_~i~0_435, main_~n~0=v_main_~n~0_74} OutVars{main_~i~0=v_main_~i~0_435, main_~n~0=v_main_~n~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,742 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:17,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:17,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:17,792 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:17,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_437 1) v_main_~n~0_75) (<= 10 v_main_~i~0_437)) InVars {main_~i~0=v_main_~i~0_437, main_~n~0=v_main_~n~0_75} OutVars{main_~i~0=v_main_~i~0_437, main_~n~0=v_main_~n~0_75} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,815 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:17,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:17,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:17,847 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:17,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:17,867 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_439) (<= v_main_~i~0_439 v_main_~n~0_76)) InVars {main_~i~0=v_main_~i~0_439, main_~n~0=v_main_~n~0_76} OutVars{main_~i~0=v_main_~i~0_439, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,868 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:17,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:17,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:17,903 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:17,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_441 v_main_~n~0_77) (< v_main_~i~0_441 10)) InVars {main_~i~0=v_main_~i~0_441, main_~n~0=v_main_~n~0_77} OutVars{main_~i~0=v_main_~i~0_441, main_~n~0=v_main_~n~0_77} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,920 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:17,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:17,942 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:17,968 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:17,994 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:18,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:18,072 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,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:19,584 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:19,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153204665] [2021-05-02 23:03:19,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1153204665] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:19,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:19,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:03:19,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268932375] [2021-05-02 23:03:19,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:03:19,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:03:19,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3728, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:03:19,586 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 62 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 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:03:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:22,401 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:03:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:03:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 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:03:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:22,402 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:03:22,402 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 23:03:22,403 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4480 ImplicationChecksByTransitivity, 3198.2ms TimeCoverageRelationStatistics Valid=479, Invalid=13563, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:03:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 23:03:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-02 23:03:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 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:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:03:22,410 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2021-05-02 23:03:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:22,411 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:03:22,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 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:03:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:03:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:03:22,411 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:22,412 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:22,412 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-02 23:03:22,412 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2066084366, now seen corresponding path program 15 times [2021-05-02 23:03:22,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:22,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108062098] [2021-05-02 23:03:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:22,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_468 10) (<= (+ v_main_~i~0_468 1) v_main_~n~0_78)) InVars {main_~i~0=v_main_~i~0_468, main_~n~0=v_main_~n~0_78} OutVars{main_~i~0=v_main_~i~0_468, main_~n~0=v_main_~n~0_78} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,432 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:22,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:22,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:22,481 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:22,504 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_470 1) v_main_~n~0_79) (<= 10 v_main_~i~0_470)) InVars {main_~i~0=v_main_~i~0_470, main_~n~0=v_main_~n~0_79} OutVars{main_~i~0=v_main_~i~0_470, main_~n~0=v_main_~n~0_79} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,505 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:22,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:22,518 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:22,537 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:22,551 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:22,553 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_472) (<= v_main_~i~0_472 v_main_~n~0_80)) InVars {main_~i~0=v_main_~i~0_472, main_~n~0=v_main_~n~0_80} OutVars{main_~i~0=v_main_~i~0_472, main_~n~0=v_main_~n~0_80} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,554 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:22,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:22,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:22,595 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:22,610 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_474 10) (<= v_main_~i~0_474 v_main_~n~0_81)) InVars {main_~i~0=v_main_~i~0_474, main_~n~0=v_main_~n~0_81} OutVars{main_~i~0=v_main_~i~0_474, main_~n~0=v_main_~n~0_81} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,612 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:22,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:22,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:22,683 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:22,702 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:22,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:22,788 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:22,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:24,416 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:24,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108062098] [2021-05-02 23:03:24,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1108062098] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:24,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:24,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:03:24,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839902996] [2021-05-02 23:03:24,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:03:24,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:03:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3977, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:03:24,418 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 62 states have internal predecessors, (79), 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:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:27,429 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-05-02 23:03:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-02 23:03:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 62 states have internal predecessors, (79), 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 83 [2021-05-02 23:03:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:27,430 INFO L225 Difference]: With dead ends: 97 [2021-05-02 23:03:27,430 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:03:27,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4821 ImplicationChecksByTransitivity, 3410.4ms TimeCoverageRelationStatistics Valid=494, Invalid=14512, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:03:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:03:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-05-02 23:03:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 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:03:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-05-02 23:03:27,440 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2021-05-02 23:03:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:27,441 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-05-02 23:03:27,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 62 states have internal predecessors, (79), 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:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-05-02 23:03:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-02 23:03:27,441 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:27,441 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 16, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:27,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-02 23:03:27,442 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1427519991, now seen corresponding path program 16 times [2021-05-02 23:03:27,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:27,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636483906] [2021-05-02 23:03:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:27,449 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_502 10) (<= (+ v_main_~i~0_502 1) v_main_~n~0_82)) InVars {main_~i~0=v_main_~i~0_502, main_~n~0=v_main_~n~0_82} OutVars{main_~i~0=v_main_~i~0_502, main_~n~0=v_main_~n~0_82} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,457 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:27,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:27,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:27,514 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:27,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_504 1) v_main_~n~0_83) (<= 10 v_main_~i~0_504)) InVars {main_~i~0=v_main_~i~0_504, main_~n~0=v_main_~n~0_83} OutVars{main_~i~0=v_main_~i~0_504, main_~n~0=v_main_~n~0_83} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,538 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:27,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:27,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:27,570 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:27,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:27,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_506 v_main_~n~0_84) (<= 10 v_main_~i~0_506)) InVars {main_~i~0=v_main_~i~0_506, main_~n~0=v_main_~n~0_84} OutVars{main_~i~0=v_main_~i~0_506, main_~n~0=v_main_~n~0_84} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,587 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:27,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:27,600 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:27,627 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:27,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_508 10) (<= v_main_~i~0_508 v_main_~n~0_85)) InVars {main_~i~0=v_main_~i~0_508, main_~n~0=v_main_~n~0_85} OutVars{main_~i~0=v_main_~i~0_508, main_~n~0=v_main_~n~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,645 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:27,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,647 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:27,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:27,690 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:27,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:27,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:27,775 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,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:29,462 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:29,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636483906] [2021-05-02 23:03:29,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [636483906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:29,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:29,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:03:29,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867985180] [2021-05-02 23:03:29,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:03:29,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:03:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=4234, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:03:29,463 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 64 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:03:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:32,630 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:03:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-02 23:03:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 64 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:03:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:32,631 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:03:32,631 INFO L226 Difference]: Without dead ends: 92 [2021-05-02 23:03:32,632 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5172 ImplicationChecksByTransitivity, 3575.5ms TimeCoverageRelationStatistics Valid=509, Invalid=15493, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:03:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-02 23:03:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-05-02 23:03:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:03:32,639 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2021-05-02 23:03:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:32,640 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:03:32,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 64 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:03:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:03:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:03:32,640 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:32,641 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 17, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:32,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-02 23:03:32,641 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash 547564590, now seen corresponding path program 17 times [2021-05-02 23:03:32,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:32,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278543015] [2021-05-02 23:03:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:32,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_537 1) v_main_~n~0_86) (< v_main_~i~0_537 10)) InVars {main_~i~0=v_main_~i~0_537, main_~n~0=v_main_~n~0_86} OutVars{main_~i~0=v_main_~i~0_537, main_~n~0=v_main_~n~0_86} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,661 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:32,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:32,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:32,716 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:32,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_539) (<= (+ v_main_~i~0_539 1) v_main_~n~0_87)) InVars {main_~i~0=v_main_~i~0_539, main_~n~0=v_main_~n~0_87} OutVars{main_~i~0=v_main_~i~0_539, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,742 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:32,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:32,763 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:32,774 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:32,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:32,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_541) (<= v_main_~i~0_541 v_main_~n~0_88)) InVars {main_~i~0=v_main_~i~0_541, main_~n~0=v_main_~n~0_88} OutVars{main_~i~0=v_main_~i~0_541, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,790 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:32,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:32,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:32,823 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:32,844 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_543 10) (<= v_main_~i~0_543 v_main_~n~0_89)) InVars {main_~i~0=v_main_~i~0_543, main_~n~0=v_main_~n~0_89} OutVars{main_~i~0=v_main_~i~0_543, main_~n~0=v_main_~n~0_89} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,846 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:32,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:32,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:32,901 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:32,921 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:32,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:33,001 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:33,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:34,744 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:34,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278543015] [2021-05-02 23:03:34,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [278543015] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:34,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:34,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:03:34,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089760937] [2021-05-02 23:03:34,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:03:34,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:03:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=4499, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:03:34,746 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 68 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 66 states have internal predecessors, (85), 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:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:38,130 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-05-02 23:03:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 23:03:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 66 states have internal predecessors, (85), 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 89 [2021-05-02 23:03:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:38,131 INFO L225 Difference]: With dead ends: 103 [2021-05-02 23:03:38,131 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:03:38,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5533 ImplicationChecksByTransitivity, 3763.0ms TimeCoverageRelationStatistics Valid=524, Invalid=16506, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:03:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:03:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-02 23:03:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 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:03:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-02 23:03:38,142 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2021-05-02 23:03:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:38,142 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-02 23:03:38,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 66 states have internal predecessors, (85), 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:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-02 23:03:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-02 23:03:38,143 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:38,143 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 18, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:38,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-05-02 23:03:38,143 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash -759638039, now seen corresponding path program 18 times [2021-05-02 23:03:38,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:38,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799571320] [2021-05-02 23:03:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:38,150 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_573 10) (<= (+ v_main_~i~0_573 1) v_main_~n~0_90)) InVars {main_~i~0=v_main_~i~0_573, main_~n~0=v_main_~n~0_90} OutVars{main_~i~0=v_main_~i~0_573, main_~n~0=v_main_~n~0_90} AuxVars[] AssignedVars[] [2021-05-02 23:03:38,151 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:38,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:38,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:38,203 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:38,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_575 1) v_main_~n~0_91) (<= 10 v_main_~i~0_575)) InVars {main_~i~0=v_main_~i~0_575, main_~n~0=v_main_~n~0_91} OutVars{main_~i~0=v_main_~i~0_575, main_~n~0=v_main_~n~0_91} AuxVars[] AssignedVars[] [2021-05-02 23:03:38,240 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:38,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,263 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:38,280 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:38,291 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:38,306 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:38,307 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_577 v_main_~n~0_92) (<= 10 v_main_~i~0_577)) InVars {main_~i~0=v_main_~i~0_577, main_~n~0=v_main_~n~0_92} OutVars{main_~i~0=v_main_~i~0_577, main_~n~0=v_main_~n~0_92} AuxVars[] AssignedVars[] [2021-05-02 23:03:38,308 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:38,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:38,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:38,342 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:38,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_579 10) (<= v_main_~i~0_579 v_main_~n~0_93)) InVars {main_~i~0=v_main_~i~0_579, main_~n~0=v_main_~n~0_93} OutVars{main_~i~0=v_main_~i~0_579, main_~n~0=v_main_~n~0_93} AuxVars[] AssignedVars[] [2021-05-02 23:03:38,359 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:38,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:38,386 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:38,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:38,405 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:38,425 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:38,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:38,501 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:38,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:40,409 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:40,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799571320] [2021-05-02 23:03:40,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [799571320] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:40,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:40,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:03:40,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389458876] [2021-05-02 23:03:40,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:03:40,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:03:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4772, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:03:40,410 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 70 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 68 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:03:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:43,949 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:03:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 23:03:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 68 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:03:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:43,950 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:03:43,950 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 23:03:43,951 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5904 ImplicationChecksByTransitivity, 4013.1ms TimeCoverageRelationStatistics Valid=539, Invalid=17551, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 23:03:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 23:03:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-05-02 23:03:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:03:43,960 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2021-05-02 23:03:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:43,960 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:03:43,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 68 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:03:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:03:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:03:43,961 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:43,961 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:43,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-02 23:03:43,961 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1164685746, now seen corresponding path program 19 times [2021-05-02 23:03:43,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:43,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170161636] [2021-05-02 23:03:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:43,969 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_610 1) v_main_~n~0_94) (< v_main_~i~0_610 10)) InVars {main_~i~0=v_main_~i~0_610, main_~n~0=v_main_~n~0_94} OutVars{main_~i~0=v_main_~i~0_610, main_~n~0=v_main_~n~0_94} AuxVars[] AssignedVars[] [2021-05-02 23:03:43,970 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:43,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:43,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:43,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:43,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:44,016 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:44,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_612) (<= (+ v_main_~i~0_612 1) v_main_~n~0_95)) InVars {main_~i~0=v_main_~i~0_612, main_~n~0=v_main_~n~0_95} OutVars{main_~i~0=v_main_~i~0_612, main_~n~0=v_main_~n~0_95} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,040 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:44,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:44,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:44,072 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:44,086 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:44,088 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_614 v_main_~n~0_96) (<= 10 v_main_~i~0_614)) InVars {main_~i~0=v_main_~i~0_614, main_~n~0=v_main_~n~0_96} OutVars{main_~i~0=v_main_~i~0_614, main_~n~0=v_main_~n~0_96} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,089 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:44,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:44,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:44,128 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:44,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_616 10) (<= v_main_~i~0_616 v_main_~n~0_97)) InVars {main_~i~0=v_main_~i~0_616, main_~n~0=v_main_~n~0_97} OutVars{main_~i~0=v_main_~i~0_616, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,161 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:44,162 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:44,179 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:44,207 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:44,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:44,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:44,305 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:44,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:46,306 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:46,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170161636] [2021-05-02 23:03:46,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [170161636] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:46,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:46,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-02 23:03:46,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955414177] [2021-05-02 23:03:46,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-02 23:03:46,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-02 23:03:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=5053, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:03:46,308 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 72 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 70 states have internal predecessors, (91), 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:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:50,092 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-05-02 23:03:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-02 23:03:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 70 states have internal predecessors, (91), 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 95 [2021-05-02 23:03:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:50,093 INFO L225 Difference]: With dead ends: 109 [2021-05-02 23:03:50,093 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:03:50,094 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6285 ImplicationChecksByTransitivity, 4186.2ms TimeCoverageRelationStatistics Valid=554, Invalid=18628, Unknown=0, NotChecked=0, Total=19182 [2021-05-02 23:03:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:03:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-05-02 23:03:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 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:03:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-05-02 23:03:50,114 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2021-05-02 23:03:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:50,114 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-05-02 23:03:50,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 70 states have internal predecessors, (91), 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:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-05-02 23:03:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:03:50,115 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:50,115 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 20, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:50,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-05-02 23:03:50,115 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 917176777, now seen corresponding path program 20 times [2021-05-02 23:03:50,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:50,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863596310] [2021-05-02 23:03:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:50,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_648 10) (<= (+ v_main_~i~0_648 1) v_main_~n~0_98)) InVars {main_~i~0=v_main_~i~0_648, main_~n~0=v_main_~n~0_98} OutVars{main_~i~0=v_main_~i~0_648, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,126 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:50,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,128 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:50,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:50,170 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:50,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_650) (<= (+ v_main_~i~0_650 1) v_main_~n~0_99)) InVars {main_~i~0=v_main_~i~0_650, main_~n~0=v_main_~n~0_99} OutVars{main_~i~0=v_main_~i~0_650, main_~n~0=v_main_~n~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,196 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:50,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:50,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:50,228 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:50,243 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:50,244 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_652 v_main_~n~0_100) (<= 10 v_main_~i~0_652)) InVars {main_~i~0=v_main_~i~0_652, main_~n~0=v_main_~n~0_100} OutVars{main_~i~0=v_main_~i~0_652, main_~n~0=v_main_~n~0_100} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,245 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:50,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,258 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:50,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:50,279 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:50,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_654 v_main_~n~0_101) (< v_main_~i~0_654 10)) InVars {main_~i~0=v_main_~i~0_654, main_~n~0=v_main_~n~0_101} OutVars{main_~i~0=v_main_~i~0_654, main_~n~0=v_main_~n~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,297 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:50,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:50,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:50,358 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:50,378 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:50,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:50,461 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:50,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:52,565 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:52,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863596310] [2021-05-02 23:03:52,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863596310] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:52,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:52,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-02 23:03:52,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664892624] [2021-05-02 23:03:52,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-02 23:03:52,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-02 23:03:52,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=5342, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:03:52,567 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 72 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:03:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:56,522 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:03:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-02 23:03:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 72 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:03:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:56,523 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:03:56,523 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 23:03:56,524 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6676 ImplicationChecksByTransitivity, 4410.2ms TimeCoverageRelationStatistics Valid=569, Invalid=19737, Unknown=0, NotChecked=0, Total=20306 [2021-05-02 23:03:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 23:03:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-05-02 23:03:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:03:56,537 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2021-05-02 23:03:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:56,537 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:03:56,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 72 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:03:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:03:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:03:56,538 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:56,538 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:56,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-02 23:03:56,538 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1939122066, now seen corresponding path program 21 times [2021-05-02 23:03:56,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:56,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [354214667] [2021-05-02 23:03:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:56,547 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_687 1) v_main_~n~0_102) (< v_main_~i~0_687 10)) InVars {main_~i~0=v_main_~i~0_687, main_~n~0=v_main_~n~0_102} OutVars{main_~i~0=v_main_~i~0_687, main_~n~0=v_main_~n~0_102} AuxVars[] AssignedVars[] [2021-05-02 23:03:56,549 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:03:56,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:56,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:56,609 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:03:56,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_689 1) v_main_~n~0_103) (<= 10 v_main_~i~0_689)) InVars {main_~i~0=v_main_~i~0_689, main_~n~0=v_main_~n~0_103} OutVars{main_~i~0=v_main_~i~0_689, main_~n~0=v_main_~n~0_103} AuxVars[] AssignedVars[] [2021-05-02 23:03:56,643 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:03:56,654 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:56,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:56,679 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:03:56,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:56,696 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_691) (<= v_main_~i~0_691 v_main_~n~0_104)) InVars {main_~i~0=v_main_~i~0_691, main_~n~0=v_main_~n~0_104} OutVars{main_~i~0=v_main_~i~0_691, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[] [2021-05-02 23:03:56,697 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:03:56,698 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,699 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:56,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:56,731 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:03:56,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_693 v_main_~n~0_105) (< v_main_~i~0_693 10)) InVars {main_~i~0=v_main_~i~0_693, main_~n~0=v_main_~n~0_105} OutVars{main_~i~0=v_main_~i~0_693, main_~n~0=v_main_~n~0_105} AuxVars[] AssignedVars[] [2021-05-02 23:03:56,750 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:03:56,764 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:56,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:56,785 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:56,800 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:03:56,821 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:56,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:56,906 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,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:59,109 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:59,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [354214667] [2021-05-02 23:03:59,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [354214667] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:59,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:59,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-02 23:03:59,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511120070] [2021-05-02 23:03:59,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-02 23:03:59,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-02 23:03:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5639, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:03:59,111 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 76 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 74 states have internal predecessors, (97), 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:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:03,305 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2021-05-02 23:04:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-02 23:04:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 74 states have internal predecessors, (97), 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 101 [2021-05-02 23:04:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:03,307 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:04:03,307 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:04:03,308 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7077 ImplicationChecksByTransitivity, 4606.2ms TimeCoverageRelationStatistics Valid=584, Invalid=20878, Unknown=0, NotChecked=0, Total=21462 [2021-05-02 23:04:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:04:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-05-02 23:04:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 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:04:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-05-02 23:04:03,319 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2021-05-02 23:04:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:03,320 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-05-02 23:04:03,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 74 states have internal predecessors, (97), 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:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-05-02 23:04:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 23:04:03,320 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:03,320 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:03,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-02 23:04:03,320 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2045885527, now seen corresponding path program 22 times [2021-05-02 23:04:03,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:03,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101677400] [2021-05-02 23:04:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:03,327 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_727 10) (<= (+ v_main_~i~0_727 1) v_main_~n~0_106)) InVars {main_~i~0=v_main_~i~0_727, main_~n~0=v_main_~n~0_106} OutVars{main_~i~0=v_main_~i~0_727, main_~n~0=v_main_~n~0_106} AuxVars[] AssignedVars[] [2021-05-02 23:04:03,329 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:03,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:03,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:03,378 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:03,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_729) (<= (+ v_main_~i~0_729 1) v_main_~n~0_107)) InVars {main_~i~0=v_main_~i~0_729, main_~n~0=v_main_~n~0_107} OutVars{main_~i~0=v_main_~i~0_729, main_~n~0=v_main_~n~0_107} AuxVars[] AssignedVars[] [2021-05-02 23:04:03,402 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:03,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:03,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:03,436 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:03,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:03,453 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_731) (<= v_main_~i~0_731 v_main_~n~0_108)) InVars {main_~i~0=v_main_~i~0_731, main_~n~0=v_main_~n~0_108} OutVars{main_~i~0=v_main_~i~0_731, main_~n~0=v_main_~n~0_108} AuxVars[] AssignedVars[] [2021-05-02 23:04:03,454 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:03,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:03,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:03,486 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:03,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_733 v_main_~n~0_109) (< v_main_~i~0_733 10)) InVars {main_~i~0=v_main_~i~0_733, main_~n~0=v_main_~n~0_109} OutVars{main_~i~0=v_main_~i~0_733, main_~n~0=v_main_~n~0_109} AuxVars[] AssignedVars[] [2021-05-02 23:04:03,505 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:03,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:03,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:03,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:03,556 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:03,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:03,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:03,652 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,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:06,012 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:06,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101677400] [2021-05-02 23:04:06,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1101677400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:06,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:06,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-02 23:04:06,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911384366] [2021-05-02 23:04:06,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-02 23:04:06,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-02 23:04:06,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=5944, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:04:06,014 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 78 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 76 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:04:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:10,487 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:04:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-02 23:04:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 76 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:04:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:10,489 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:04:10,489 INFO L226 Difference]: Without dead ends: 110 [2021-05-02 23:04:10,490 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7488 ImplicationChecksByTransitivity, 4919.5ms TimeCoverageRelationStatistics Valid=599, Invalid=22051, Unknown=0, NotChecked=0, Total=22650 [2021-05-02 23:04:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-05-02 23:04:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-05-02 23:04:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 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:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:04:10,503 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2021-05-02 23:04:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:04:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 76 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:04:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:04:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:04:10,504 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:10,504 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:10,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-05-02 23:04:10,504 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash -65385842, now seen corresponding path program 23 times [2021-05-02 23:04:10,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:10,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840998840] [2021-05-02 23:04:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:10,512 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_768 1) v_main_~n~0_110) (< v_main_~i~0_768 10)) InVars {main_~i~0=v_main_~i~0_768, main_~n~0=v_main_~n~0_110} OutVars{main_~i~0=v_main_~i~0_768, main_~n~0=v_main_~n~0_110} AuxVars[] AssignedVars[] [2021-05-02 23:04:10,513 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:10,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,529 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:10,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:10,564 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:10,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_770) (<= (+ v_main_~i~0_770 1) v_main_~n~0_111)) InVars {main_~i~0=v_main_~i~0_770, main_~n~0=v_main_~n~0_111} OutVars{main_~i~0=v_main_~i~0_770, main_~n~0=v_main_~n~0_111} AuxVars[] AssignedVars[] [2021-05-02 23:04:10,586 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:10,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,599 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:10,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:10,622 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:10,636 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:10,638 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_772 v_main_~n~0_112) (<= 10 v_main_~i~0_772)) InVars {main_~i~0=v_main_~i~0_772, main_~n~0=v_main_~n~0_112} OutVars{main_~i~0=v_main_~i~0_772, main_~n~0=v_main_~n~0_112} AuxVars[] AssignedVars[] [2021-05-02 23:04:10,645 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:10,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,647 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:10,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:10,685 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:10,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_774 v_main_~n~0_113) (< v_main_~i~0_774 10)) InVars {main_~i~0=v_main_~i~0_774, main_~n~0=v_main_~n~0_113} OutVars{main_~i~0=v_main_~i~0_774, main_~n~0=v_main_~n~0_113} AuxVars[] AssignedVars[] [2021-05-02 23:04:10,703 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:10,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:10,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:10,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:10,758 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:10,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:10,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:10,860 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,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:13,336 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:13,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840998840] [2021-05-02 23:04:13,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1840998840] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:13,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:13,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-02 23:04:13,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193607961] [2021-05-02 23:04:13,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-02 23:04:13,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:13,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-02 23:04:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=6257, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:04:13,338 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 80 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 78 states have internal predecessors, (103), 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:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:18,117 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-05-02 23:04:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-02 23:04:18,118 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 78 states have internal predecessors, (103), 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 107 [2021-05-02 23:04:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:18,118 INFO L225 Difference]: With dead ends: 121 [2021-05-02 23:04:18,118 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:04:18,119 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7909 ImplicationChecksByTransitivity, 5204.8ms TimeCoverageRelationStatistics Valid=614, Invalid=23256, Unknown=0, NotChecked=0, Total=23870 [2021-05-02 23:04:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:04:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-05-02 23:04:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 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:04:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2021-05-02 23:04:18,129 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2021-05-02 23:04:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2021-05-02 23:04:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 78 states have internal predecessors, (103), 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:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2021-05-02 23:04:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-02 23:04:18,130 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:18,130 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 24, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:18,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-05-02 23:04:18,130 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1034984841, now seen corresponding path program 24 times [2021-05-02 23:04:18,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:18,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932769661] [2021-05-02 23:04:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:18,147 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_810 10) (<= (+ v_main_~i~0_810 1) v_main_~n~0_114)) InVars {main_~i~0=v_main_~i~0_810, main_~n~0=v_main_~n~0_114} OutVars{main_~i~0=v_main_~i~0_810, main_~n~0=v_main_~n~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:04:18,149 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:18,151 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,168 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:18,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:18,203 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:18,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_812) (<= (+ v_main_~i~0_812 1) v_main_~n~0_115)) InVars {main_~i~0=v_main_~i~0_812, main_~n~0=v_main_~n~0_115} OutVars{main_~i~0=v_main_~i~0_812, main_~n~0=v_main_~n~0_115} AuxVars[] AssignedVars[] [2021-05-02 23:04:18,233 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:18,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:18,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:18,271 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:18,287 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:18,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_814 v_main_~n~0_116) (<= 10 v_main_~i~0_814)) InVars {main_~i~0=v_main_~i~0_814, main_~n~0=v_main_~n~0_116} OutVars{main_~i~0=v_main_~i~0_814, main_~n~0=v_main_~n~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:04:18,290 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:18,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:18,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:18,333 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:18,351 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_816 10) (<= v_main_~i~0_816 v_main_~n~0_117)) InVars {main_~i~0=v_main_~i~0_816, main_~n~0=v_main_~n~0_117} OutVars{main_~i~0=v_main_~i~0_816, main_~n~0=v_main_~n~0_117} AuxVars[] AssignedVars[] [2021-05-02 23:04:18,353 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:18,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:18,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:18,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:18,404 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:18,429 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:18,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:18,510 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,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:21,320 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:21,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932769661] [2021-05-02 23:04:21,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1932769661] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:21,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:21,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-02 23:04:21,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747577819] [2021-05-02 23:04:21,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-02 23:04:21,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-02 23:04:21,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=6578, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:04:21,322 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 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:04:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:26,232 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:04:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-02 23:04:26,233 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 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:04:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:26,233 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:04:26,234 INFO L226 Difference]: Without dead ends: 116 [2021-05-02 23:04:26,234 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8340 ImplicationChecksByTransitivity, 5600.3ms TimeCoverageRelationStatistics Valid=629, Invalid=24493, Unknown=0, NotChecked=0, Total=25122 [2021-05-02 23:04:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-02 23:04:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-05-02 23:04:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:04:26,248 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2021-05-02 23:04:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:26,248 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:04:26,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 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:04:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:04:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:04:26,249 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:26,249 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:26,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-05-02 23:04:26,249 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1307368274, now seen corresponding path program 25 times [2021-05-02 23:04:26,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:26,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416563788] [2021-05-02 23:04:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:26,257 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_853 10) (<= (+ v_main_~i~0_853 1) v_main_~n~0_118)) InVars {main_~i~0=v_main_~i~0_853, main_~n~0=v_main_~n~0_118} OutVars{main_~i~0=v_main_~i~0_853, main_~n~0=v_main_~n~0_118} AuxVars[] AssignedVars[] [2021-05-02 23:04:26,259 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:26,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,275 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:26,281 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:26,314 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:26,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_855) (<= (+ v_main_~i~0_855 1) v_main_~n~0_119)) InVars {main_~i~0=v_main_~i~0_855, main_~n~0=v_main_~n~0_119} OutVars{main_~i~0=v_main_~i~0_855, main_~n~0=v_main_~n~0_119} AuxVars[] AssignedVars[] [2021-05-02 23:04:26,340 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:26,340 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,359 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:26,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:26,384 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:26,400 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:26,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_857) (<= v_main_~i~0_857 v_main_~n~0_120)) InVars {main_~i~0=v_main_~i~0_857, main_~n~0=v_main_~n~0_120} OutVars{main_~i~0=v_main_~i~0_857, main_~n~0=v_main_~n~0_120} AuxVars[] AssignedVars[] [2021-05-02 23:04:26,407 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:26,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:26,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:26,442 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:26,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_859 10) (<= v_main_~i~0_859 v_main_~n~0_121)) InVars {main_~i~0=v_main_~i~0_859, main_~n~0=v_main_~n~0_121} OutVars{main_~i~0=v_main_~i~0_859, main_~n~0=v_main_~n~0_121} AuxVars[] AssignedVars[] [2021-05-02 23:04:26,464 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:26,480 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:26,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:26,500 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:26,517 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:26,541 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:26,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:26,624 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,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:29,383 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:29,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416563788] [2021-05-02 23:04:29,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [416563788] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:29,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:29,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-02 23:04:29,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993592633] [2021-05-02 23:04:29,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-02 23:04:29,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-02 23:04:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=6907, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:04:29,385 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 84 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 82 states have internal predecessors, (109), 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:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:34,552 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2021-05-02 23:04:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-02 23:04:34,552 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 82 states have internal predecessors, (109), 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 113 [2021-05-02 23:04:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:34,553 INFO L225 Difference]: With dead ends: 127 [2021-05-02 23:04:34,553 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:04:34,554 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 5709.6ms TimeCoverageRelationStatistics Valid=644, Invalid=25762, Unknown=0, NotChecked=0, Total=26406 [2021-05-02 23:04:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:04:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2021-05-02 23:04:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 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:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2021-05-02 23:04:34,566 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2021-05-02 23:04:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:34,566 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2021-05-02 23:04:34,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 82 states have internal predecessors, (109), 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:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2021-05-02 23:04:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-02 23:04:34,567 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:34,567 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:34,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-05-02 23:04:34,567 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2015359127, now seen corresponding path program 26 times [2021-05-02 23:04:34,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:34,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [435170784] [2021-05-02 23:04:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:34,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_897 10) (<= (+ v_main_~i~0_897 1) v_main_~n~0_122)) InVars {main_~i~0=v_main_~i~0_897, main_~n~0=v_main_~n~0_122} OutVars{main_~i~0=v_main_~i~0_897, main_~n~0=v_main_~n~0_122} AuxVars[] AssignedVars[] [2021-05-02 23:04:34,576 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:34,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:34,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:34,638 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:34,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_899 1) v_main_~n~0_123) (<= 10 v_main_~i~0_899)) InVars {main_~i~0=v_main_~i~0_899, main_~n~0=v_main_~n~0_123} OutVars{main_~i~0=v_main_~i~0_899, main_~n~0=v_main_~n~0_123} AuxVars[] AssignedVars[] [2021-05-02 23:04:34,664 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:34,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:34,678 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:34,698 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:34,714 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:34,716 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_901 v_main_~n~0_124) (<= 10 v_main_~i~0_901)) InVars {main_~i~0=v_main_~i~0_901, main_~n~0=v_main_~n~0_124} OutVars{main_~i~0=v_main_~i~0_901, main_~n~0=v_main_~n~0_124} AuxVars[] AssignedVars[] [2021-05-02 23:04:34,717 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:34,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:34,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:34,763 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:34,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_903 10) (<= v_main_~i~0_903 v_main_~n~0_125)) InVars {main_~i~0=v_main_~i~0_903, main_~n~0=v_main_~n~0_125} OutVars{main_~i~0=v_main_~i~0_903, main_~n~0=v_main_~n~0_125} AuxVars[] AssignedVars[] [2021-05-02 23:04:34,782 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:34,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:34,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:34,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:34,834 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:34,856 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:34,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:34,931 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:34,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:37,856 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:37,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [435170784] [2021-05-02 23:04:37,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [435170784] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:37,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:37,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-02 23:04:37,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790854960] [2021-05-02 23:04:37,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-02 23:04:37,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:37,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-02 23:04:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=7244, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:04:37,858 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 86 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 84 states have internal predecessors, (112), 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:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:43,308 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:04:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-02 23:04:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 84 states have internal predecessors, (112), 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 116 [2021-05-02 23:04:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:43,310 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:04:43,310 INFO L226 Difference]: Without dead ends: 122 [2021-05-02 23:04:43,311 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9232 ImplicationChecksByTransitivity, 6019.2ms TimeCoverageRelationStatistics Valid=659, Invalid=27063, Unknown=0, NotChecked=0, Total=27722 [2021-05-02 23:04:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-02 23:04:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-05-02 23:04:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 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:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:04:43,324 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2021-05-02 23:04:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:43,324 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:04:43,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 84 states have internal predecessors, (112), 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:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:04:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:04:43,325 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:43,325 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:43,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-02 23:04:43,325 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1186470194, now seen corresponding path program 27 times [2021-05-02 23:04:43,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:43,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468937055] [2021-05-02 23:04:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:43,333 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_942 1) v_main_~n~0_126) (< v_main_~i~0_942 10)) InVars {main_~i~0=v_main_~i~0_942, main_~n~0=v_main_~n~0_126} OutVars{main_~i~0=v_main_~i~0_942, main_~n~0=v_main_~n~0_126} AuxVars[] AssignedVars[] [2021-05-02 23:04:43,334 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:43,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:43,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:43,384 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:43,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_944) (<= (+ v_main_~i~0_944 1) v_main_~n~0_127)) InVars {main_~i~0=v_main_~i~0_944, main_~n~0=v_main_~n~0_127} OutVars{main_~i~0=v_main_~i~0_944, main_~n~0=v_main_~n~0_127} AuxVars[] AssignedVars[] [2021-05-02 23:04:43,411 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:43,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,446 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:43,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:43,465 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:43,485 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:43,487 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_946 v_main_~n~0_128) (<= 10 v_main_~i~0_946)) InVars {main_~i~0=v_main_~i~0_946, main_~n~0=v_main_~n~0_128} OutVars{main_~i~0=v_main_~i~0_946, main_~n~0=v_main_~n~0_128} AuxVars[] AssignedVars[] [2021-05-02 23:04:43,489 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:43,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:43,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:43,534 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:43,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_948 10) (<= v_main_~i~0_948 v_main_~n~0_129)) InVars {main_~i~0=v_main_~i~0_948, main_~n~0=v_main_~n~0_129} OutVars{main_~i~0=v_main_~i~0_948, main_~n~0=v_main_~n~0_129} AuxVars[] AssignedVars[] [2021-05-02 23:04:43,554 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:43,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:43,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:43,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:43,606 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:43,629 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:43,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:43,715 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:43,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:46,826 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:46,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468937055] [2021-05-02 23:04:46,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [468937055] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:46,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:46,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-02 23:04:46,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001643901] [2021-05-02 23:04:46,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-02 23:04:46,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-02 23:04:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=7589, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:04:46,828 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 88 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 86 states have internal predecessors, (115), 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:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:52,770 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2021-05-02 23:04:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-02 23:04:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 86 states have internal predecessors, (115), 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 119 [2021-05-02 23:04:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:52,771 INFO L225 Difference]: With dead ends: 133 [2021-05-02 23:04:52,771 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:04:52,772 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9693 ImplicationChecksByTransitivity, 6427.1ms TimeCoverageRelationStatistics Valid=674, Invalid=28396, Unknown=0, NotChecked=0, Total=29070 [2021-05-02 23:04:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:04:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-05-02 23:04:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 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:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2021-05-02 23:04:52,784 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2021-05-02 23:04:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:52,784 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2021-05-02 23:04:52,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 86 states have internal predecessors, (115), 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:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2021-05-02 23:04:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 23:04:52,785 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:52,785 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 28, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:52,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-05-02 23:04:52,785 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 476748105, now seen corresponding path program 28 times [2021-05-02 23:04:52,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:52,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558917305] [2021-05-02 23:04:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:52,794 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_988 1) v_main_~n~0_130) (< v_main_~i~0_988 10)) InVars {main_~i~0=v_main_~i~0_988, main_~n~0=v_main_~n~0_130} OutVars{main_~i~0=v_main_~i~0_988, main_~n~0=v_main_~n~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:04:52,797 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:04:52,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:52,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:52,860 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:04:52,891 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_990 1) v_main_~n~0_131) (<= 10 v_main_~i~0_990)) InVars {main_~i~0=v_main_~i~0_990, main_~n~0=v_main_~n~0_131} OutVars{main_~i~0=v_main_~i~0_990, main_~n~0=v_main_~n~0_131} AuxVars[] AssignedVars[] [2021-05-02 23:04:52,893 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:04:52,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,895 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:52,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:52,939 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:04:52,961 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:52,963 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_992) (<= v_main_~i~0_992 v_main_~n~0_132)) InVars {main_~i~0=v_main_~i~0_992, main_~n~0=v_main_~n~0_132} OutVars{main_~i~0=v_main_~i~0_992, main_~n~0=v_main_~n~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:04:52,965 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:04:52,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:52,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:52,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:53,006 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:04:53,030 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_994 10) (<= v_main_~i~0_994 v_main_~n~0_133)) InVars {main_~i~0=v_main_~i~0_994, main_~n~0=v_main_~n~0_133} OutVars{main_~i~0=v_main_~i~0_994, main_~n~0=v_main_~n~0_133} AuxVars[] AssignedVars[] [2021-05-02 23:04:53,032 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:04:53,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:53,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:53,088 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:04:53,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:53,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:53,184 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:53,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:56,385 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:56,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558917305] [2021-05-02 23:04:56,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [558917305] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:56,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:56,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-02 23:04:56,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61528332] [2021-05-02 23:04:56,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-02 23:04:56,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-02 23:04:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=7942, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:04:56,386 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 90 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 88 states have internal predecessors, (118), 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,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:02,593 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-02 23:05:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-02 23:05:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 88 states have internal predecessors, (118), 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 122 [2021-05-02 23:05:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:02,595 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:05:02,595 INFO L226 Difference]: Without dead ends: 128 [2021-05-02 23:05:02,596 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10164 ImplicationChecksByTransitivity, 6690.1ms TimeCoverageRelationStatistics Valid=689, Invalid=29761, Unknown=0, NotChecked=0, Total=30450 [2021-05-02 23:05:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-05-02 23:05:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-05-02 23:05:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:05:02,612 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2021-05-02 23:05:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:02,612 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:05:02,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 88 states have internal predecessors, (118), 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,612 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:05:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:05:02,613 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:02,613 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 29, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:02,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-05-02 23:05:02,613 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1624600338, now seen corresponding path program 29 times [2021-05-02 23:05:02,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:02,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2009661642] [2021-05-02 23:05:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:02,622 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1035 1) v_main_~n~0_134) (< v_main_~i~0_1035 10)) InVars {main_~i~0=v_main_~i~0_1035, main_~n~0=v_main_~n~0_134} OutVars{main_~i~0=v_main_~i~0_1035, main_~n~0=v_main_~n~0_134} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,623 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:05:02,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,643 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:02,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:02,688 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:05:02,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1037 1) v_main_~n~0_135) (<= 10 v_main_~i~0_1037)) InVars {main_~i~0=v_main_~i~0_1037, main_~n~0=v_main_~n~0_135} OutVars{main_~i~0=v_main_~i~0_1037, main_~n~0=v_main_~n~0_135} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,721 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:05:02,734 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,736 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:02,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:02,761 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:05:02,778 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:02,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1039 v_main_~n~0_136) (<= 10 v_main_~i~0_1039)) InVars {main_~i~0=v_main_~i~0_1039, main_~n~0=v_main_~n~0_136} OutVars{main_~i~0=v_main_~i~0_1039, main_~n~0=v_main_~n~0_136} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,781 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:05:02,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:02,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:02,820 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:05:02,838 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1041 v_main_~n~0_137) (< v_main_~i~0_1041 10)) InVars {main_~i~0=v_main_~i~0_1041, main_~n~0=v_main_~n~0_137} OutVars{main_~i~0=v_main_~i~0_1041, main_~n~0=v_main_~n~0_137} AuxVars[] AssignedVars[] [2021-05-02 23:05:02,840 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:05:02,859 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:02,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:02,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:02,908 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:05:02,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:03,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:03,033 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:03,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:06,840 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:06,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2009661642] [2021-05-02 23:05:06,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2009661642] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:06,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:06,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2021-05-02 23:05:06,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043246563] [2021-05-02 23:05:06,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2021-05-02 23:05:06,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-05-02 23:05:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=8303, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:05:06,841 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 90 states have internal predecessors, (121), 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,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:14,034 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-05-02 23:05:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-05-02 23:05:14,035 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 90 states have internal predecessors, (121), 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 125 [2021-05-02 23:05:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:14,036 INFO L225 Difference]: With dead ends: 139 [2021-05-02 23:05:14,036 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:05:14,037 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10645 ImplicationChecksByTransitivity, 7811.3ms TimeCoverageRelationStatistics Valid=704, Invalid=31158, Unknown=0, NotChecked=0, Total=31862 [2021-05-02 23:05:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:05:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2021-05-02 23:05:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 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,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2021-05-02 23:05:14,053 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 125 [2021-05-02 23:05:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:14,053 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2021-05-02 23:05:14,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 90 states have internal predecessors, (121), 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,053 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2021-05-02 23:05:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 23:05:14,053 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:14,054 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 30, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:14,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-05-02 23:05:14,054 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash 547240745, now seen corresponding path program 30 times [2021-05-02 23:05:14,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:14,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613818530] [2021-05-02 23:05:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:14,061 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1083 10) (<= (+ v_main_~i~0_1083 1) v_main_~n~0_138)) InVars {main_~i~0=v_main_~i~0_1083, main_~n~0=v_main_~n~0_138} OutVars{main_~i~0=v_main_~i~0_1083, main_~n~0=v_main_~n~0_138} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,062 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:05:14,063 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:14,085 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:14,119 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:05:14,151 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1085 1) v_main_~n~0_139) (<= 10 v_main_~i~0_1085)) InVars {main_~i~0=v_main_~i~0_1085, main_~n~0=v_main_~n~0_139} OutVars{main_~i~0=v_main_~i~0_1085, main_~n~0=v_main_~n~0_139} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,152 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:05:14,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:14,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:14,193 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:05:14,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:14,211 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1087 v_main_~n~0_140) (<= 10 v_main_~i~0_1087)) InVars {main_~i~0=v_main_~i~0_1087, main_~n~0=v_main_~n~0_140} OutVars{main_~i~0=v_main_~i~0_1087, main_~n~0=v_main_~n~0_140} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,213 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:05:14,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,238 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:14,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:14,253 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:05:14,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1089 v_main_~n~0_141) (< v_main_~i~0_1089 10)) InVars {main_~i~0=v_main_~i~0_1089, main_~n~0=v_main_~n~0_141} OutVars{main_~i~0=v_main_~i~0_1089, main_~n~0=v_main_~n~0_141} AuxVars[] AssignedVars[] [2021-05-02 23:05:14,279 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:05:14,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:14,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:14,322 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:14,339 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:05:14,365 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:14,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:14,446 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:14,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:18,229 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:18,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613818530] [2021-05-02 23:05:18,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [613818530] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:18,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:18,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-02 23:05:18,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568533516] [2021-05-02 23:05:18,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-02 23:05:18,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-02 23:05:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=8672, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:05:18,231 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 92 states have internal predecessors, (124), 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:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:25,332 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-02 23:05:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-05-02 23:05:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 92 states have internal predecessors, (124), 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 128 [2021-05-02 23:05:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:25,334 INFO L225 Difference]: With dead ends: 142 [2021-05-02 23:05:25,334 INFO L226 Difference]: Without dead ends: 134 [2021-05-02 23:05:25,336 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11136 ImplicationChecksByTransitivity, 7687.4ms TimeCoverageRelationStatistics Valid=719, Invalid=32587, Unknown=0, NotChecked=0, Total=33306 [2021-05-02 23:05:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-02 23:05:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-05-02 23:05:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 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:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-02 23:05:25,383 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2021-05-02 23:05:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:25,383 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-02 23:05:25,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 92 states have internal predecessors, (124), 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:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-02 23:05:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:05:25,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:25,384 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 31, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:25,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-05-02 23:05:25,384 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1817369842, now seen corresponding path program 31 times [2021-05-02 23:05:25,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:25,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1385680931] [2021-05-02 23:05:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:25,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1132 1) v_main_~n~0_142) (< v_main_~i~0_1132 10)) InVars {main_~i~0=v_main_~i~0_1132, main_~n~0=v_main_~n~0_142} OutVars{main_~i~0=v_main_~i~0_1132, main_~n~0=v_main_~n~0_142} AuxVars[] AssignedVars[] [2021-05-02 23:05:25,411 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:05:25,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:25,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:25,514 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:05:25,567 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1134 1) v_main_~n~0_143) (<= 10 v_main_~i~0_1134)) InVars {main_~i~0=v_main_~i~0_1134, main_~n~0=v_main_~n~0_143} OutVars{main_~i~0=v_main_~i~0_1134, main_~n~0=v_main_~n~0_143} AuxVars[] AssignedVars[] [2021-05-02 23:05:25,569 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:05:25,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:25,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:25,632 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:05:25,666 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:25,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1136 v_main_~n~0_144) (<= 10 v_main_~i~0_1136)) InVars {main_~i~0=v_main_~i~0_1136, main_~n~0=v_main_~n~0_144} OutVars{main_~i~0=v_main_~i~0_1136, main_~n~0=v_main_~n~0_144} AuxVars[] AssignedVars[] [2021-05-02 23:05:25,670 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:05:25,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:25,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:25,735 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:05:25,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1138 v_main_~n~0_145) (< v_main_~i~0_1138 10)) InVars {main_~i~0=v_main_~i~0_1138, main_~n~0=v_main_~n~0_145} OutVars{main_~i~0=v_main_~i~0_1138, main_~n~0=v_main_~n~0_145} AuxVars[] AssignedVars[] [2021-05-02 23:05:25,776 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:05:25,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:25,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:25,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:25,868 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:05:25,902 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:26,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:26,007 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:26,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:30,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:30,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1385680931] [2021-05-02 23:05:30,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1385680931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:30,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:30,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-02 23:05:30,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040731831] [2021-05-02 23:05:30,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-02 23:05:30,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-02 23:05:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=9049, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:05:30,030 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 96 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 94 states have internal predecessors, (127), 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:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:38,874 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-05-02 23:05:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-05-02 23:05:38,875 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 94 states have internal predecessors, (127), 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 131 [2021-05-02 23:05:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:38,876 INFO L225 Difference]: With dead ends: 145 [2021-05-02 23:05:38,876 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:05:38,877 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11637 ImplicationChecksByTransitivity, 8814.4ms TimeCoverageRelationStatistics Valid=734, Invalid=34048, Unknown=0, NotChecked=0, Total=34782 [2021-05-02 23:05:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:05:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2021-05-02 23:05:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 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:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-05-02 23:05:38,898 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 131 [2021-05-02 23:05:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:38,898 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-05-02 23:05:38,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 94 states have internal predecessors, (127), 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:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-05-02 23:05:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-05-02 23:05:38,899 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:38,899 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 32, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:38,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-05-02 23:05:38,899 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 122221833, now seen corresponding path program 32 times [2021-05-02 23:05:38,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:38,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246553009] [2021-05-02 23:05:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:38,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1182 10) (<= (+ v_main_~i~0_1182 1) v_main_~n~0_146)) InVars {main_~i~0=v_main_~i~0_1182, main_~n~0=v_main_~n~0_146} OutVars{main_~i~0=v_main_~i~0_1182, main_~n~0=v_main_~n~0_146} AuxVars[] AssignedVars[] [2021-05-02 23:05:38,912 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:05:38,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:38,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:38,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:38,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:38,988 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:05:39,026 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1184) (<= (+ v_main_~i~0_1184 1) v_main_~n~0_147)) InVars {main_~i~0=v_main_~i~0_1184, main_~n~0=v_main_~n~0_147} OutVars{main_~i~0=v_main_~i~0_1184, main_~n~0=v_main_~n~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:05:39,028 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:05:39,029 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:39,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:39,078 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:05:39,099 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:39,102 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1186) (<= v_main_~i~0_1186 v_main_~n~0_148)) InVars {main_~i~0=v_main_~i~0_1186, main_~n~0=v_main_~n~0_148} OutVars{main_~i~0=v_main_~i~0_1186, main_~n~0=v_main_~n~0_148} AuxVars[] AssignedVars[] [2021-05-02 23:05:39,104 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:05:39,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:39,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:39,156 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:05:39,181 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1188 v_main_~n~0_149) (< v_main_~i~0_1188 10)) InVars {main_~i~0=v_main_~i~0_1188, main_~n~0=v_main_~n~0_149} OutVars{main_~i~0=v_main_~i~0_1188, main_~n~0=v_main_~n~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:05:39,183 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:05:39,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:39,204 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:39,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:39,259 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:05:39,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:39,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:39,390 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:39,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:43,636 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:43,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246553009] [2021-05-02 23:05:43,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [246553009] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:43,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:43,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2021-05-02 23:05:43,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466712859] [2021-05-02 23:05:43,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2021-05-02 23:05:43,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-05-02 23:05:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=9434, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:05:43,637 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 98 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 96 states have internal predecessors, (130), 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:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:51,914 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-02 23:05:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2021-05-02 23:05:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 96 states have internal predecessors, (130), 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 134 [2021-05-02 23:05:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:51,916 INFO L225 Difference]: With dead ends: 148 [2021-05-02 23:05:51,916 INFO L226 Difference]: Without dead ends: 140 [2021-05-02 23:05:51,918 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12148 ImplicationChecksByTransitivity, 8784.5ms TimeCoverageRelationStatistics Valid=749, Invalid=35541, Unknown=0, NotChecked=0, Total=36290 [2021-05-02 23:05:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-05-02 23:05:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-05-02 23:05:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 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:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-02 23:05:51,939 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2021-05-02 23:05:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:51,939 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-02 23:05:51,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 98 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 96 states have internal predecessors, (130), 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:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-02 23:05:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-02 23:05:51,940 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:51,940 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 33, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:51,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-05-02 23:05:51,940 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1992188626, now seen corresponding path program 33 times [2021-05-02 23:05:51,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:51,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627482231] [2021-05-02 23:05:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:51,950 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1233 10) (<= (+ v_main_~i~0_1233 1) v_main_~n~0_150)) InVars {main_~i~0=v_main_~i~0_1233, main_~n~0=v_main_~n~0_150} OutVars{main_~i~0=v_main_~i~0_1233, main_~n~0=v_main_~n~0_150} AuxVars[] AssignedVars[] [2021-05-02 23:05:51,952 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:05:51,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:51,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:51,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:51,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:52,047 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:05:52,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1235 1) v_main_~n~0_151) (<= 10 v_main_~i~0_1235)) InVars {main_~i~0=v_main_~i~0_1235, main_~n~0=v_main_~n~0_151} OutVars{main_~i~0=v_main_~i~0_1235, main_~n~0=v_main_~n~0_151} AuxVars[] AssignedVars[] [2021-05-02 23:05:52,077 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:05:52,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,079 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,089 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:52,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:52,115 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:05:52,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:52,135 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1237 v_main_~n~0_152) (<= 10 v_main_~i~0_1237)) InVars {main_~i~0=v_main_~i~0_1237, main_~n~0=v_main_~n~0_152} OutVars{main_~i~0=v_main_~i~0_1237, main_~n~0=v_main_~n~0_152} AuxVars[] AssignedVars[] [2021-05-02 23:05:52,136 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:05:52,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:52,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:52,185 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:05:52,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1239 v_main_~n~0_153) (< v_main_~i~0_1239 10)) InVars {main_~i~0=v_main_~i~0_1239, main_~n~0=v_main_~n~0_153} OutVars{main_~i~0=v_main_~i~0_1239, main_~n~0=v_main_~n~0_153} AuxVars[] AssignedVars[] [2021-05-02 23:05:52,207 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:05:52,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:52,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:52,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:52,264 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:05:52,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:52,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:52,388 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:52,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:57,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:57,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627482231] [2021-05-02 23:05:57,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1627482231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:57,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:57,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [100] imperfect sequences [] total 100 [2021-05-02 23:05:57,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930299808] [2021-05-02 23:05:57,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2021-05-02 23:05:57,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2021-05-02 23:05:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=9827, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:05:57,018 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 100 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 98 states have internal predecessors, (133), 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:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:05,481 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2021-05-02 23:06:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-05-02 23:06:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 98 states have internal predecessors, (133), 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 137 [2021-05-02 23:06:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:05,483 INFO L225 Difference]: With dead ends: 151 [2021-05-02 23:06:05,483 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:06:05,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12669 ImplicationChecksByTransitivity, 9211.3ms TimeCoverageRelationStatistics Valid=764, Invalid=37066, Unknown=0, NotChecked=0, Total=37830 [2021-05-02 23:06:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:06:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-05-02 23:06:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 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:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2021-05-02 23:06:05,504 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2021-05-02 23:06:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:05,504 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2021-05-02 23:06:05,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 100 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 98 states have internal predecessors, (133), 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:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2021-05-02 23:06:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-05-02 23:06:05,504 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:05,505 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 34, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:05,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-05-02 23:06:05,505 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1891157737, now seen corresponding path program 34 times [2021-05-02 23:06:05,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:05,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719787712] [2021-05-02 23:06:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:05,518 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1285 10) (<= (+ v_main_~i~0_1285 1) v_main_~n~0_154)) InVars {main_~i~0=v_main_~i~0_1285, main_~n~0=v_main_~n~0_154} OutVars{main_~i~0=v_main_~i~0_1285, main_~n~0=v_main_~n~0_154} AuxVars[] AssignedVars[] [2021-05-02 23:06:05,520 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:06:05,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:05,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:05,592 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:06:05,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1287) (<= (+ v_main_~i~0_1287 1) v_main_~n~0_155)) InVars {main_~i~0=v_main_~i~0_1287, main_~n~0=v_main_~n~0_155} OutVars{main_~i~0=v_main_~i~0_1287, main_~n~0=v_main_~n~0_155} AuxVars[] AssignedVars[] [2021-05-02 23:06:05,624 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:06:05,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:05,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:05,669 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:06:05,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:05,691 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1289 v_main_~n~0_156) (<= 10 v_main_~i~0_1289)) InVars {main_~i~0=v_main_~i~0_1289, main_~n~0=v_main_~n~0_156} OutVars{main_~i~0=v_main_~i~0_1289, main_~n~0=v_main_~n~0_156} AuxVars[] AssignedVars[] [2021-05-02 23:06:05,692 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:06:05,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,707 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:05,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:05,756 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:06:05,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1291 v_main_~n~0_157) (< v_main_~i~0_1291 10)) InVars {main_~i~0=v_main_~i~0_1291, main_~n~0=v_main_~n~0_157} OutVars{main_~i~0=v_main_~i~0_1291, main_~n~0=v_main_~n~0_157} AuxVars[] AssignedVars[] [2021-05-02 23:06:05,784 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:06:05,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:05,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:05,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:05,856 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:06:05,883 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:05,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:05,979 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:05,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:10,742 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:10,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719787712] [2021-05-02 23:06:10,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719787712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:10,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:10,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2021-05-02 23:06:10,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139046181] [2021-05-02 23:06:10,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2021-05-02 23:06:10,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-05-02 23:06:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=10228, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:06:10,745 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 100 states have internal predecessors, (136), 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:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:19,681 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-02 23:06:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-05-02 23:06:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 100 states have internal predecessors, (136), 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 140 [2021-05-02 23:06:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:19,683 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:06:19,683 INFO L226 Difference]: Without dead ends: 146 [2021-05-02 23:06:19,685 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13200 ImplicationChecksByTransitivity, 9595.5ms TimeCoverageRelationStatistics Valid=779, Invalid=38623, Unknown=0, NotChecked=0, Total=39402 [2021-05-02 23:06:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-05-02 23:06:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-05-02 23:06:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 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:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-02 23:06:19,707 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2021-05-02 23:06:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:19,708 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-02 23:06:19,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 100 states have internal predecessors, (136), 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:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-02 23:06:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:06:19,708 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:19,709 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:19,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-05-02 23:06:19,709 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1423572814, now seen corresponding path program 35 times [2021-05-02 23:06:19,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:19,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304449790] [2021-05-02 23:06:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:19,721 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1338 1) v_main_~n~0_158) (< v_main_~i~0_1338 10)) InVars {main_~i~0=v_main_~i~0_1338, main_~n~0=v_main_~n~0_158} OutVars{main_~i~0=v_main_~i~0_1338, main_~n~0=v_main_~n~0_158} AuxVars[] AssignedVars[] [2021-05-02 23:06:19,723 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:06:19,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:19,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:19,782 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:06:19,811 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1340) (<= (+ v_main_~i~0_1340 1) v_main_~n~0_159)) InVars {main_~i~0=v_main_~i~0_1340, main_~n~0=v_main_~n~0_159} OutVars{main_~i~0=v_main_~i~0_1340, main_~n~0=v_main_~n~0_159} AuxVars[] AssignedVars[] [2021-05-02 23:06:19,813 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:06:19,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:19,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:19,853 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:06:19,872 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:19,875 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1342 v_main_~n~0_160) (<= 10 v_main_~i~0_1342)) InVars {main_~i~0=v_main_~i~0_1342, main_~n~0=v_main_~n~0_160} OutVars{main_~i~0=v_main_~i~0_1342, main_~n~0=v_main_~n~0_160} AuxVars[] AssignedVars[] [2021-05-02 23:06:19,876 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:06:19,895 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,905 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:19,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:19,933 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:06:19,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1344 v_main_~n~0_161) (< v_main_~i~0_1344 10)) InVars {main_~i~0=v_main_~i~0_1344, main_~n~0=v_main_~n~0_161} OutVars{main_~i~0=v_main_~i~0_1344, main_~n~0=v_main_~n~0_161} AuxVars[] AssignedVars[] [2021-05-02 23:06:19,957 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:06:19,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:19,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:19,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:20,018 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:06:20,044 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:20,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:20,140 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:20,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:25,222 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:25,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304449790] [2021-05-02 23:06:25,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304449790] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:25,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:25,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2021-05-02 23:06:25,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520403784] [2021-05-02 23:06:25,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2021-05-02 23:06:25,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-05-02 23:06:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=10637, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:06:25,224 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 104 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 102 states have internal predecessors, (139), 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:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:34,829 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2021-05-02 23:06:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-05-02 23:06:34,830 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 102 states have internal predecessors, (139), 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 143 [2021-05-02 23:06:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:34,830 INFO L225 Difference]: With dead ends: 157 [2021-05-02 23:06:34,830 INFO L226 Difference]: Without dead ends: 149 [2021-05-02 23:06:34,832 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13741 ImplicationChecksByTransitivity, 10272.0ms TimeCoverageRelationStatistics Valid=794, Invalid=40212, Unknown=0, NotChecked=0, Total=41006 [2021-05-02 23:06:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-02 23:06:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-05-02 23:06:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.013986013986014) internal successors, (145), 143 states have internal predecessors, (145), 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:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2021-05-02 23:06:34,848 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2021-05-02 23:06:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:34,848 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2021-05-02 23:06:34,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 104 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 102 states have internal predecessors, (139), 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:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2021-05-02 23:06:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-05-02 23:06:34,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:34,849 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 36, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:34,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-05-02 23:06:34,849 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:34,849 INFO L82 PathProgramCache]: Analyzing trace with hash 180072649, now seen corresponding path program 36 times [2021-05-02 23:06:34,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:34,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969497928] [2021-05-02 23:06:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:34,869 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1392 10) (<= (+ v_main_~i~0_1392 1) v_main_~n~0_162)) InVars {main_~i~0=v_main_~i~0_1392, main_~n~0=v_main_~n~0_162} OutVars{main_~i~0=v_main_~i~0_1392, main_~n~0=v_main_~n~0_162} AuxVars[] AssignedVars[] [2021-05-02 23:06:34,870 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:06:34,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:34,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:34,891 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:34,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:34,934 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:06:34,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1394 1) v_main_~n~0_163) (<= 10 v_main_~i~0_1394)) InVars {main_~i~0=v_main_~i~0_1394, main_~n~0=v_main_~n~0_163} OutVars{main_~i~0=v_main_~i~0_1394, main_~n~0=v_main_~n~0_163} AuxVars[] AssignedVars[] [2021-05-02 23:06:34,966 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:06:34,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:34,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:34,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:34,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:35,014 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:06:35,035 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:35,037 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1396) (<= v_main_~i~0_1396 v_main_~n~0_164)) InVars {main_~i~0=v_main_~i~0_1396, main_~n~0=v_main_~n~0_164} OutVars{main_~i~0=v_main_~i~0_1396, main_~n~0=v_main_~n~0_164} AuxVars[] AssignedVars[] [2021-05-02 23:06:35,038 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:06:35,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:35,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:35,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:35,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:35,080 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:06:35,103 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1398 10) (<= v_main_~i~0_1398 v_main_~n~0_165)) InVars {main_~i~0=v_main_~i~0_1398, main_~n~0=v_main_~n~0_165} OutVars{main_~i~0=v_main_~i~0_1398, main_~n~0=v_main_~n~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:06:35,105 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:06:35,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:35,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:35,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:35,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:35,169 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:06:35,203 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:35,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:35,303 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:35,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:41,067 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:41,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969497928] [2021-05-02 23:06:41,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1969497928] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:41,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:41,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [106] imperfect sequences [] total 106 [2021-05-02 23:06:41,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857777310] [2021-05-02 23:06:41,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2021-05-02 23:06:41,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2021-05-02 23:06:41,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=11054, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:06:41,069 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 106 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 104 states have internal predecessors, (142), 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:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:51,593 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-02 23:06:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-05-02 23:06:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 104 states have internal predecessors, (142), 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 146 [2021-05-02 23:06:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:51,596 INFO L225 Difference]: With dead ends: 160 [2021-05-02 23:06:51,596 INFO L226 Difference]: Without dead ends: 152 [2021-05-02 23:06:51,598 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14292 ImplicationChecksByTransitivity, 11371.1ms TimeCoverageRelationStatistics Valid=809, Invalid=41833, Unknown=0, NotChecked=0, Total=42642 [2021-05-02 23:06:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-02 23:06:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-05-02 23:06:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 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:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-02 23:06:51,623 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2021-05-02 23:06:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:51,623 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-02 23:06:51,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 106 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 104 states have internal predecessors, (142), 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:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-02 23:06:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-02 23:06:51,624 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:51,625 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 37, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:51,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-05-02 23:06:51,625 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash -840414866, now seen corresponding path program 37 times [2021-05-02 23:06:51,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:51,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206680169] [2021-05-02 23:06:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:51,637 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1447 10) (<= (+ v_main_~i~0_1447 1) v_main_~n~0_166)) InVars {main_~i~0=v_main_~i~0_1447, main_~n~0=v_main_~n~0_166} OutVars{main_~i~0=v_main_~i~0_1447, main_~n~0=v_main_~n~0_166} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,640 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:06:51,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:51,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:51,729 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:06:51,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1449 1) v_main_~n~0_167) (<= 10 v_main_~i~0_1449)) InVars {main_~i~0=v_main_~i~0_1449, main_~n~0=v_main_~n~0_167} OutVars{main_~i~0=v_main_~i~0_1449, main_~n~0=v_main_~n~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,792 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:06:51,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:51,835 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:51,855 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:06:51,881 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:51,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1451 v_main_~n~0_168) (<= 10 v_main_~i~0_1451)) InVars {main_~i~0=v_main_~i~0_1451, main_~n~0=v_main_~n~0_168} OutVars{main_~i~0=v_main_~i~0_1451, main_~n~0=v_main_~n~0_168} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,885 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:06:51,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:51,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:51,945 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:06:51,974 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1453 10) (<= v_main_~i~0_1453 v_main_~n~0_169)) InVars {main_~i~0=v_main_~i~0_1453, main_~n~0=v_main_~n~0_169} OutVars{main_~i~0=v_main_~i~0_1453, main_~n~0=v_main_~n~0_169} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,976 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:06:51,983 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:52,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:52,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:52,066 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:06:52,100 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:52,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:52,196 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:52,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:58,275 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:58,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206680169] [2021-05-02 23:06:58,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1206680169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:58,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:58,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2021-05-02 23:06:58,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613350353] [2021-05-02 23:06:58,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2021-05-02 23:06:58,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2021-05-02 23:06:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=11479, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 23:06:58,277 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 106 states have internal predecessors, (145), 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:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:10,998 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2021-05-02 23:07:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-05-02 23:07:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 106 states have internal predecessors, (145), 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 149 [2021-05-02 23:07:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:11,001 INFO L225 Difference]: With dead ends: 163 [2021-05-02 23:07:11,001 INFO L226 Difference]: Without dead ends: 155 [2021-05-02 23:07:11,003 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14853 ImplicationChecksByTransitivity, 12646.1ms TimeCoverageRelationStatistics Valid=824, Invalid=43486, Unknown=0, NotChecked=0, Total=44310 [2021-05-02 23:07:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-02 23:07:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2021-05-02 23:07:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0134228187919463) internal successors, (151), 149 states have internal predecessors, (151), 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:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2021-05-02 23:07:11,021 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2021-05-02 23:07:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:11,021 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2021-05-02 23:07:11,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 106 states have internal predecessors, (145), 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:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2021-05-02 23:07:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-05-02 23:07:11,021 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:11,022 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 38, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:11,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-05-02 23:07:11,022 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1889514153, now seen corresponding path program 38 times [2021-05-02 23:07:11,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:11,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294327720] [2021-05-02 23:07:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:11,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1503 10) (<= (+ v_main_~i~0_1503 1) v_main_~n~0_170)) InVars {main_~i~0=v_main_~i~0_1503, main_~n~0=v_main_~n~0_170} OutVars{main_~i~0=v_main_~i~0_1503, main_~n~0=v_main_~n~0_170} AuxVars[] AssignedVars[] [2021-05-02 23:07:11,040 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:07:11,067 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:11,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:11,137 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:07:11,182 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1505 1) v_main_~n~0_171) (<= 10 v_main_~i~0_1505)) InVars {main_~i~0=v_main_~i~0_1505, main_~n~0=v_main_~n~0_171} OutVars{main_~i~0=v_main_~i~0_1505, main_~n~0=v_main_~n~0_171} AuxVars[] AssignedVars[] [2021-05-02 23:07:11,184 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:07:11,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:11,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:11,254 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:07:11,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:11,291 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1507 v_main_~n~0_172) (<= 10 v_main_~i~0_1507)) InVars {main_~i~0=v_main_~i~0_1507, main_~n~0=v_main_~n~0_172} OutVars{main_~i~0=v_main_~i~0_1507, main_~n~0=v_main_~n~0_172} AuxVars[] AssignedVars[] [2021-05-02 23:07:11,294 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:07:11,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:11,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:11,371 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:07:11,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1509 v_main_~n~0_173) (< v_main_~i~0_1509 10)) InVars {main_~i~0=v_main_~i~0_1509, main_~n~0=v_main_~n~0_173} OutVars{main_~i~0=v_main_~i~0_1509, main_~n~0=v_main_~n~0_173} AuxVars[] AssignedVars[] [2021-05-02 23:07:11,410 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:07:11,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,441 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:11,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:11,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:11,508 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:07:11,551 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:11,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:11,720 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,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:18,921 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:18,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294327720] [2021-05-02 23:07:18,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [294327720] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:18,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:18,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2021-05-02 23:07:18,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354278408] [2021-05-02 23:07:18,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2021-05-02 23:07:18,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-05-02 23:07:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=11912, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:07:18,923 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand has 110 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 108 states have internal predecessors, (148), 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:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:31,801 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-02 23:07:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-05-02 23:07:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 108 states have internal predecessors, (148), 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 152 [2021-05-02 23:07:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:31,804 INFO L225 Difference]: With dead ends: 166 [2021-05-02 23:07:31,804 INFO L226 Difference]: Without dead ends: 158 [2021-05-02 23:07:31,807 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15424 ImplicationChecksByTransitivity, 13926.9ms TimeCoverageRelationStatistics Valid=839, Invalid=45171, Unknown=0, NotChecked=0, Total=46010 [2021-05-02 23:07:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-02 23:07:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-05-02 23:07:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 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:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-02 23:07:31,833 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2021-05-02 23:07:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:31,834 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-02 23:07:31,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 110 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 108 states have internal predecessors, (148), 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:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-02 23:07:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-02 23:07:31,835 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:31,835 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 39, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:31,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-05-02 23:07:31,835 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash -295797874, now seen corresponding path program 39 times [2021-05-02 23:07:31,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:31,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327455387] [2021-05-02 23:07:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:31,847 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1560 10) (<= (+ v_main_~i~0_1560 1) v_main_~n~0_174)) InVars {main_~i~0=v_main_~i~0_1560, main_~n~0=v_main_~n~0_174} OutVars{main_~i~0=v_main_~i~0_1560, main_~n~0=v_main_~n~0_174} AuxVars[] AssignedVars[] [2021-05-02 23:07:31,850 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:07:31,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:31,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:31,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:31,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:31,944 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:07:31,986 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1562) (<= (+ v_main_~i~0_1562 1) v_main_~n~0_175)) InVars {main_~i~0=v_main_~i~0_1562, main_~n~0=v_main_~n~0_175} OutVars{main_~i~0=v_main_~i~0_1562, main_~n~0=v_main_~n~0_175} AuxVars[] AssignedVars[] [2021-05-02 23:07:31,988 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:07:32,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:32,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:32,046 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:07:32,071 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:32,073 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1564) (<= v_main_~i~0_1564 v_main_~n~0_176)) InVars {main_~i~0=v_main_~i~0_1564, main_~n~0=v_main_~n~0_176} OutVars{main_~i~0=v_main_~i~0_1564, main_~n~0=v_main_~n~0_176} AuxVars[] AssignedVars[] [2021-05-02 23:07:32,090 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:07:32,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:32,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:32,143 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:07:32,173 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1566 10) (<= v_main_~i~0_1566 v_main_~n~0_177)) InVars {main_~i~0=v_main_~i~0_1566, main_~n~0=v_main_~n~0_177} OutVars{main_~i~0=v_main_~i~0_1566, main_~n~0=v_main_~n~0_177} AuxVars[] AssignedVars[] [2021-05-02 23:07:32,176 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:07:32,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,180 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:32,199 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:32,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:32,253 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:07:32,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:32,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:32,422 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:32,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:39,850 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:39,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327455387] [2021-05-02 23:07:39,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1327455387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:39,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:39,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [112] imperfect sequences [] total 112 [2021-05-02 23:07:39,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831962746] [2021-05-02 23:07:39,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2021-05-02 23:07:39,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2021-05-02 23:07:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=12353, Unknown=0, NotChecked=0, Total=12656 [2021-05-02 23:07:39,852 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 112 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 110 states have internal predecessors, (151), 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:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:53,831 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2021-05-02 23:07:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-05-02 23:07:53,833 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 110 states have internal predecessors, (151), 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 155 [2021-05-02 23:07:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:53,833 INFO L225 Difference]: With dead ends: 169 [2021-05-02 23:07:53,834 INFO L226 Difference]: Without dead ends: 161 [2021-05-02 23:07:53,836 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16005 ImplicationChecksByTransitivity, 14604.5ms TimeCoverageRelationStatistics Valid=854, Invalid=46888, Unknown=0, NotChecked=0, Total=47742 [2021-05-02 23:07:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-02 23:07:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2021-05-02 23:07:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.0129032258064516) internal successors, (157), 155 states have internal predecessors, (157), 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:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2021-05-02 23:07:53,856 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 155 [2021-05-02 23:07:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:53,856 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2021-05-02 23:07:53,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 112 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 110 states have internal predecessors, (151), 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:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2021-05-02 23:07:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-02 23:07:53,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:53,857 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 40, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:53,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-05-02 23:07:53,857 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:53,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash 187878537, now seen corresponding path program 40 times [2021-05-02 23:07:53,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:53,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177835922] [2021-05-02 23:07:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:53,869 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1618 1) v_main_~n~0_178) (< v_main_~i~0_1618 10)) InVars {main_~i~0=v_main_~i~0_1618, main_~n~0=v_main_~n~0_178} OutVars{main_~i~0=v_main_~i~0_1618, main_~n~0=v_main_~n~0_178} AuxVars[] AssignedVars[] [2021-05-02 23:07:53,871 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:07:53,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:53,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:53,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:53,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:53,952 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:07:53,992 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1620) (<= (+ v_main_~i~0_1620 1) v_main_~n~0_179)) InVars {main_~i~0=v_main_~i~0_1620, main_~n~0=v_main_~n~0_179} OutVars{main_~i~0=v_main_~i~0_1620, main_~n~0=v_main_~n~0_179} AuxVars[] AssignedVars[] [2021-05-02 23:07:53,994 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:07:54,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,030 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:54,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:54,052 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:07:54,080 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:54,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1622 v_main_~n~0_180) (<= 10 v_main_~i~0_1622)) InVars {main_~i~0=v_main_~i~0_1622, main_~n~0=v_main_~n~0_180} OutVars{main_~i~0=v_main_~i~0_1622, main_~n~0=v_main_~n~0_180} AuxVars[] AssignedVars[] [2021-05-02 23:07:54,084 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:07:54,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,104 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:54,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:54,142 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:07:54,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1624 10) (<= v_main_~i~0_1624 v_main_~n~0_181)) InVars {main_~i~0=v_main_~i~0_1624, main_~n~0=v_main_~n~0_181} OutVars{main_~i~0=v_main_~i~0_1624, main_~n~0=v_main_~n~0_181} AuxVars[] AssignedVars[] [2021-05-02 23:07:54,174 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:07:54,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:54,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:54,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:54,255 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:07:54,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:54,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:54,425 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:54,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:02,456 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:02,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177835922] [2021-05-02 23:08:02,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177835922] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:02,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:02,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [114] imperfect sequences [] total 114 [2021-05-02 23:08:02,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284799464] [2021-05-02 23:08:02,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2021-05-02 23:08:02,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2021-05-02 23:08:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=12802, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:08:02,458 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 114 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 112 states have internal predecessors, (154), 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:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:18,320 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-02 23:08:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-05-02 23:08:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 112 states have internal predecessors, (154), 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 158 [2021-05-02 23:08:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:18,323 INFO L225 Difference]: With dead ends: 172 [2021-05-02 23:08:18,323 INFO L226 Difference]: Without dead ends: 164 [2021-05-02 23:08:18,326 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16596 ImplicationChecksByTransitivity, 16195.4ms TimeCoverageRelationStatistics Valid=869, Invalid=48637, Unknown=0, NotChecked=0, Total=49506 [2021-05-02 23:08:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-05-02 23:08:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-05-02 23:08:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 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:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-02 23:08:18,346 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2021-05-02 23:08:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:18,346 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-02 23:08:18,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 114 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 112 states have internal predecessors, (154), 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:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-02 23:08:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-02 23:08:18,347 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:18,347 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 41, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:18,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-05-02 23:08:18,347 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -223439442, now seen corresponding path program 41 times [2021-05-02 23:08:18,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:18,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064411480] [2021-05-02 23:08:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:18,357 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1677 10) (<= (+ v_main_~i~0_1677 1) v_main_~n~0_182)) InVars {main_~i~0=v_main_~i~0_1677, main_~n~0=v_main_~n~0_182} OutVars{main_~i~0=v_main_~i~0_1677, main_~n~0=v_main_~n~0_182} AuxVars[] AssignedVars[] [2021-05-02 23:08:18,362 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:08:18,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:18,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:18,481 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:08:18,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1679) (<= (+ v_main_~i~0_1679 1) v_main_~n~0_183)) InVars {main_~i~0=v_main_~i~0_1679, main_~n~0=v_main_~n~0_183} OutVars{main_~i~0=v_main_~i~0_1679, main_~n~0=v_main_~n~0_183} AuxVars[] AssignedVars[] [2021-05-02 23:08:18,531 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:08:18,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:18,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:18,602 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:08:18,633 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:18,637 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1681) (<= v_main_~i~0_1681 v_main_~n~0_184)) InVars {main_~i~0=v_main_~i~0_1681, main_~n~0=v_main_~n~0_184} OutVars{main_~i~0=v_main_~i~0_1681, main_~n~0=v_main_~n~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:08:18,639 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:08:18,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:18,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:18,702 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:08:18,748 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1683 10) (<= v_main_~i~0_1683 v_main_~n~0_185)) InVars {main_~i~0=v_main_~i~0_1683, main_~n~0=v_main_~n~0_185} OutVars{main_~i~0=v_main_~i~0_1683, main_~n~0=v_main_~n~0_185} AuxVars[] AssignedVars[] [2021-05-02 23:08:18,772 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:08:18,773 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:18,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:18,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:18,860 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:08:18,901 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:19,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:19,031 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:19,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:28,771 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:28,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064411480] [2021-05-02 23:08:28,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064411480] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:28,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:28,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2021-05-02 23:08:28,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476603135] [2021-05-02 23:08:28,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2021-05-02 23:08:28,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-05-02 23:08:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=13259, Unknown=0, NotChecked=0, Total=13572 [2021-05-02 23:08:28,773 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 116 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 114 states have internal predecessors, (157), 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:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:47,487 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2021-05-02 23:08:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-05-02 23:08:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 114 states have internal predecessors, (157), 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 161 [2021-05-02 23:08:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:47,490 INFO L225 Difference]: With dead ends: 175 [2021-05-02 23:08:47,490 INFO L226 Difference]: Without dead ends: 167 [2021-05-02 23:08:47,492 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17197 ImplicationChecksByTransitivity, 19301.9ms TimeCoverageRelationStatistics Valid=884, Invalid=50418, Unknown=0, NotChecked=0, Total=51302 [2021-05-02 23:08:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-02 23:08:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2021-05-02 23:08:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.0124223602484472) internal successors, (163), 161 states have internal predecessors, (163), 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:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2021-05-02 23:08:47,513 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 161 [2021-05-02 23:08:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:47,513 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2021-05-02 23:08:47,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 116 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 114 states have internal predecessors, (157), 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:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2021-05-02 23:08:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-05-02 23:08:47,514 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:47,514 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 42, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:47,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-05-02 23:08:47,515 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash -255656343, now seen corresponding path program 42 times [2021-05-02 23:08:47,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:47,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898707933] [2021-05-02 23:08:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:47,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1737 10) (<= (+ v_main_~i~0_1737 1) v_main_~n~0_186)) InVars {main_~i~0=v_main_~i~0_1737, main_~n~0=v_main_~n~0_186} OutVars{main_~i~0=v_main_~i~0_1737, main_~n~0=v_main_~n~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:08:47,528 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:08:47,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:47,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:47,625 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:08:47,678 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1739) (<= (+ v_main_~i~0_1739 1) v_main_~n~0_187)) InVars {main_~i~0=v_main_~i~0_1739, main_~n~0=v_main_~n~0_187} OutVars{main_~i~0=v_main_~i~0_1739, main_~n~0=v_main_~n~0_187} AuxVars[] AssignedVars[] [2021-05-02 23:08:47,680 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:08:47,682 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:47,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:47,761 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:08:47,792 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:47,795 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1741) (<= v_main_~i~0_1741 v_main_~n~0_188)) InVars {main_~i~0=v_main_~i~0_1741, main_~n~0=v_main_~n~0_188} OutVars{main_~i~0=v_main_~i~0_1741, main_~n~0=v_main_~n~0_188} AuxVars[] AssignedVars[] [2021-05-02 23:08:47,797 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:08:47,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:47,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:47,862 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:08:47,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1743 v_main_~n~0_189) (< v_main_~i~0_1743 10)) InVars {main_~i~0=v_main_~i~0_1743, main_~n~0=v_main_~n~0_189} OutVars{main_~i~0=v_main_~i~0_1743, main_~n~0=v_main_~n~0_189} AuxVars[] AssignedVars[] [2021-05-02 23:08:47,902 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:08:47,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,930 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:47,953 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:47,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:47,992 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:08:48,043 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:48,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:48,215 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:48,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:58,946 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:58,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898707933] [2021-05-02 23:08:58,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1898707933] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:58,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:58,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [118] imperfect sequences [] total 118 [2021-05-02 23:08:58,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831639687] [2021-05-02 23:08:58,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2021-05-02 23:08:58,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2021-05-02 23:08:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=13724, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:08:58,949 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand has 118 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 116 states have internal predecessors, (160), 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:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:09:24,293 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-02 23:09:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-05-02 23:09:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 116 states have internal predecessors, (160), 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 164 [2021-05-02 23:09:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:09:24,296 INFO L225 Difference]: With dead ends: 178 [2021-05-02 23:09:24,296 INFO L226 Difference]: Without dead ends: 170 [2021-05-02 23:09:24,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17808 ImplicationChecksByTransitivity, 23654.4ms TimeCoverageRelationStatistics Valid=899, Invalid=52231, Unknown=0, NotChecked=0, Total=53130 [2021-05-02 23:09:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-05-02 23:09:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2021-05-02 23:09:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.0121951219512195) internal successors, (166), 164 states have internal predecessors, (166), 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:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-02 23:09:24,320 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2021-05-02 23:09:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:09:24,320 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-02 23:09:24,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 118 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 116 states have internal predecessors, (160), 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:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-02 23:09:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-02 23:09:24,321 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:09:24,321 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 43, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:09:24,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-05-02 23:09:24,321 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:09:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:09:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2043320270, now seen corresponding path program 43 times [2021-05-02 23:09:24,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:09:24,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177611937] [2021-05-02 23:09:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:09:24,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1798 1) v_main_~n~0_190) (< v_main_~i~0_1798 10)) InVars {main_~i~0=v_main_~i~0_1798, main_~n~0=v_main_~n~0_190} OutVars{main_~i~0=v_main_~i~0_1798, main_~n~0=v_main_~n~0_190} AuxVars[] AssignedVars[] [2021-05-02 23:09:24,338 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:09:24,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:24,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:24,477 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:09:24,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1800 1) v_main_~n~0_191) (<= 10 v_main_~i~0_1800)) InVars {main_~i~0=v_main_~i~0_1800, main_~n~0=v_main_~n~0_191} OutVars{main_~i~0=v_main_~i~0_1800, main_~n~0=v_main_~n~0_191} AuxVars[] AssignedVars[] [2021-05-02 23:09:24,552 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:09:24,586 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:24,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:24,652 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:09:24,706 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:24,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1802 v_main_~n~0_192) (<= 10 v_main_~i~0_1802)) InVars {main_~i~0=v_main_~i~0_1802, main_~n~0=v_main_~n~0_192} OutVars{main_~i~0=v_main_~i~0_1802, main_~n~0=v_main_~n~0_192} AuxVars[] AssignedVars[] [2021-05-02 23:09:24,716 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:09:24,762 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,768 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:09:24,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:09:24,834 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:09:24,881 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1804 10) (<= v_main_~i~0_1804 v_main_~n~0_193)) InVars {main_~i~0=v_main_~i~0_1804, main_~n~0=v_main_~n~0_193} OutVars{main_~i~0=v_main_~i~0_1804, main_~n~0=v_main_~n~0_193} AuxVars[] AssignedVars[] [2021-05-02 23:09:24,884 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:09:24,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:24,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:09:24,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:09:25,004 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:09:25,066 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:25,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:09:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:25,291 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:25,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:09:38,282 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:09:38,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177611937] [2021-05-02 23:09:38,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177611937] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:09:38,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:09:38,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [120] imperfect sequences [] total 120 [2021-05-02 23:09:38,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330523549] [2021-05-02 23:09:38,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2021-05-02 23:09:38,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:09:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2021-05-02 23:09:38,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=14197, Unknown=0, NotChecked=0, Total=14520 [2021-05-02 23:09:38,285 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 120 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 118 states have internal predecessors, (163), 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:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:10:03,345 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2021-05-02 23:10:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-05-02 23:10:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 120 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 118 states have internal predecessors, (163), 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 167 [2021-05-02 23:10:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:10:03,350 INFO L225 Difference]: With dead ends: 181 [2021-05-02 23:10:03,350 INFO L226 Difference]: Without dead ends: 173 [2021-05-02 23:10:03,354 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18429 ImplicationChecksByTransitivity, 25170.4ms TimeCoverageRelationStatistics Valid=914, Invalid=54076, Unknown=0, NotChecked=0, Total=54990 [2021-05-02 23:10:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-02 23:10:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2021-05-02 23:10:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 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:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2021-05-02 23:10:03,389 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2021-05-02 23:10:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:10:03,390 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2021-05-02 23:10:03,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 120 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 118 states have internal predecessors, (163), 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:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2021-05-02 23:10:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-05-02 23:10:03,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:10:03,391 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 44, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:10:03,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-05-02 23:10:03,391 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:10:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:10:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash -987871159, now seen corresponding path program 44 times [2021-05-02 23:10:03,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:10:03,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048314811] [2021-05-02 23:10:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:10:03,406 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1860 1) v_main_~n~0_194) (< v_main_~i~0_1860 10)) InVars {main_~i~0=v_main_~i~0_1860, main_~n~0=v_main_~n~0_194} OutVars{main_~i~0=v_main_~i~0_1860, main_~n~0=v_main_~n~0_194} AuxVars[] AssignedVars[] [2021-05-02 23:10:03,410 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:10:03,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:03,522 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:03,573 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:10:03,643 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1862) (<= (+ v_main_~i~0_1862 1) v_main_~n~0_195)) InVars {main_~i~0=v_main_~i~0_1862, main_~n~0=v_main_~n~0_195} OutVars{main_~i~0=v_main_~i~0_1862, main_~n~0=v_main_~n~0_195} AuxVars[] AssignedVars[] [2021-05-02 23:10:03,645 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:10:03,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,654 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:03,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:03,765 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:10:03,811 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:03,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1864 v_main_~n~0_196) (<= 10 v_main_~i~0_1864)) InVars {main_~i~0=v_main_~i~0_1864, main_~n~0=v_main_~n~0_196} OutVars{main_~i~0=v_main_~i~0_1864, main_~n~0=v_main_~n~0_196} AuxVars[] AssignedVars[] [2021-05-02 23:10:03,820 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:10:03,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,825 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:10:03,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:10:03,913 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:10:03,970 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1866 v_main_~n~0_197) (< v_main_~i~0_1866 10)) InVars {main_~i~0=v_main_~i~0_1866, main_~n~0=v_main_~n~0_197} OutVars{main_~i~0=v_main_~i~0_1866, main_~n~0=v_main_~n~0_197} AuxVars[] AssignedVars[] [2021-05-02 23:10:03,973 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:10:03,975 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:03,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:04,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:10:04,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:10:04,096 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:10:04,196 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:04,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:10:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:04,428 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:04,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:10:20,473 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:10:20,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048314811] [2021-05-02 23:10:20,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1048314811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:10:20,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:10:20,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2021-05-02 23:10:20,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239979699] [2021-05-02 23:10:20,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2021-05-02 23:10:20,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:10:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2021-05-02 23:10:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=14678, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:10:20,475 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 122 states, 121 states have (on average 1.371900826446281) internal successors, (166), 120 states have internal predecessors, (166), 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:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:10:52,334 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-02 23:10:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-05-02 23:10:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 121 states have (on average 1.371900826446281) internal successors, (166), 120 states have internal predecessors, (166), 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 170 [2021-05-02 23:10:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:10:52,341 INFO L225 Difference]: With dead ends: 184 [2021-05-02 23:10:52,341 INFO L226 Difference]: Without dead ends: 176 [2021-05-02 23:10:52,344 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19060 ImplicationChecksByTransitivity, 31393.5ms TimeCoverageRelationStatistics Valid=929, Invalid=55953, Unknown=0, NotChecked=0, Total=56882 [2021-05-02 23:10:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-05-02 23:10:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2021-05-02 23:10:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.011764705882353) internal successors, (172), 170 states have internal predecessors, (172), 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:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-02 23:10:52,393 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2021-05-02 23:10:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:10:52,393 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-02 23:10:52,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 122 states, 121 states have (on average 1.371900826446281) internal successors, (166), 120 states have internal predecessors, (166), 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:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-02 23:10:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-02 23:10:52,394 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:10:52,395 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 45, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:10:52,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-05-02 23:10:52,395 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:10:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:10:52,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1524334098, now seen corresponding path program 45 times [2021-05-02 23:10:52,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:10:52,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1689069608] [2021-05-02 23:10:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:10:52,433 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1923 10) (<= (+ v_main_~i~0_1923 1) v_main_~n~0_198)) InVars {main_~i~0=v_main_~i~0_1923, main_~n~0=v_main_~n~0_198} OutVars{main_~i~0=v_main_~i~0_1923, main_~n~0=v_main_~n~0_198} AuxVars[] AssignedVars[] [2021-05-02 23:10:52,437 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:10:52,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:52,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:52,632 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:10:52,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1925 1) v_main_~n~0_199) (<= 10 v_main_~i~0_1925)) InVars {main_~i~0=v_main_~i~0_1925, main_~n~0=v_main_~n~0_199} OutVars{main_~i~0=v_main_~i~0_1925, main_~n~0=v_main_~n~0_199} AuxVars[] AssignedVars[] [2021-05-02 23:10:52,738 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:10:52,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:52,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:52,845 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:10:52,895 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:52,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1927 v_main_~n~0_200) (<= 10 v_main_~i~0_1927)) InVars {main_~i~0=v_main_~i~0_1927, main_~n~0=v_main_~n~0_200} OutVars{main_~i~0=v_main_~i~0_1927, main_~n~0=v_main_~n~0_200} AuxVars[] AssignedVars[] [2021-05-02 23:10:52,903 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:10:52,936 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:52,961 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:10:52,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:10:53,003 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:10:53,054 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1929 10) (<= v_main_~i~0_1929 v_main_~n~0_201)) InVars {main_~i~0=v_main_~i~0_1929, main_~n~0=v_main_~n~0_201} OutVars{main_~i~0=v_main_~i~0_1929, main_~n~0=v_main_~n~0_201} AuxVars[] AssignedVars[] [2021-05-02 23:10:53,057 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:10:53,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:53,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:53,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:10:53,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:10:53,185 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:10:53,305 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:10:53,314 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:53,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:10:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:53,623 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:53,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:11:12,276 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:11:12,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1689069608] [2021-05-02 23:11:12,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1689069608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:11:12,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:11:12,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [124] imperfect sequences [] total 124 [2021-05-02 23:11:12,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148112902] [2021-05-02 23:11:12,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2021-05-02 23:11:12,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:11:12,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2021-05-02 23:11:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=15167, Unknown=0, NotChecked=0, Total=15500 [2021-05-02 23:11:12,279 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 124 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 122 states have internal predecessors, (169), 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:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:11:55,545 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2021-05-02 23:11:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2021-05-02 23:11:55,549 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 122 states have internal predecessors, (169), 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 173 [2021-05-02 23:11:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:11:55,550 INFO L225 Difference]: With dead ends: 187 [2021-05-02 23:11:55,550 INFO L226 Difference]: Without dead ends: 179 [2021-05-02 23:11:55,554 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19701 ImplicationChecksByTransitivity, 39147.8ms TimeCoverageRelationStatistics Valid=944, Invalid=57862, Unknown=0, NotChecked=0, Total=58806 [2021-05-02 23:11:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-02 23:11:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2021-05-02 23:11:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.0115606936416186) internal successors, (175), 173 states have internal predecessors, (175), 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:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2021-05-02 23:11:55,579 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 173 [2021-05-02 23:11:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:11:55,579 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2021-05-02 23:11:55,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 124 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 122 states have internal predecessors, (169), 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:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2021-05-02 23:11:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-05-02 23:11:55,580 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:11:55,580 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 46, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:11:55,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-05-02 23:11:55,580 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:11:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:11:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1718441431, now seen corresponding path program 46 times [2021-05-02 23:11:55,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:11:55,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073354362] [2021-05-02 23:11:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:11:55,597 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1987 10) (<= (+ v_main_~i~0_1987 1) v_main_~n~0_202)) InVars {main_~i~0=v_main_~i~0_1987, main_~n~0=v_main_~n~0_202} OutVars{main_~i~0=v_main_~i~0_1987, main_~n~0=v_main_~n~0_202} AuxVars[] AssignedVars[] [2021-05-02 23:11:55,602 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:11:55,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:55,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:55,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:55,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:55,780 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:11:55,896 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:11:55,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1989) (<= (+ v_main_~i~0_1989 1) v_main_~n~0_203)) InVars {main_~i~0=v_main_~i~0_1989, main_~n~0=v_main_~n~0_203} OutVars{main_~i~0=v_main_~i~0_1989, main_~n~0=v_main_~n~0_203} AuxVars[] AssignedVars[] [2021-05-02 23:11:55,911 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:11:55,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:55,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:56,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:56,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:56,102 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:11:56,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:56,195 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_1991) (<= v_main_~i~0_1991 v_main_~n~0_204)) InVars {main_~i~0=v_main_~i~0_1991, main_~n~0=v_main_~n~0_204} OutVars{main_~i~0=v_main_~i~0_1991, main_~n~0=v_main_~n~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:11:56,197 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:11:56,200 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:56,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:56,238 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:11:56,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:11:56,321 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:11:56,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_1993 10) (<= v_main_~i~0_1993 v_main_~n~0_205)) InVars {main_~i~0=v_main_~i~0_1993, main_~n~0=v_main_~n~0_205} OutVars{main_~i~0=v_main_~i~0_1993, main_~n~0=v_main_~n~0_205} AuxVars[] AssignedVars[] [2021-05-02 23:11:56,398 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:11:56,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:56,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:56,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:11:56,473 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:11:56,564 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:11:56,655 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:56,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:11:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:56,883 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:56,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:12:16,348 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:12:16,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073354362] [2021-05-02 23:12:16,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1073354362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:12:16,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:12:16,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2021-05-02 23:12:16,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425955833] [2021-05-02 23:12:16,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2021-05-02 23:12:16,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:12:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2021-05-02 23:12:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=15664, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:12:16,351 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand has 126 states, 125 states have (on average 1.376) internal successors, (172), 124 states have internal predecessors, (172), 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:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:12:55,206 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-02 23:12:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-05-02 23:12:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 125 states have (on average 1.376) internal successors, (172), 124 states have internal predecessors, (172), 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 176 [2021-05-02 23:12:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:12:55,212 INFO L225 Difference]: With dead ends: 190 [2021-05-02 23:12:55,212 INFO L226 Difference]: Without dead ends: 182 [2021-05-02 23:12:55,216 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20352 ImplicationChecksByTransitivity, 37729.9ms TimeCoverageRelationStatistics Valid=959, Invalid=59803, Unknown=0, NotChecked=0, Total=60762 [2021-05-02 23:12:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-02 23:12:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2021-05-02 23:12:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 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:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-02 23:12:55,278 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2021-05-02 23:12:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:12:55,279 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-02 23:12:55,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 126 states, 125 states have (on average 1.376) internal successors, (172), 124 states have internal predecessors, (172), 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:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-02 23:12:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-02 23:12:55,280 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:12:55,280 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 47, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:12:55,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-05-02 23:12:55,280 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:12:55,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:12:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash 950948878, now seen corresponding path program 47 times [2021-05-02 23:12:55,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:12:55,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065269825] [2021-05-02 23:12:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:12:55,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_2052 10) (<= (+ v_main_~i~0_2052 1) v_main_~n~0_206)) InVars {main_~i~0=v_main_~i~0_2052, main_~n~0=v_main_~n~0_206} OutVars{main_~i~0=v_main_~i~0_2052, main_~n~0=v_main_~n~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:12:55,306 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:12:55,309 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:12:55,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:12:55,514 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:12:55,622 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2054 1) v_main_~n~0_207) (<= 10 v_main_~i~0_2054)) InVars {main_~i~0=v_main_~i~0_2054, main_~n~0=v_main_~n~0_207} OutVars{main_~i~0=v_main_~i~0_2054, main_~n~0=v_main_~n~0_207} AuxVars[] AssignedVars[] [2021-05-02 23:12:55,626 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:12:55,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:12:55,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:12:55,747 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:12:55,823 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:12:55,834 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2056 v_main_~n~0_208) (<= 10 v_main_~i~0_2056)) InVars {main_~i~0=v_main_~i~0_2056, main_~n~0=v_main_~n~0_208} OutVars{main_~i~0=v_main_~i~0_2056, main_~n~0=v_main_~n~0_208} AuxVars[] AssignedVars[] [2021-05-02 23:12:55,837 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:12:55,839 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:55,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:12:55,877 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:12:55,958 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:12:56,034 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_2058 10) (<= v_main_~i~0_2058 v_main_~n~0_209)) InVars {main_~i~0=v_main_~i~0_2058, main_~n~0=v_main_~n~0_209} OutVars{main_~i~0=v_main_~i~0_2058, main_~n~0=v_main_~n~0_209} AuxVars[] AssignedVars[] [2021-05-02 23:12:56,038 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:12:56,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:56,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:56,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:12:56,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:12:56,218 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:12:56,324 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:12:56,330 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:12:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:56,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:12:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:56,613 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:56,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:13:17,521 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:13:17,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065269825] [2021-05-02 23:13:17,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2065269825] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:13:17,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:13:17,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [128] imperfect sequences [] total 128 [2021-05-02 23:13:17,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255618853] [2021-05-02 23:13:17,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2021-05-02 23:13:17,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:13:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2021-05-02 23:13:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=16169, Unknown=0, NotChecked=0, Total=16512 [2021-05-02 23:13:17,524 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 128 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 126 states have internal predecessors, (175), 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:37,338 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-05-02 23:14:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:14:03,630 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2021-05-02 23:14:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-05-02 23:14:03,635 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 126 states have internal predecessors, (175), 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 179 [2021-05-02 23:14:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:14:03,636 INFO L225 Difference]: With dead ends: 193 [2021-05-02 23:14:03,636 INFO L226 Difference]: Without dead ends: 185 [2021-05-02 23:14:03,639 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21013 ImplicationChecksByTransitivity, 42063.3ms TimeCoverageRelationStatistics Valid=974, Invalid=61776, Unknown=0, NotChecked=0, Total=62750 [2021-05-02 23:14:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-02 23:14:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2021-05-02 23:14:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.011173184357542) internal successors, (181), 179 states have internal predecessors, (181), 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:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2021-05-02 23:14:03,674 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 179 [2021-05-02 23:14:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:14:03,675 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2021-05-02 23:14:03,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 128 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 126 states have internal predecessors, (175), 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:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2021-05-02 23:14:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-05-02 23:14:03,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:14:03,676 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 48, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:14:03,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-05-02 23:14:03,676 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:14:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:14:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -856808439, now seen corresponding path program 48 times [2021-05-02 23:14:03,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:14:03,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981217871] [2021-05-02 23:14:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:14:03,698 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2118 1) v_main_~n~0_210) (< v_main_~i~0_2118 10)) InVars {main_~i~0=v_main_~i~0_2118, main_~n~0=v_main_~n~0_210} OutVars{main_~i~0=v_main_~i~0_2118, main_~n~0=v_main_~n~0_210} AuxVars[] AssignedVars[] [2021-05-02 23:14:03,702 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size [2021-05-02 23:14:03,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:03,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:03,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:14:03,799 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:14:03,899 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-05-02 23:14:04,006 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_2120) (<= (+ v_main_~i~0_2120 1) v_main_~n~0_211)) InVars {main_~i~0=v_main_~i~0_2120, main_~n~0=v_main_~n~0_211} OutVars{main_~i~0=v_main_~i~0_2120, main_~n~0=v_main_~n~0_211} AuxVars[] AssignedVars[] [2021-05-02 23:14:04,009 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size [2021-05-02 23:14:04,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:14:04,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:14:04,132 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.9 percent of original size 72 [2021-05-02 23:14:04,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:14:04,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 10 v_main_~i~0_2122) (<= v_main_~i~0_2122 v_main_~n~0_212)) InVars {main_~i~0=v_main_~i~0_2122, main_~n~0=v_main_~n~0_212} OutVars{main_~i~0=v_main_~i~0_2122, main_~n~0=v_main_~n~0_212} AuxVars[] AssignedVars[] [2021-05-02 23:14:04,222 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size [2021-05-02 23:14:04,268 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:14:04,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:14:04,351 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-05-02 23:14:04,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2124 v_main_~n~0_213) (< v_main_~i~0_2124 10)) InVars {main_~i~0=v_main_~i~0_2124, main_~n~0=v_main_~n~0_213} OutVars{main_~i~0=v_main_~i~0_2124, main_~n~0=v_main_~n~0_213} AuxVars[] AssignedVars[] [2021-05-02 23:14:04,421 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size [2021-05-02 23:14:04,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:04,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:14:04,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:14:04,609 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 89.4 percent of original size 76 [2021-05-02 23:14:04,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:14:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:05,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:14:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:05,031 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:05,041 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:14:35,892 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:14:35,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981217871] [2021-05-02 23:14:35,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1981217871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:14:35,892 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:14:35,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [130] imperfect sequences [] total 130 [2021-05-02 23:14:35,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555932126] [2021-05-02 23:14:35,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2021-05-02 23:14:35,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:14:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2021-05-02 23:14:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=16682, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:14:35,895 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand has 130 states, 129 states have (on average 1.37984496124031) internal successors, (178), 128 states have internal predecessors, (178), 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:54,811 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33