/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-crafted-1/mono-crafted_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:03:54,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:03:54,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:03:54,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:03:54,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:03:54,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:03:54,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:03:54,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:03:54,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:03:54,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:03:54,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:03:54,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:03:54,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:03:54,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:03:54,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:03:54,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:03:54,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:03:54,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:03:54,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:03:54,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:03:54,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:03:54,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:03:54,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:03:54,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:03:54,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:03:54,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:03:54,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:03:54,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:03:54,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:03:54,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:03:54,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:03:54,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:03:54,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:03:54,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:03:54,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:03:54,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:03:54,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:03:54,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:03:54,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:03:54,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:03:54,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:03:54,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:03:54,201 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:03:54,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:03:54,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:03:54,204 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:03:54,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:03:54,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:03:54,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:03:54,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:03:54,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:03:54,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:03:54,206 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:03:54,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:03:54,206 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:03:54,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:03:54,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:03:54,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:03:54,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:03:54,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:03:54,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:03:54,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:03:54,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:03:54,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:03:54,208 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:03:54,208 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-03 00:03:54,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:03:54,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:03:54,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:03:54,551 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:03:54,551 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:03:54,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c [2021-05-03 00:03:54,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4330373/196058ce0ee74049a541aa15f0e731ef/FLAG8b46f3922 [2021-05-03 00:03:55,009 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:03:55,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c [2021-05-03 00:03:55,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4330373/196058ce0ee74049a541aa15f0e731ef/FLAG8b46f3922 [2021-05-03 00:03:55,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4330373/196058ce0ee74049a541aa15f0e731ef [2021-05-03 00:03:55,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:03:55,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:03:55,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:03:55,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:03:55,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:03:55,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56079e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55, skipping insertion in model container [2021-05-03 00:03:55,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:03:55,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:03:55,532 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c[318,331] [2021-05-03 00:03:55,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:03:55,548 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:03:55,596 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-crafted-1/mono-crafted_1.c[318,331] [2021-05-03 00:03:55,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:03:55,610 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:03:55,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55 WrapperNode [2021-05-03 00:03:55,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:03:55,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:03:55,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:03:55,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:03:55,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (1/1) ... [2021-05-03 00:03:55,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:03:55,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:03:55,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:03:55,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:03:55,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (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-03 00:03:55,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:03:55,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:03:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:03:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:03:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:03:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:03:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:03:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:03:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:03:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:03:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:03:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:03:55,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:03:55,984 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:03:55,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:03:55 BoogieIcfgContainer [2021-05-03 00:03:55,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:03:55,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:03:55,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:03:55,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:03:55,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:03:55" (1/3) ... [2021-05-03 00:03:55,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb99a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:03:55, skipping insertion in model container [2021-05-03 00:03:55,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:03:55" (2/3) ... [2021-05-03 00:03:55,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb99a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:03:55, skipping insertion in model container [2021-05-03 00:03:55,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:03:55" (3/3) ... [2021-05-03 00:03:55,991 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_1.c [2021-05-03 00:03:56,006 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:03:56,009 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:03:56,029 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:03:56,051 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:03:56,051 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:03:56,051 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:03:56,051 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:03:56,051 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:03:56,051 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:03:56,052 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:03:56,052 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:03:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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-03 00:03:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:03:56,076 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:56,077 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:56,077 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2021-05-03 00:03:56,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:56,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1422984649] [2021-05-03 00:03:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:56,152 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:03:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,347 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-03 00:03:56,348 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:56,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1422984649] [2021-05-03 00:03:56,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1422984649] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:56,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:56,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:03:56,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86961956] [2021-05-03 00:03:56,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:03:56,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:03:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:03:56,371 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:56,448 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-05-03 00:03:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:03:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-03 00:03:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:56,455 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:03:56,456 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:03:56,459 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:03:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:03:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:03:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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-03 00:03:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-05-03 00:03:56,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2021-05-03 00:03:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:56,493 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-05-03 00:03:56,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-05-03 00:03:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:03:56,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:56,494 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:56,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:03:56,495 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2021-05-03 00:03:56,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:56,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128960782] [2021-05-03 00:03:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:56,501 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:03:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,622 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-03 00:03:56,622 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:56,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128960782] [2021-05-03 00:03:56,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1128960782] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:56,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:56,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:03:56,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527406076] [2021-05-03 00:03:56,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:03:56,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:56,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:03:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:03:56,624 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:56,677 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-05-03 00:03:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:03:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-03 00:03:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:56,678 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:03:56,678 INFO L226 Difference]: Without dead ends: 16 [2021-05-03 00:03:56,679 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:03:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-03 00:03:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-03 00:03:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-03 00:03:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-05-03 00:03:56,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-05-03 00:03:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:56,685 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-05-03 00:03:56,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-05-03 00:03:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:03:56,686 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:56,686 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:56,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:03:56,687 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2021-05-03 00:03:56,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:56,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552449712] [2021-05-03 00:03:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:56,715 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_14 50000) InVars {main_~x~0=v_main_~x~0_14} OutVars{main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:03:56,724 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:03:56,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:56,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:56,762 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:03:56,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:56,881 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-03 00:03:56,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:03:56,919 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:56,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552449712] [2021-05-03 00:03:56,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1552449712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:56,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:56,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:03:56,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162781387] [2021-05-03 00:03:56,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:03:56,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:03:56,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:03:56,921 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:03:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:57,073 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2021-05-03 00:03:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:03:57,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:03:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:57,075 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:03:57,075 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:03:57,075 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 162.7ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:03:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:03:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-03 00:03:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-03 00:03:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-05-03 00:03:57,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2021-05-03 00:03:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:57,081 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-05-03 00:03:57,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-03 00:03:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-05-03 00:03:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:03:57,082 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:57,082 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:57,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:03:57,082 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2021-05-03 00:03:57,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:57,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391067413] [2021-05-03 00:03:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:57,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_18) (< v_main_~x~0_18 999999)) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:03:57,106 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:57,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,171 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:57,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:57,223 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:57,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_20 999999) (< v_main_~x~0_20 50000)) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:03:57,256 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:03:57,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,273 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:57,281 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:03:57,295 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:57,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_22 50000) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:03:57,304 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:03:57,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:57,340 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:03:57,357 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_24) (< v_main_~x~0_24 1000000)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:03:57,371 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:57,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:57,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:57,447 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:57,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:57,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:57,661 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-03 00:03:57,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:03:57,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:57,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391067413] [2021-05-03 00:03:57,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1391067413] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:57,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:57,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:03:57,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631107826] [2021-05-03 00:03:57,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:03:57,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:03:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:03:57,745 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:57,871 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-05-03 00:03:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:03:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 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 19 [2021-05-03 00:03:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:57,874 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:03:57,874 INFO L226 Difference]: Without dead ends: 22 [2021-05-03 00:03:57,876 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 172.1ms TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:03:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-03 00:03:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-03 00:03:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-05-03 00:03:57,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2021-05-03 00:03:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:57,887 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-05-03 00:03:57,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-05-03 00:03:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:03:57,888 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:57,888 INFO L523 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:57,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:03:57,888 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 694051964, now seen corresponding path program 2 times [2021-05-03 00:03:57,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:57,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041697440] [2021-05-03 00:03:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:57,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_30) (< v_main_~x~0_30 999999)) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:03:57,912 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:57,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:57,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:57,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:57,978 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:58,007 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_32 999999) (< v_main_~x~0_32 50000)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,014 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:03:58,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:58,049 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:03:58,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:58,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_34 50000) InVars {main_~x~0=v_main_~x~0_34} OutVars{main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,071 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:03:58,085 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:58,101 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:03:58,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_36 1000000) (<= 50000 v_main_~x~0_36)) InVars {main_~x~0=v_main_~x~0_36} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,125 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:58,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:58,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:58,191 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:58,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:58,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:58,384 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-03 00:03:58,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:03:58,461 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:58,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041697440] [2021-05-03 00:03:58,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2041697440] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:58,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:58,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:03:58,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082401822] [2021-05-03 00:03:58,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:03:58,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:03:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:03:58,463 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:58,672 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2021-05-03 00:03:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:03:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2021-05-03 00:03:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:58,673 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:03:58,673 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:03:58,674 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 253.7ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:03:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:03:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-03 00:03:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-03 00:03:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-03 00:03:58,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2021-05-03 00:03:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:58,680 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-03 00:03:58,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-03 00:03:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:03:58,680 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:58,681 INFO L523 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:58,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:03:58,681 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:58,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1181472342, now seen corresponding path program 3 times [2021-05-03 00:03:58,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:58,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178943553] [2021-05-03 00:03:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:58,695 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_43 999999) (<= 50000 v_main_~x~0_43)) InVars {main_~x~0=v_main_~x~0_43} OutVars{main_~x~0=v_main_~x~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,699 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:58,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:58,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:58,760 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:58,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_45 50000) (< v_main_~x~0_45 999999)) InVars {main_~x~0=v_main_~x~0_45} OutVars{main_~x~0=v_main_~x~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,786 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:03:58,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:58,808 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:03:58,825 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:58,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_47 50000) InVars {main_~x~0=v_main_~x~0_47} OutVars{main_~x~0=v_main_~x~0_47} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,829 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:03:58,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:58,854 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:03:58,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_49 1000000) (<= 50000 v_main_~x~0_49)) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:03:58,874 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:58,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:58,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:58,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:58,934 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:58,965 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:59,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:59,109 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-03 00:03:59,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:03:59,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:59,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178943553] [2021-05-03 00:03:59,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1178943553] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:59,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:59,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:03:59,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396474352] [2021-05-03 00:03:59,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:03:59,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:03:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:03:59,203 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:59,476 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-05-03 00:03:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:03:59,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-03 00:03:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:59,477 INFO L225 Difference]: With dead ends: 41 [2021-05-03 00:03:59,477 INFO L226 Difference]: Without dead ends: 28 [2021-05-03 00:03:59,478 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 325.4ms TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:03:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-05-03 00:03:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-05-03 00:03:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-05-03 00:03:59,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 24 [2021-05-03 00:03:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:59,487 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-05-03 00:03:59,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2021-05-03 00:03:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:03:59,489 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:59,489 INFO L523 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:59,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:03:59,489 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 700983510, now seen corresponding path program 4 times [2021-05-03 00:03:59,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:59,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [990151060] [2021-05-03 00:03:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:59,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_57 999999) (<= 50000 v_main_~x~0_57)) InVars {main_~x~0=v_main_~x~0_57} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[] [2021-05-03 00:03:59,506 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:59,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,512 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:59,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:59,563 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:59,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_59 999999) (< v_main_~x~0_59 50000)) InVars {main_~x~0=v_main_~x~0_59} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:03:59,590 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:03:59,614 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:59,628 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:03:59,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:59,641 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_61 50000) InVars {main_~x~0=v_main_~x~0_61} OutVars{main_~x~0=v_main_~x~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:03:59,643 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:03:59,643 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:59,667 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:03:59,682 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_63 1000000) (<= 50000 v_main_~x~0_63)) InVars {main_~x~0=v_main_~x~0_63} OutVars{main_~x~0=v_main_~x~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:03:59,685 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:03:59,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:59,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:03:59,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:03:59,734 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:03:59,754 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:03:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:59,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:03:59,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:00,014 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:00,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [990151060] [2021-05-03 00:04:00,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [990151060] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:00,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:00,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:04:00,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011076135] [2021-05-03 00:04:00,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:04:00,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:04:00,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:04:00,016 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:00,394 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-05-03 00:04:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:04:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2021-05-03 00:04:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:00,398 INFO L225 Difference]: With dead ends: 45 [2021-05-03 00:04:00,398 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:04:00,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 432.2ms TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:04:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:04:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-03 00:04:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-03 00:04:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-05-03 00:04:00,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2021-05-03 00:04:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:00,409 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-05-03 00:04:00,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2021-05-03 00:04:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-03 00:04:00,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:00,410 INFO L523 BasicCegarLoop]: trace histogram [7, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:00,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:04:00,410 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1431555504, now seen corresponding path program 5 times [2021-05-03 00:04:00,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:00,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230458932] [2021-05-03 00:04:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:00,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_72 999999) (<= 50000 v_main_~x~0_72)) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:04:00,423 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:00,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:00,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:00,475 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:00,501 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_74 50000) (< v_main_~x~0_74 999999)) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:04:00,503 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:00,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:00,526 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:00,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:00,537 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_76 50000) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:04:00,539 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:00,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:00,560 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:00,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_78) (< v_main_~x~0_78 1000000)) InVars {main_~x~0=v_main_~x~0_78} OutVars{main_~x~0=v_main_~x~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:04:00,578 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:00,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:00,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:00,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:00,633 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:00,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:00,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:00,769 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-03 00:04:00,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:00,896 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:00,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230458932] [2021-05-03 00:04:00,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1230458932] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:00,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:00,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:04:00,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936317395] [2021-05-03 00:04:00,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:04:00,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:04:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:04:00,898 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:01,304 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2021-05-03 00:04:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:04:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-03 00:04:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:01,306 INFO L225 Difference]: With dead ends: 48 [2021-05-03 00:04:01,306 INFO L226 Difference]: Without dead ends: 33 [2021-05-03 00:04:01,306 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 384.9ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:04:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-03 00:04:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-03 00:04:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-03 00:04:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-05-03 00:04:01,312 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2021-05-03 00:04:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:01,312 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-05-03 00:04:01,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-05-03 00:04:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-03 00:04:01,313 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:01,313 INFO L523 BasicCegarLoop]: trace histogram [8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:01,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:04:01,313 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash 867302035, now seen corresponding path program 6 times [2021-05-03 00:04:01,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:01,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2005212611] [2021-05-03 00:04:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:01,323 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_88 999999) (<= 50000 v_main_~x~0_88)) InVars {main_~x~0=v_main_~x~0_88} OutVars{main_~x~0=v_main_~x~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:04:01,325 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:01,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:01,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:01,374 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:01,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_90 50000) (< v_main_~x~0_90 999999)) InVars {main_~x~0=v_main_~x~0_90} OutVars{main_~x~0=v_main_~x~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:04:01,395 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:01,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,409 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:01,418 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:01,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:01,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_92 50000) InVars {main_~x~0=v_main_~x~0_92} OutVars{main_~x~0=v_main_~x~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:04:01,431 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:01,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:01,457 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:01,486 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_94 1000000) (<= 50000 v_main_~x~0_94)) InVars {main_~x~0=v_main_~x~0_94} OutVars{main_~x~0=v_main_~x~0_94} AuxVars[] AssignedVars[] [2021-05-03 00:04:01,489 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:01,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:01,518 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:01,520 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:01,539 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:01,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:01,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:01,672 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-03 00:04:01,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:01,849 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:01,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2005212611] [2021-05-03 00:04:01,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2005212611] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:01,849 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:01,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:04:01,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533733203] [2021-05-03 00:04:01,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:04:01,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:04:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:04:01,851 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 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-03 00:04:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:02,201 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-05-03 00:04:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:04:02,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 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-03 00:04:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:02,202 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:04:02,202 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:04:02,203 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 417.5ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:04:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:04:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:04:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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-03 00:04:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-05-03 00:04:02,208 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2021-05-03 00:04:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:02,209 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-05-03 00:04:02,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 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-03 00:04:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-05-03 00:04:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:04:02,209 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:02,210 INFO L523 BasicCegarLoop]: trace histogram [9, 7, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:02,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:04:02,210 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1838760426, now seen corresponding path program 7 times [2021-05-03 00:04:02,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:02,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893366365] [2021-05-03 00:04:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:02,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_105) (< v_main_~x~0_105 999999)) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:04:02,221 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:02,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:02,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:02,271 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:02,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_107 999999) (< v_main_~x~0_107 50000)) InVars {main_~x~0=v_main_~x~0_107} OutVars{main_~x~0=v_main_~x~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:04:02,293 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:02,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:02,320 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:02,331 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:02,333 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_109 50000) InVars {main_~x~0=v_main_~x~0_109} OutVars{main_~x~0=v_main_~x~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:04:02,335 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:02,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:02,371 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:02,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_111) (< v_main_~x~0_111 1000000)) InVars {main_~x~0=v_main_~x~0_111} OutVars{main_~x~0=v_main_~x~0_111} AuxVars[] AssignedVars[] [2021-05-03 00:04:02,386 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:02,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:02,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:02,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:02,454 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:02,473 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:02,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:02,586 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-03 00:04:02,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:02,737 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:02,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893366365] [2021-05-03 00:04:02,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1893366365] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:02,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:02,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:04:02,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108051712] [2021-05-03 00:04:02,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:04:02,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:02,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:04:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:04:02,739 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:03,196 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2021-05-03 00:04:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:04:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-05-03 00:04:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:03,197 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:04:03,197 INFO L226 Difference]: Without dead ends: 37 [2021-05-03 00:04:03,198 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 428.8ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:04:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-03 00:04:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-03 00:04:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-03 00:04:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2021-05-03 00:04:03,210 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2021-05-03 00:04:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:03,210 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2021-05-03 00:04:03,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-05-03 00:04:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-03 00:04:03,211 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:03,211 INFO L523 BasicCegarLoop]: trace histogram [10, 8, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:03,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:04:03,212 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:03,212 INFO L82 PathProgramCache]: Analyzing trace with hash 385395929, now seen corresponding path program 8 times [2021-05-03 00:04:03,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:03,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154933483] [2021-05-03 00:04:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:03,223 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_123 999999) (<= 50000 v_main_~x~0_123)) InVars {main_~x~0=v_main_~x~0_123} OutVars{main_~x~0=v_main_~x~0_123} AuxVars[] AssignedVars[] [2021-05-03 00:04:03,227 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:03,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:03,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:03,276 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:03,297 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_125 50000) (< v_main_~x~0_125 999999)) InVars {main_~x~0=v_main_~x~0_125} OutVars{main_~x~0=v_main_~x~0_125} AuxVars[] AssignedVars[] [2021-05-03 00:04:03,299 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:03,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:03,331 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:03,341 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:03,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_127 50000) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_127} AuxVars[] AssignedVars[] [2021-05-03 00:04:03,346 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:03,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,352 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:03,365 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:03,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_129 1000000) (<= 50000 v_main_~x~0_129)) InVars {main_~x~0=v_main_~x~0_129} OutVars{main_~x~0=v_main_~x~0_129} AuxVars[] AssignedVars[] [2021-05-03 00:04:03,394 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:03,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:03,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:03,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:03,464 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:03,487 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:03,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:03,605 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-03 00:04:03,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:03,795 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:03,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154933483] [2021-05-03 00:04:03,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1154933483] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:03,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:03,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:04:03,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423396764] [2021-05-03 00:04:03,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:04:03,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:04:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:04:03,797 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:04,326 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2021-05-03 00:04:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:04:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-05-03 00:04:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:04,328 INFO L225 Difference]: With dead ends: 54 [2021-05-03 00:04:04,328 INFO L226 Difference]: Without dead ends: 39 [2021-05-03 00:04:04,329 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 514.4ms TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:04:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-03 00:04:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-03 00:04:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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-03 00:04:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-05-03 00:04:04,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2021-05-03 00:04:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-05-03 00:04:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-05-03 00:04:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-03 00:04:04,335 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:04,335 INFO L523 BasicCegarLoop]: trace histogram [11, 9, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:04,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:04:04,335 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1094060324, now seen corresponding path program 9 times [2021-05-03 00:04:04,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:04,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [838327942] [2021-05-03 00:04:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:04,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_142) (< v_main_~x~0_142 999999)) InVars {main_~x~0=v_main_~x~0_142} OutVars{main_~x~0=v_main_~x~0_142} AuxVars[] AssignedVars[] [2021-05-03 00:04:04,345 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:04,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:04,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:04,399 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:04,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_144 999999) (< v_main_~x~0_144 50000)) InVars {main_~x~0=v_main_~x~0_144} OutVars{main_~x~0=v_main_~x~0_144} AuxVars[] AssignedVars[] [2021-05-03 00:04:04,425 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:04,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:04,450 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:04,462 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:04,463 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_146 50000) InVars {main_~x~0=v_main_~x~0_146} OutVars{main_~x~0=v_main_~x~0_146} AuxVars[] AssignedVars[] [2021-05-03 00:04:04,465 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:04,472 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:04,485 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:04,497 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_148) (< v_main_~x~0_148 1000000)) InVars {main_~x~0=v_main_~x~0_148} OutVars{main_~x~0=v_main_~x~0_148} AuxVars[] AssignedVars[] [2021-05-03 00:04:04,500 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:04,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:04,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:04,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:04,548 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:04,568 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:04,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:04,685 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-03 00:04:04,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:04,863 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:04,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [838327942] [2021-05-03 00:04:04,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [838327942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:04,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:04,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:04:04,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232564475] [2021-05-03 00:04:04,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:04:04,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:04:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:04:04,865 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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-03 00:04:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:05,457 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-05-03 00:04:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:04:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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-03 00:04:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:05,458 INFO L225 Difference]: With dead ends: 57 [2021-05-03 00:04:05,458 INFO L226 Difference]: Without dead ends: 42 [2021-05-03 00:04:05,459 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 619.5ms TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:04:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-03 00:04:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-05-03 00:04:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-05-03 00:04:05,464 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 38 [2021-05-03 00:04:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:05,464 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-05-03 00:04:05,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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-03 00:04:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-05-03 00:04:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:04:05,465 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:05,465 INFO L523 BasicCegarLoop]: trace histogram [12, 10, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:05,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:04:05,465 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash 952564516, now seen corresponding path program 10 times [2021-05-03 00:04:05,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:05,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782499001] [2021-05-03 00:04:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:05,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_162 999999) (<= 50000 v_main_~x~0_162)) InVars {main_~x~0=v_main_~x~0_162} OutVars{main_~x~0=v_main_~x~0_162} AuxVars[] AssignedVars[] [2021-05-03 00:04:05,476 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:05,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,481 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:05,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:05,524 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:05,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_164 999999) (< v_main_~x~0_164 50000)) InVars {main_~x~0=v_main_~x~0_164} OutVars{main_~x~0=v_main_~x~0_164} AuxVars[] AssignedVars[] [2021-05-03 00:04:05,547 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:05,555 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:05,568 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:05,578 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:05,579 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_166 50000) InVars {main_~x~0=v_main_~x~0_166} OutVars{main_~x~0=v_main_~x~0_166} AuxVars[] AssignedVars[] [2021-05-03 00:04:05,580 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:05,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:05,600 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:05,610 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_168 1000000) (<= 50000 v_main_~x~0_168)) InVars {main_~x~0=v_main_~x~0_168} OutVars{main_~x~0=v_main_~x~0_168} AuxVars[] AssignedVars[] [2021-05-03 00:04:05,622 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:05,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,640 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:05,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:05,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:05,677 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:05,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:05,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:05,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:06,120 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:06,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782499001] [2021-05-03 00:04:06,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [782499001] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:06,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:06,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:04:06,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482001541] [2021-05-03 00:04:06,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:04:06,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:04:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:04:06,122 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 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-03 00:04:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:06,800 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-05-03 00:04:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:04:06,801 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 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-03 00:04:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:06,801 INFO L225 Difference]: With dead ends: 60 [2021-05-03 00:04:06,801 INFO L226 Difference]: Without dead ends: 44 [2021-05-03 00:04:06,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 675.2ms TimeCoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:04:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-03 00:04:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-05-03 00:04:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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-03 00:04:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2021-05-03 00:04:06,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2021-05-03 00:04:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:06,809 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2021-05-03 00:04:06,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 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-03 00:04:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2021-05-03 00:04:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:04:06,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:06,810 INFO L523 BasicCegarLoop]: trace histogram [13, 11, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:06,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:04:06,811 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash 391281409, now seen corresponding path program 11 times [2021-05-03 00:04:06,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:06,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462998972] [2021-05-03 00:04:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:06,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_183) (< v_main_~x~0_183 999999)) InVars {main_~x~0=v_main_~x~0_183} OutVars{main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[] [2021-05-03 00:04:06,821 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:06,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:06,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:06,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:06,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:06,865 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:06,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_185 999999) (< v_main_~x~0_185 50000)) InVars {main_~x~0=v_main_~x~0_185} OutVars{main_~x~0=v_main_~x~0_185} AuxVars[] AssignedVars[] [2021-05-03 00:04:06,887 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:06,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:06,899 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:06,905 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:06,914 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:06,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_187 50000) InVars {main_~x~0=v_main_~x~0_187} OutVars{main_~x~0=v_main_~x~0_187} AuxVars[] AssignedVars[] [2021-05-03 00:04:06,928 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:06,929 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:06,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:06,950 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:06,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_189 1000000) (<= 50000 v_main_~x~0_189)) InVars {main_~x~0=v_main_~x~0_189} OutVars{main_~x~0=v_main_~x~0_189} AuxVars[] AssignedVars[] [2021-05-03 00:04:06,968 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:06,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:06,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:07,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:07,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:07,021 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:07,038 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:07,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:07,165 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-03 00:04:07,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:07,415 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:07,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462998972] [2021-05-03 00:04:07,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1462998972] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:07,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:07,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:04:07,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32346660] [2021-05-03 00:04:07,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:04:07,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:04:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:04:07,416 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:08,121 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2021-05-03 00:04:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:04:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 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 43 [2021-05-03 00:04:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:08,122 INFO L225 Difference]: With dead ends: 62 [2021-05-03 00:04:08,122 INFO L226 Difference]: Without dead ends: 46 [2021-05-03 00:04:08,123 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 701.5ms TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:04:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-05-03 00:04:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-05-03 00:04:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-05-03 00:04:08,129 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 43 [2021-05-03 00:04:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:08,129 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-05-03 00:04:08,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-05-03 00:04:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-03 00:04:08,130 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:08,130 INFO L523 BasicCegarLoop]: trace histogram [14, 12, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:08,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:04:08,130 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:08,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2130872418, now seen corresponding path program 12 times [2021-05-03 00:04:08,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:08,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253506489] [2021-05-03 00:04:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:08,139 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_205) (< v_main_~x~0_205 999999)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_205} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,141 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:08,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,144 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:08,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:08,185 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:08,203 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_207 999999) (< v_main_~x~0_207 50000)) InVars {main_~x~0=v_main_~x~0_207} OutVars{main_~x~0=v_main_~x~0_207} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,205 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:08,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:08,230 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:08,239 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:08,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_209 50000) InVars {main_~x~0=v_main_~x~0_209} OutVars{main_~x~0=v_main_~x~0_209} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,242 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:08,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,252 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:08,259 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:08,270 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_211) (< v_main_~x~0_211 1000000)) InVars {main_~x~0=v_main_~x~0_211} OutVars{main_~x~0=v_main_~x~0_211} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,279 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:08,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:08,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:08,331 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:08,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:08,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:08,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:08,761 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:08,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253506489] [2021-05-03 00:04:08,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [253506489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:08,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:08,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:04:08,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257106915] [2021-05-03 00:04:08,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:04:08,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:08,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:04:08,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:04:08,763 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:09,468 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2021-05-03 00:04:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:04:09,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2021-05-03 00:04:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:09,469 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:04:09,469 INFO L226 Difference]: Without dead ends: 48 [2021-05-03 00:04:09,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 696.7ms TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:04:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-03 00:04:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-05-03 00:04:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2021-05-03 00:04:09,474 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 45 [2021-05-03 00:04:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:09,475 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2021-05-03 00:04:09,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2021-05-03 00:04:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-03 00:04:09,475 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:09,475 INFO L523 BasicCegarLoop]: trace histogram [15, 13, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:09,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:04:09,475 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:09,476 INFO L82 PathProgramCache]: Analyzing trace with hash 735822075, now seen corresponding path program 13 times [2021-05-03 00:04:09,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:09,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475494647] [2021-05-03 00:04:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:09,481 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_228) (< v_main_~x~0_228 999999)) InVars {main_~x~0=v_main_~x~0_228} OutVars{main_~x~0=v_main_~x~0_228} AuxVars[] AssignedVars[] [2021-05-03 00:04:09,483 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:09,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:09,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:09,532 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:09,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_230 999999) (< v_main_~x~0_230 50000)) InVars {main_~x~0=v_main_~x~0_230} OutVars{main_~x~0=v_main_~x~0_230} AuxVars[] AssignedVars[] [2021-05-03 00:04:09,556 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:09,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:09,575 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:09,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:09,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_232 50000) InVars {main_~x~0=v_main_~x~0_232} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[] [2021-05-03 00:04:09,589 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:09,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:09,605 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:09,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_234 1000000) (<= 50000 v_main_~x~0_234)) InVars {main_~x~0=v_main_~x~0_234} OutVars{main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[] [2021-05-03 00:04:09,618 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:09,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:09,634 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:09,661 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:09,678 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:09,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:09,829 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-03 00:04:09,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:10,061 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:10,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475494647] [2021-05-03 00:04:10,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [475494647] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:10,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:10,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:04:10,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538707867] [2021-05-03 00:04:10,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:04:10,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:04:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:04:10,063 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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-03 00:04:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:10,851 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-05-03 00:04:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:04:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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-03 00:04:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:10,852 INFO L225 Difference]: With dead ends: 67 [2021-05-03 00:04:10,852 INFO L226 Difference]: Without dead ends: 51 [2021-05-03 00:04:10,853 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 842.5ms TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:04:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-03 00:04:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-03 00:04:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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-03 00:04:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-05-03 00:04:10,859 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 47 [2021-05-03 00:04:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-05-03 00:04:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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-03 00:04:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-05-03 00:04:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-03 00:04:10,860 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:10,860 INFO L523 BasicCegarLoop]: trace histogram [16, 14, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:10,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:04:10,860 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1937112907, now seen corresponding path program 14 times [2021-05-03 00:04:10,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:10,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [631689166] [2021-05-03 00:04:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:10,867 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_252 999999) (<= 50000 v_main_~x~0_252)) InVars {main_~x~0=v_main_~x~0_252} OutVars{main_~x~0=v_main_~x~0_252} AuxVars[] AssignedVars[] [2021-05-03 00:04:10,869 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:10,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:10,872 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:10,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:10,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:10,908 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:10,937 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_254 50000) (< v_main_~x~0_254 999999)) InVars {main_~x~0=v_main_~x~0_254} OutVars{main_~x~0=v_main_~x~0_254} AuxVars[] AssignedVars[] [2021-05-03 00:04:10,938 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:10,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:10,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:10,954 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:10,964 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:10,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_256 50000) InVars {main_~x~0=v_main_~x~0_256} OutVars{main_~x~0=v_main_~x~0_256} AuxVars[] AssignedVars[] [2021-05-03 00:04:10,966 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:10,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:10,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:11,019 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:11,032 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_258 1000000) (<= 50000 v_main_~x~0_258)) InVars {main_~x~0=v_main_~x~0_258} OutVars{main_~x~0=v_main_~x~0_258} AuxVars[] AssignedVars[] [2021-05-03 00:04:11,036 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:11,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:11,055 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:11,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:11,069 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:11,081 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:11,098 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:11,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:11,264 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-03 00:04:11,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:11,511 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:11,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [631689166] [2021-05-03 00:04:11,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [631689166] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:11,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:11,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:04:11,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808353289] [2021-05-03 00:04:11,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:04:11,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:04:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:04:11,512 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 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-03 00:04:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:12,546 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-05-03 00:04:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:04:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 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-03 00:04:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:12,547 INFO L225 Difference]: With dead ends: 71 [2021-05-03 00:04:12,547 INFO L226 Difference]: Without dead ends: 54 [2021-05-03 00:04:12,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1015.7ms TimeCoverageRelationStatistics Valid=558, Invalid=1794, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:04:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-03 00:04:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-05-03 00:04:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-05-03 00:04:12,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 50 [2021-05-03 00:04:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:12,556 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-05-03 00:04:12,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 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-03 00:04:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-05-03 00:04:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:04:12,558 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:12,558 INFO L523 BasicCegarLoop]: trace histogram [17, 15, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:12,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:04:12,558 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1750023445, now seen corresponding path program 15 times [2021-05-03 00:04:12,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:12,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581695785] [2021-05-03 00:04:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:12,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_277) (< v_main_~x~0_277 999999)) InVars {main_~x~0=v_main_~x~0_277} OutVars{main_~x~0=v_main_~x~0_277} AuxVars[] AssignedVars[] [2021-05-03 00:04:12,571 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:12,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:12,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:12,621 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:12,640 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_279 50000) (< v_main_~x~0_279 999999)) InVars {main_~x~0=v_main_~x~0_279} OutVars{main_~x~0=v_main_~x~0_279} AuxVars[] AssignedVars[] [2021-05-03 00:04:12,641 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:12,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:12,657 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:12,666 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:12,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_281 50000) InVars {main_~x~0=v_main_~x~0_281} OutVars{main_~x~0=v_main_~x~0_281} AuxVars[] AssignedVars[] [2021-05-03 00:04:12,669 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:12,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:12,685 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:12,698 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_283) (< v_main_~x~0_283 1000000)) InVars {main_~x~0=v_main_~x~0_283} OutVars{main_~x~0=v_main_~x~0_283} AuxVars[] AssignedVars[] [2021-05-03 00:04:12,700 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:12,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:12,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:12,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:12,741 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:12,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:12,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:12,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:13,287 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:13,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581695785] [2021-05-03 00:04:13,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1581695785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:13,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:13,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:04:13,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802117767] [2021-05-03 00:04:13,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:04:13,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:04:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:04:13,289 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 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-03 00:04:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:14,261 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-05-03 00:04:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:04:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 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-03 00:04:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:14,262 INFO L225 Difference]: With dead ends: 74 [2021-05-03 00:04:14,262 INFO L226 Difference]: Without dead ends: 56 [2021-05-03 00:04:14,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 984.4ms TimeCoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:04:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-03 00:04:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-05-03 00:04:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 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-03 00:04:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-03 00:04:14,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 53 [2021-05-03 00:04:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-03 00:04:14,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 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-03 00:04:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-03 00:04:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:04:14,270 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:14,270 INFO L523 BasicCegarLoop]: trace histogram [18, 16, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:14,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-03 00:04:14,270 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1246701198, now seen corresponding path program 16 times [2021-05-03 00:04:14,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:14,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321490275] [2021-05-03 00:04:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:14,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_303 999999) (<= 50000 v_main_~x~0_303)) InVars {main_~x~0=v_main_~x~0_303} OutVars{main_~x~0=v_main_~x~0_303} AuxVars[] AssignedVars[] [2021-05-03 00:04:14,279 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:14,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:14,306 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:14,320 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:14,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_305 50000) (< v_main_~x~0_305 999999)) InVars {main_~x~0=v_main_~x~0_305} OutVars{main_~x~0=v_main_~x~0_305} AuxVars[] AssignedVars[] [2021-05-03 00:04:14,344 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:14,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:14,362 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:14,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:14,375 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_307 50000) InVars {main_~x~0=v_main_~x~0_307} OutVars{main_~x~0=v_main_~x~0_307} AuxVars[] AssignedVars[] [2021-05-03 00:04:14,376 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:14,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:14,392 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:14,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_309 1000000) (<= 50000 v_main_~x~0_309)) InVars {main_~x~0=v_main_~x~0_309} OutVars{main_~x~0=v_main_~x~0_309} AuxVars[] AssignedVars[] [2021-05-03 00:04:14,417 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:14,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:14,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:14,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:14,465 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:14,483 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:14,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:14,608 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-03 00:04:14,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:14,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:14,690 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:14,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [321490275] [2021-05-03 00:04:14,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [321490275] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:14,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:14,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:04:14,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670368360] [2021-05-03 00:04:14,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:04:14,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:04:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=136, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:04:14,692 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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-03 00:04:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:15,071 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2021-05-03 00:04:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:04:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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 55 [2021-05-03 00:04:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:15,072 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:04:15,072 INFO L226 Difference]: Without dead ends: 62 [2021-05-03 00:04:15,072 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 415.6ms TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:04:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-03 00:04:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-05-03 00:04:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 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-03 00:04:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2021-05-03 00:04:15,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 55 [2021-05-03 00:04:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:15,079 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2021-05-03 00:04:15,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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-03 00:04:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2021-05-03 00:04:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:04:15,080 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:15,080 INFO L523 BasicCegarLoop]: trace histogram [20, 16, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:15,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:04:15,080 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 27925448, now seen corresponding path program 17 times [2021-05-03 00:04:15,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:15,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511256969] [2021-05-03 00:04:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:15,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_331 999999) (<= 50000 v_main_~x~0_331)) InVars {main_~x~0=v_main_~x~0_331} OutVars{main_~x~0=v_main_~x~0_331} AuxVars[] AssignedVars[] [2021-05-03 00:04:15,098 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:15,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:15,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:15,148 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:15,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_333 50000) (< v_main_~x~0_333 999999)) InVars {main_~x~0=v_main_~x~0_333} OutVars{main_~x~0=v_main_~x~0_333} AuxVars[] AssignedVars[] [2021-05-03 00:04:15,169 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:15,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:15,187 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:15,196 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:15,197 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_335 50000) InVars {main_~x~0=v_main_~x~0_335} OutVars{main_~x~0=v_main_~x~0_335} AuxVars[] AssignedVars[] [2021-05-03 00:04:15,198 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:15,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:15,224 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:15,236 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_337) (< v_main_~x~0_337 1000000)) InVars {main_~x~0=v_main_~x~0_337} OutVars{main_~x~0=v_main_~x~0_337} AuxVars[] AssignedVars[] [2021-05-03 00:04:15,241 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:15,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:15,252 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:15,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:15,282 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:15,298 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:15,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:15,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:15,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:15,522 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:15,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511256969] [2021-05-03 00:04:15,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [511256969] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:15,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:15,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:04:15,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488776808] [2021-05-03 00:04:15,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:04:15,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:04:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:04:15,524 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-03 00:04:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:16,023 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-05-03 00:04:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:04:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 61 [2021-05-03 00:04:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:16,024 INFO L225 Difference]: With dead ends: 91 [2021-05-03 00:04:16,024 INFO L226 Difference]: Without dead ends: 67 [2021-05-03 00:04:16,024 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 544.7ms TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:04:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-03 00:04:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-03 00:04:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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-03 00:04:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2021-05-03 00:04:16,031 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 61 [2021-05-03 00:04:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:16,031 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2021-05-03 00:04:16,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-03 00:04:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2021-05-03 00:04:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-03 00:04:16,032 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:16,032 INFO L523 BasicCegarLoop]: trace histogram [22, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:16,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-03 00:04:16,032 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1469820955, now seen corresponding path program 18 times [2021-05-03 00:04:16,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:16,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605135730] [2021-05-03 00:04:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:16,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_361 999999) (<= 50000 v_main_~x~0_361)) InVars {main_~x~0=v_main_~x~0_361} OutVars{main_~x~0=v_main_~x~0_361} AuxVars[] AssignedVars[] [2021-05-03 00:04:16,039 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:16,054 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:16,067 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:16,082 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:16,102 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_363 999999) (< v_main_~x~0_363 50000)) InVars {main_~x~0=v_main_~x~0_363} OutVars{main_~x~0=v_main_~x~0_363} AuxVars[] AssignedVars[] [2021-05-03 00:04:16,103 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:16,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:16,118 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:16,127 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:16,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_365 50000) InVars {main_~x~0=v_main_~x~0_365} OutVars{main_~x~0=v_main_~x~0_365} AuxVars[] AssignedVars[] [2021-05-03 00:04:16,131 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:16,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,141 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:16,148 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:16,159 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_367) (< v_main_~x~0_367 1000000)) InVars {main_~x~0=v_main_~x~0_367} OutVars{main_~x~0=v_main_~x~0_367} AuxVars[] AssignedVars[] [2021-05-03 00:04:16,174 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:16,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:16,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:16,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:16,223 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:16,240 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:16,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:16,411 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-03 00:04:16,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:16,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:16,534 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:16,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605135730] [2021-05-03 00:04:16,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [605135730] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:16,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:16,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:04:16,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443484283] [2021-05-03 00:04:16,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:04:16,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:16,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:04:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=304, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:04:16,535 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:17,149 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-05-03 00:04:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:04:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-03 00:04:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:17,150 INFO L225 Difference]: With dead ends: 101 [2021-05-03 00:04:17,150 INFO L226 Difference]: Without dead ends: 72 [2021-05-03 00:04:17,151 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 704.7ms TimeCoverageRelationStatistics Valid=587, Invalid=1135, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:04:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-03 00:04:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-05-03 00:04:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-05-03 00:04:17,156 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 66 [2021-05-03 00:04:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:17,156 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-05-03 00:04:17,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-05-03 00:04:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:04:17,156 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:17,157 INFO L523 BasicCegarLoop]: trace histogram [24, 16, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:17,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:04:17,157 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -579649772, now seen corresponding path program 19 times [2021-05-03 00:04:17,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:17,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688835220] [2021-05-03 00:04:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:17,174 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_393) (< v_main_~x~0_393 999999)) InVars {main_~x~0=v_main_~x~0_393} OutVars{main_~x~0=v_main_~x~0_393} AuxVars[] AssignedVars[] [2021-05-03 00:04:17,176 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:17,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:17,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:17,220 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:17,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_395 999999) (< v_main_~x~0_395 50000)) InVars {main_~x~0=v_main_~x~0_395} OutVars{main_~x~0=v_main_~x~0_395} AuxVars[] AssignedVars[] [2021-05-03 00:04:17,251 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:17,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:17,271 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:17,280 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:17,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_397 50000) InVars {main_~x~0=v_main_~x~0_397} OutVars{main_~x~0=v_main_~x~0_397} AuxVars[] AssignedVars[] [2021-05-03 00:04:17,282 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:17,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:17,297 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:17,313 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_399) (< v_main_~x~0_399 1000000)) InVars {main_~x~0=v_main_~x~0_399} OutVars{main_~x~0=v_main_~x~0_399} AuxVars[] AssignedVars[] [2021-05-03 00:04:17,315 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:17,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:17,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:17,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:17,353 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:17,370 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:17,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:17,605 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-03 00:04:17,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:17,892 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:17,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688835220] [2021-05-03 00:04:17,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [688835220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:17,892 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:17,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:04:17,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449033456] [2021-05-03 00:04:17,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:04:17,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:04:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:04:17,893 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 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-03 00:04:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:19,156 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-05-03 00:04:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:04:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 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 71 [2021-05-03 00:04:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:19,157 INFO L225 Difference]: With dead ends: 109 [2021-05-03 00:04:19,157 INFO L226 Difference]: Without dead ends: 75 [2021-05-03 00:04:19,158 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1359.6ms TimeCoverageRelationStatistics Valid=1091, Invalid=2941, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:04:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-03 00:04:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-03 00:04:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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-03 00:04:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-03 00:04:19,163 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 71 [2021-05-03 00:04:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:19,163 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-03 00:04:19,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 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-03 00:04:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-03 00:04:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-03 00:04:19,165 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:19,165 INFO L523 BasicCegarLoop]: trace histogram [25, 17, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:19,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:04:19,165 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1686022994, now seen corresponding path program 20 times [2021-05-03 00:04:19,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:19,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688312624] [2021-05-03 00:04:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:19,173 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_420) (< v_main_~x~0_420 999999)) InVars {main_~x~0=v_main_~x~0_420} OutVars{main_~x~0=v_main_~x~0_420} AuxVars[] AssignedVars[] [2021-05-03 00:04:19,175 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:19,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:19,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:19,217 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:19,237 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_422 50000) (< v_main_~x~0_422 999999)) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_422} AuxVars[] AssignedVars[] [2021-05-03 00:04:19,238 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:19,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:19,253 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:19,263 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:19,264 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_424 50000) InVars {main_~x~0=v_main_~x~0_424} OutVars{main_~x~0=v_main_~x~0_424} AuxVars[] AssignedVars[] [2021-05-03 00:04:19,266 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:19,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:19,287 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:19,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_426) (< v_main_~x~0_426 1000000)) InVars {main_~x~0=v_main_~x~0_426} OutVars{main_~x~0=v_main_~x~0_426} AuxVars[] AssignedVars[] [2021-05-03 00:04:19,301 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:19,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:19,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:19,335 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:19,351 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:19,367 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:19,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:19,577 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-03 00:04:19,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:19,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:19,758 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:19,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688312624] [2021-05-03 00:04:19,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1688312624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:19,758 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:19,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:04:19,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911382210] [2021-05-03 00:04:19,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:04:19,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:04:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=451, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:04:19,760 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:20,649 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2021-05-03 00:04:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:04:20,650 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 2 states have call successors, (3), 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-03 00:04:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:20,650 INFO L225 Difference]: With dead ends: 116 [2021-05-03 00:04:20,650 INFO L226 Difference]: Without dead ends: 81 [2021-05-03 00:04:20,652 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1010.4ms TimeCoverageRelationStatistics Valid=893, Invalid=1759, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:04:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-03 00:04:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-03 00:04:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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-03 00:04:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-05-03 00:04:20,659 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 74 [2021-05-03 00:04:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:20,659 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-05-03 00:04:20,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-05-03 00:04:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-03 00:04:20,660 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:20,660 INFO L523 BasicCegarLoop]: trace histogram [27, 17, 14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:20,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:04:20,660 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash -569114116, now seen corresponding path program 21 times [2021-05-03 00:04:20,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:20,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904663447] [2021-05-03 00:04:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:20,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_455 999999) (<= 50000 v_main_~x~0_455)) InVars {main_~x~0=v_main_~x~0_455} OutVars{main_~x~0=v_main_~x~0_455} AuxVars[] AssignedVars[] [2021-05-03 00:04:20,670 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:20,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:20,688 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:20,717 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:20,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_457 999999) (< v_main_~x~0_457 50000)) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_457} AuxVars[] AssignedVars[] [2021-05-03 00:04:20,740 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:20,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:20,758 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:20,769 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:20,770 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_459 50000) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-03 00:04:20,771 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:20,778 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:20,789 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:20,801 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_461) (< v_main_~x~0_461 1000000)) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-03 00:04:20,803 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:20,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:20,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:20,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:20,845 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:20,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:21,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:21,115 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-03 00:04:21,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:21,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:21,346 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:21,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904663447] [2021-05-03 00:04:21,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1904663447] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:21,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:21,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:04:21,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771636606] [2021-05-03 00:04:21,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:04:21,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:21,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:04:21,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=562, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:04:21,349 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:22,456 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2021-05-03 00:04:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:04:22,457 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 2 states have call successors, (3), 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-03 00:04:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:22,458 INFO L225 Difference]: With dead ends: 127 [2021-05-03 00:04:22,458 INFO L226 Difference]: Without dead ends: 86 [2021-05-03 00:04:22,459 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1217.1ms TimeCoverageRelationStatistics Valid=1081, Invalid=2225, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:04:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-03 00:04:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-05-03 00:04:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 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-03 00:04:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-05-03 00:04:22,465 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 80 [2021-05-03 00:04:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:22,465 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-05-03 00:04:22,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-05-03 00:04:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-03 00:04:22,466 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:22,466 INFO L523 BasicCegarLoop]: trace histogram [29, 17, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:22,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:04:22,466 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1854715997, now seen corresponding path program 22 times [2021-05-03 00:04:22,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:22,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776468198] [2021-05-03 00:04:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:22,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_492 999999) (<= 50000 v_main_~x~0_492)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-03 00:04:22,479 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:22,481 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:22,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:22,529 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:22,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_494 50000) (< v_main_~x~0_494 999999)) InVars {main_~x~0=v_main_~x~0_494} OutVars{main_~x~0=v_main_~x~0_494} AuxVars[] AssignedVars[] [2021-05-03 00:04:22,552 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:22,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:22,569 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:22,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:22,581 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_496 50000) InVars {main_~x~0=v_main_~x~0_496} OutVars{main_~x~0=v_main_~x~0_496} AuxVars[] AssignedVars[] [2021-05-03 00:04:22,582 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:22,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:22,605 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:22,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_498) (< v_main_~x~0_498 1000000)) InVars {main_~x~0=v_main_~x~0_498} OutVars{main_~x~0=v_main_~x~0_498} AuxVars[] AssignedVars[] [2021-05-03 00:04:22,619 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:22,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:22,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:22,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:22,674 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:22,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:22,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:22,987 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-03 00:04:22,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:23,520 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:23,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776468198] [2021-05-03 00:04:23,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1776468198] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:23,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:23,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:04:23,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446126574] [2021-05-03 00:04:23,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:04:23,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:23,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:04:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:04:23,522 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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-03 00:04:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:24,763 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2021-05-03 00:04:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:04:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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 85 [2021-05-03 00:04:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:24,764 INFO L225 Difference]: With dead ends: 134 [2021-05-03 00:04:24,764 INFO L226 Difference]: Without dead ends: 88 [2021-05-03 00:04:24,765 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1354.2ms TimeCoverageRelationStatistics Valid=311, Invalid=2995, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:04:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-03 00:04:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-05-03 00:04:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-05-03 00:04:24,771 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 85 [2021-05-03 00:04:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:24,771 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-05-03 00:04:24,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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-03 00:04:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-05-03 00:04:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:04:24,772 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:24,772 INFO L523 BasicCegarLoop]: trace histogram [30, 18, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:24,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:04:24,773 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 635281594, now seen corresponding path program 23 times [2021-05-03 00:04:24,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:24,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967415910] [2021-05-03 00:04:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:24,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_520) (< v_main_~x~0_520 999999)) InVars {main_~x~0=v_main_~x~0_520} OutVars{main_~x~0=v_main_~x~0_520} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,782 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:24,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:24,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:24,824 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:24,842 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_522 999999) (< v_main_~x~0_522 50000)) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,845 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:24,855 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:24,864 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:24,873 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:24,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_524 50000) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,875 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:24,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:24,891 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:24,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_526 1000000) (<= 50000 v_main_~x~0_526)) InVars {main_~x~0=v_main_~x~0_526} OutVars{main_~x~0=v_main_~x~0_526} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,917 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:24,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,920 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:24,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:24,955 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:24,972 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:25,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:25,242 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-03 00:04:25,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:25,748 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:25,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967415910] [2021-05-03 00:04:25,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [967415910] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:25,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:25,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:04:25,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673272296] [2021-05-03 00:04:25,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:04:25,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:04:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:04:25,750 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:27,083 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2021-05-03 00:04:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:04:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 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 87 [2021-05-03 00:04:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:27,084 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:04:27,084 INFO L226 Difference]: Without dead ends: 90 [2021-05-03 00:04:27,086 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1360.4ms TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:04:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-03 00:04:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-05-03 00:04:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-05-03 00:04:27,094 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 87 [2021-05-03 00:04:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:27,094 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-05-03 00:04:27,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-05-03 00:04:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:04:27,095 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:27,095 INFO L523 BasicCegarLoop]: trace histogram [31, 19, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:27,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:04:27,095 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1284892119, now seen corresponding path program 24 times [2021-05-03 00:04:27,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:27,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608286861] [2021-05-03 00:04:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:27,101 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_549 999999) (<= 50000 v_main_~x~0_549)) InVars {main_~x~0=v_main_~x~0_549} OutVars{main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[] [2021-05-03 00:04:27,105 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:27,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:27,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:27,152 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:27,171 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_551 999999) (< v_main_~x~0_551 50000)) InVars {main_~x~0=v_main_~x~0_551} OutVars{main_~x~0=v_main_~x~0_551} AuxVars[] AssignedVars[] [2021-05-03 00:04:27,176 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:27,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:27,192 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:27,202 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:27,203 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_553 50000) InVars {main_~x~0=v_main_~x~0_553} OutVars{main_~x~0=v_main_~x~0_553} AuxVars[] AssignedVars[] [2021-05-03 00:04:27,204 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:27,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:27,227 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:27,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_555 1000000) (<= 50000 v_main_~x~0_555)) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-03 00:04:27,243 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:27,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:27,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:27,291 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:27,314 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:27,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:27,577 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-03 00:04:27,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:28,097 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:28,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608286861] [2021-05-03 00:04:28,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [608286861] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:28,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:28,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:04:28,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259839389] [2021-05-03 00:04:28,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:04:28,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:04:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:04:28,099 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 38 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:29,523 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2021-05-03 00:04:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:04:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 38 states have internal predecessors, (65), 2 states have call successors, (3), 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-03 00:04:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:29,524 INFO L225 Difference]: With dead ends: 138 [2021-05-03 00:04:29,524 INFO L226 Difference]: Without dead ends: 92 [2021-05-03 00:04:29,525 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1435.3ms TimeCoverageRelationStatistics Valid=327, Invalid=3455, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:04:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-03 00:04:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-05-03 00:04:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 87 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-03 00:04:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2021-05-03 00:04:29,531 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 89 [2021-05-03 00:04:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:29,531 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2021-05-03 00:04:29,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 38 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2021-05-03 00:04:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:04:29,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:29,532 INFO L523 BasicCegarLoop]: trace histogram [32, 20, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:29,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:04:29,532 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1504618572, now seen corresponding path program 25 times [2021-05-03 00:04:29,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:29,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [179949265] [2021-05-03 00:04:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:29,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_579 999999) (<= 50000 v_main_~x~0_579)) InVars {main_~x~0=v_main_~x~0_579} OutVars{main_~x~0=v_main_~x~0_579} AuxVars[] AssignedVars[] [2021-05-03 00:04:29,548 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:29,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:29,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:29,596 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:29,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_581 999999) (< v_main_~x~0_581 50000)) InVars {main_~x~0=v_main_~x~0_581} OutVars{main_~x~0=v_main_~x~0_581} AuxVars[] AssignedVars[] [2021-05-03 00:04:29,615 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:29,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:29,630 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:29,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:29,640 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_583 50000) InVars {main_~x~0=v_main_~x~0_583} OutVars{main_~x~0=v_main_~x~0_583} AuxVars[] AssignedVars[] [2021-05-03 00:04:29,642 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:29,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:29,657 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:29,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_585 1000000) (<= 50000 v_main_~x~0_585)) InVars {main_~x~0=v_main_~x~0_585} OutVars{main_~x~0=v_main_~x~0_585} AuxVars[] AssignedVars[] [2021-05-03 00:04:29,676 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:29,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:29,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:29,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:29,717 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:29,734 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:30,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:30,010 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-03 00:04:30,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:30,650 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:30,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [179949265] [2021-05-03 00:04:30,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [179949265] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:30,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:30,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:04:30,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211709112] [2021-05-03 00:04:30,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:04:30,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:04:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:04:30,651 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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-03 00:04:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:32,155 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2021-05-03 00:04:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:04:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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 91 [2021-05-03 00:04:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:32,156 INFO L225 Difference]: With dead ends: 140 [2021-05-03 00:04:32,156 INFO L226 Difference]: Without dead ends: 94 [2021-05-03 00:04:32,157 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1624.2ms TimeCoverageRelationStatistics Valid=336, Invalid=3696, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:04:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-03 00:04:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-05-03 00:04:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2021-05-03 00:04:32,164 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 91 [2021-05-03 00:04:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:32,164 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2021-05-03 00:04:32,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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-03 00:04:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2021-05-03 00:04:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-03 00:04:32,165 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:32,165 INFO L523 BasicCegarLoop]: trace histogram [33, 21, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:32,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:04:32,165 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:32,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2130167377, now seen corresponding path program 26 times [2021-05-03 00:04:32,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:32,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268792062] [2021-05-03 00:04:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:32,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_610) (< v_main_~x~0_610 999999)) InVars {main_~x~0=v_main_~x~0_610} OutVars{main_~x~0=v_main_~x~0_610} AuxVars[] AssignedVars[] [2021-05-03 00:04:32,173 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:32,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:32,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:32,225 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:32,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_612 50000) (< v_main_~x~0_612 999999)) InVars {main_~x~0=v_main_~x~0_612} OutVars{main_~x~0=v_main_~x~0_612} AuxVars[] AssignedVars[] [2021-05-03 00:04:32,251 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:32,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:32,268 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:32,278 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:32,279 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_614 50000) InVars {main_~x~0=v_main_~x~0_614} OutVars{main_~x~0=v_main_~x~0_614} AuxVars[] AssignedVars[] [2021-05-03 00:04:32,279 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:32,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:32,296 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:32,314 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_616 1000000) (<= 50000 v_main_~x~0_616)) InVars {main_~x~0=v_main_~x~0_616} OutVars{main_~x~0=v_main_~x~0_616} AuxVars[] AssignedVars[] [2021-05-03 00:04:32,315 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:32,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:32,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:32,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:32,361 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:32,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:32,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:32,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:33,234 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:33,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268792062] [2021-05-03 00:04:33,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1268792062] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:33,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:33,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:04:33,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450067063] [2021-05-03 00:04:33,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:04:33,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:33,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:04:33,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:04:33,236 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 41 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 40 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:34,850 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2021-05-03 00:04:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:04:34,850 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 40 states have internal predecessors, (69), 2 states have call successors, (3), 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 93 [2021-05-03 00:04:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:34,851 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:04:34,851 INFO L226 Difference]: Without dead ends: 96 [2021-05-03 00:04:34,852 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1611.1ms TimeCoverageRelationStatistics Valid=344, Invalid=3946, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:04:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-05-03 00:04:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-05-03 00:04:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2021-05-03 00:04:34,859 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 93 [2021-05-03 00:04:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:34,859 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2021-05-03 00:04:34,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 40 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2021-05-03 00:04:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:04:34,859 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:34,859 INFO L523 BasicCegarLoop]: trace histogram [34, 22, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:34,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:04:34,860 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash -943914578, now seen corresponding path program 27 times [2021-05-03 00:04:34,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:34,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713807362] [2021-05-03 00:04:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:34,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_642 999999) (<= 50000 v_main_~x~0_642)) InVars {main_~x~0=v_main_~x~0_642} OutVars{main_~x~0=v_main_~x~0_642} AuxVars[] AssignedVars[] [2021-05-03 00:04:34,867 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:34,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:34,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:34,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:34,889 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:34,917 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:34,937 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_644 50000) (< v_main_~x~0_644 999999)) InVars {main_~x~0=v_main_~x~0_644} OutVars{main_~x~0=v_main_~x~0_644} AuxVars[] AssignedVars[] [2021-05-03 00:04:34,938 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:34,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:34,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:34,957 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:34,967 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:34,969 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_646 50000) InVars {main_~x~0=v_main_~x~0_646} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[] [2021-05-03 00:04:34,970 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:34,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:34,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:34,992 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:35,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_648 1000000) (<= 50000 v_main_~x~0_648)) InVars {main_~x~0=v_main_~x~0_648} OutVars{main_~x~0=v_main_~x~0_648} AuxVars[] AssignedVars[] [2021-05-03 00:04:35,006 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:35,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:35,026 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:35,035 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:35,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:35,050 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:35,067 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:35,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:35,341 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-03 00:04:35,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:35,756 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:35,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713807362] [2021-05-03 00:04:35,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [713807362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:35,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:35,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:04:35,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107324494] [2021-05-03 00:04:35,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:04:35,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:04:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:04:35,758 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:37,644 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2021-05-03 00:04:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:04:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 2 states have call successors, (3), 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-03 00:04:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:37,645 INFO L225 Difference]: With dead ends: 145 [2021-05-03 00:04:37,645 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:04:37,646 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 1931.2ms TimeCoverageRelationStatistics Valid=1837, Invalid=5135, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:04:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:04:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-03 00:04:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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-03 00:04:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2021-05-03 00:04:37,652 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2021-05-03 00:04:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:37,652 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2021-05-03 00:04:37,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2021-05-03 00:04:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-03 00:04:37,652 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:37,652 INFO L523 BasicCegarLoop]: trace histogram [35, 23, 16, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:37,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:04:37,653 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1843879176, now seen corresponding path program 28 times [2021-05-03 00:04:37,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:37,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184612794] [2021-05-03 00:04:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:37,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_675) (< v_main_~x~0_675 999999)) InVars {main_~x~0=v_main_~x~0_675} OutVars{main_~x~0=v_main_~x~0_675} AuxVars[] AssignedVars[] [2021-05-03 00:04:37,660 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:37,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:37,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:37,695 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:37,713 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_677 999999) (< v_main_~x~0_677 50000)) InVars {main_~x~0=v_main_~x~0_677} OutVars{main_~x~0=v_main_~x~0_677} AuxVars[] AssignedVars[] [2021-05-03 00:04:37,714 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:37,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:37,732 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:37,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:37,744 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_679 50000) InVars {main_~x~0=v_main_~x~0_679} OutVars{main_~x~0=v_main_~x~0_679} AuxVars[] AssignedVars[] [2021-05-03 00:04:37,746 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:37,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,756 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:37,762 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:37,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_681) (< v_main_~x~0_681 1000000)) InVars {main_~x~0=v_main_~x~0_681} OutVars{main_~x~0=v_main_~x~0_681} AuxVars[] AssignedVars[] [2021-05-03 00:04:37,781 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:37,782 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:37,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:37,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:37,819 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:37,837 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:38,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:38,121 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-03 00:04:38,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:38,809 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:38,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184612794] [2021-05-03 00:04:38,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1184612794] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:38,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:38,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:04:38,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939044758] [2021-05-03 00:04:38,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:04:38,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:04:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:04:38,811 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:40,644 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2021-05-03 00:04:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:04:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-03 00:04:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:40,645 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:04:40,646 INFO L226 Difference]: Without dead ends: 101 [2021-05-03 00:04:40,646 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1823.9ms TimeCoverageRelationStatistics Valid=377, Invalid=4593, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:04:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-03 00:04:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-03 00:04:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 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-03 00:04:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2021-05-03 00:04:40,653 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 98 [2021-05-03 00:04:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:40,653 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2021-05-03 00:04:40,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2021-05-03 00:04:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-05-03 00:04:40,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:40,654 INFO L523 BasicCegarLoop]: trace histogram [36, 24, 16, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:40,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:04:40,654 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1225980347, now seen corresponding path program 29 times [2021-05-03 00:04:40,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:40,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703884220] [2021-05-03 00:04:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:40,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_709 999999) (<= 50000 v_main_~x~0_709)) InVars {main_~x~0=v_main_~x~0_709} OutVars{main_~x~0=v_main_~x~0_709} AuxVars[] AssignedVars[] [2021-05-03 00:04:40,662 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:40,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:40,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:40,701 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:40,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_711 50000) (< v_main_~x~0_711 999999)) InVars {main_~x~0=v_main_~x~0_711} OutVars{main_~x~0=v_main_~x~0_711} AuxVars[] AssignedVars[] [2021-05-03 00:04:40,720 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:40,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:40,744 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:40,753 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:40,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_713 50000) InVars {main_~x~0=v_main_~x~0_713} OutVars{main_~x~0=v_main_~x~0_713} AuxVars[] AssignedVars[] [2021-05-03 00:04:40,755 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:40,762 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:40,771 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:40,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_715) (< v_main_~x~0_715 1000000)) InVars {main_~x~0=v_main_~x~0_715} OutVars{main_~x~0=v_main_~x~0_715} AuxVars[] AssignedVars[] [2021-05-03 00:04:40,783 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:40,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:40,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:40,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:40,821 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:40,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:41,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:41,169 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-03 00:04:41,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:41,704 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:41,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703884220] [2021-05-03 00:04:41,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1703884220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:41,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:41,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:04:41,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383632988] [2021-05-03 00:04:41,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:04:41,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:04:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1465, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:04:41,706 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 45 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 44 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-03 00:04:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:43,811 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2021-05-03 00:04:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:04:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 44 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 100 [2021-05-03 00:04:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:43,812 INFO L225 Difference]: With dead ends: 151 [2021-05-03 00:04:43,812 INFO L226 Difference]: Without dead ends: 104 [2021-05-03 00:04:43,813 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 2268.1ms TimeCoverageRelationStatistics Valid=2013, Invalid=5819, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:04:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-03 00:04:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-05-03 00:04:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 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-03 00:04:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2021-05-03 00:04:43,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 100 [2021-05-03 00:04:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:43,821 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2021-05-03 00:04:43,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 44 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-03 00:04:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2021-05-03 00:04:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-03 00:04:43,822 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:43,822 INFO L523 BasicCegarLoop]: trace histogram [37, 25, 17, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:43,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:04:43,822 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash 832638821, now seen corresponding path program 30 times [2021-05-03 00:04:43,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:43,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585427768] [2021-05-03 00:04:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:43,830 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_744) (< v_main_~x~0_744 999999)) InVars {main_~x~0=v_main_~x~0_744} OutVars{main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[] [2021-05-03 00:04:43,831 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:43,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:43,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:43,873 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:43,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_746 50000) (< v_main_~x~0_746 999999)) InVars {main_~x~0=v_main_~x~0_746} OutVars{main_~x~0=v_main_~x~0_746} AuxVars[] AssignedVars[] [2021-05-03 00:04:43,893 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:43,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:43,909 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:43,918 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:43,920 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_748 50000) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_748} AuxVars[] AssignedVars[] [2021-05-03 00:04:43,921 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:43,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:43,937 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:43,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_750 1000000) (<= 50000 v_main_~x~0_750)) InVars {main_~x~0=v_main_~x~0_750} OutVars{main_~x~0=v_main_~x~0_750} AuxVars[] AssignedVars[] [2021-05-03 00:04:43,956 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:43,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:43,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:43,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:43,994 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:44,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:44,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:44,380 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-03 00:04:44,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:44,979 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:44,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585427768] [2021-05-03 00:04:44,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [585427768] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:44,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:44,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:04:44,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847728357] [2021-05-03 00:04:44,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:04:44,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:04:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1589, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:04:44,981 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand has 47 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 46 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-03 00:04:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:47,200 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2021-05-03 00:04:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:04:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 46 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 103 [2021-05-03 00:04:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:47,201 INFO L225 Difference]: With dead ends: 155 [2021-05-03 00:04:47,201 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:04:47,202 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 2417.5ms TimeCoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:04:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:04:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-03 00:04:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 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-03 00:04:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2021-05-03 00:04:47,212 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 103 [2021-05-03 00:04:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:47,212 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2021-05-03 00:04:47,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 46 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-03 00:04:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2021-05-03 00:04:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-05-03 00:04:47,213 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:47,213 INFO L523 BasicCegarLoop]: trace histogram [38, 26, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:47,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-03 00:04:47,213 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1151330015, now seen corresponding path program 31 times [2021-05-03 00:04:47,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:47,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6700721] [2021-05-03 00:04:47,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:47,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_780 999999) (<= 50000 v_main_~x~0_780)) InVars {main_~x~0=v_main_~x~0_780} OutVars{main_~x~0=v_main_~x~0_780} AuxVars[] AssignedVars[] [2021-05-03 00:04:47,222 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:47,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:47,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:47,270 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:47,291 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_782 999999) (< v_main_~x~0_782 50000)) InVars {main_~x~0=v_main_~x~0_782} OutVars{main_~x~0=v_main_~x~0_782} AuxVars[] AssignedVars[] [2021-05-03 00:04:47,293 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:47,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:47,310 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:47,319 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:47,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_784 50000) InVars {main_~x~0=v_main_~x~0_784} OutVars{main_~x~0=v_main_~x~0_784} AuxVars[] AssignedVars[] [2021-05-03 00:04:47,321 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:47,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:47,343 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:47,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_786) (< v_main_~x~0_786 1000000)) InVars {main_~x~0=v_main_~x~0_786} OutVars{main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[] [2021-05-03 00:04:47,355 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:47,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:47,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:47,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:47,392 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:47,410 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:47,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:47,763 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-03 00:04:47,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:48,616 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:48,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6700721] [2021-05-03 00:04:48,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [6700721] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:48,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:48,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:04:48,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053752660] [2021-05-03 00:04:48,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:04:48,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:04:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2348, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:04:48,617 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 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-03 00:04:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:50,894 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2021-05-03 00:04:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:04:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 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 106 [2021-05-03 00:04:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:50,895 INFO L225 Difference]: With dead ends: 158 [2021-05-03 00:04:50,895 INFO L226 Difference]: Without dead ends: 109 [2021-05-03 00:04:50,896 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2242.6ms TimeCoverageRelationStatistics Valid=440, Invalid=5722, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:04:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-03 00:04:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-03 00:04:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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-03 00:04:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2021-05-03 00:04:50,911 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 106 [2021-05-03 00:04:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:50,911 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2021-05-03 00:04:50,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 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-03 00:04:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2021-05-03 00:04:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-05-03 00:04:50,912 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:50,912 INFO L523 BasicCegarLoop]: trace histogram [39, 27, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:50,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-05-03 00:04:50,912 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -976945948, now seen corresponding path program 32 times [2021-05-03 00:04:50,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:50,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855536899] [2021-05-03 00:04:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:50,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_817 999999) (<= 50000 v_main_~x~0_817)) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_817} AuxVars[] AssignedVars[] [2021-05-03 00:04:50,921 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:50,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:50,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:50,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:50,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:50,966 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:50,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_819 999999) (< v_main_~x~0_819 50000)) InVars {main_~x~0=v_main_~x~0_819} OutVars{main_~x~0=v_main_~x~0_819} AuxVars[] AssignedVars[] [2021-05-03 00:04:50,988 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:50,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:50,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:51,005 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:51,014 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:51,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_821 50000) InVars {main_~x~0=v_main_~x~0_821} OutVars{main_~x~0=v_main_~x~0_821} AuxVars[] AssignedVars[] [2021-05-03 00:04:51,021 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:51,027 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:51,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:51,037 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:51,062 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_823 1000000) (<= 50000 v_main_~x~0_823)) InVars {main_~x~0=v_main_~x~0_823} OutVars{main_~x~0=v_main_~x~0_823} AuxVars[] AssignedVars[] [2021-05-03 00:04:51,064 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:51,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:51,067 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:51,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:51,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:51,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:51,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:51,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:51,468 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-03 00:04:51,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:52,329 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:52,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855536899] [2021-05-03 00:04:52,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1855536899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:52,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:52,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:04:52,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951632654] [2021-05-03 00:04:52,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:04:52,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:04:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:04:52,332 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 50 states, 50 states have (on average 1.68) internal successors, (84), 49 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:54,728 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2021-05-03 00:04:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:04:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.68) internal successors, (84), 49 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2021-05-03 00:04:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:54,729 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:04:54,729 INFO L226 Difference]: Without dead ends: 111 [2021-05-03 00:04:54,730 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2319.7ms TimeCoverageRelationStatistics Valid=449, Invalid=6031, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:04:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-03 00:04:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-03 00:04:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 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-03 00:04:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2021-05-03 00:04:54,739 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 108 [2021-05-03 00:04:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2021-05-03 00:04:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.68) internal successors, (84), 49 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2021-05-03 00:04:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-03 00:04:54,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:54,740 INFO L523 BasicCegarLoop]: trace histogram [40, 28, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:54,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-03 00:04:54,740 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash -897582105, now seen corresponding path program 33 times [2021-05-03 00:04:54,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:54,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675435561] [2021-05-03 00:04:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:54,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_855) (< v_main_~x~0_855 999999)) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-03 00:04:54,748 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:54,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,759 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:54,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:54,789 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:54,808 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_857 999999) (< v_main_~x~0_857 50000)) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-03 00:04:54,809 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:54,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,821 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:54,828 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:54,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:54,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_859 50000) InVars {main_~x~0=v_main_~x~0_859} OutVars{main_~x~0=v_main_~x~0_859} AuxVars[] AssignedVars[] [2021-05-03 00:04:54,840 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:54,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:54,858 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:54,869 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_861 1000000) (<= 50000 v_main_~x~0_861)) InVars {main_~x~0=v_main_~x~0_861} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[] [2021-05-03 00:04:54,871 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:54,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:54,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:54,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:54,913 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:54,930 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:55,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:55,265 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-03 00:04:55,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:04:55,872 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:55,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675435561] [2021-05-03 00:04:55,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1675435561] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:55,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:55,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:04:55,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457433646] [2021-05-03 00:04:55,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:04:55,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:55,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:04:55,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=1934, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:04:55,874 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 51 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 50 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:58,564 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2021-05-03 00:04:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:04:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 50 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-03 00:04:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:58,565 INFO L225 Difference]: With dead ends: 163 [2021-05-03 00:04:58,566 INFO L226 Difference]: Without dead ends: 114 [2021-05-03 00:04:58,566 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 2653.8ms TimeCoverageRelationStatistics Valid=2623, Invalid=7679, Unknown=0, NotChecked=0, Total=10302 [2021-05-03 00:04:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-05-03 00:04:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-05-03 00:04:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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-03 00:04:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2021-05-03 00:04:58,574 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 110 [2021-05-03 00:04:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:58,574 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2021-05-03 00:04:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 50 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2021-05-03 00:04:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:04:58,575 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:58,575 INFO L523 BasicCegarLoop]: trace histogram [41, 29, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:58,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-03 00:04:58,575 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash 76530297, now seen corresponding path program 34 times [2021-05-03 00:04:58,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:58,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561284471] [2021-05-03 00:04:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:58,583 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_894 999999) (<= 50000 v_main_~x~0_894)) InVars {main_~x~0=v_main_~x~0_894} OutVars{main_~x~0=v_main_~x~0_894} AuxVars[] AssignedVars[] [2021-05-03 00:04:58,584 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:58,602 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,614 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:58,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:58,631 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:58,652 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_896 999999) (< v_main_~x~0_896 50000)) InVars {main_~x~0=v_main_~x~0_896} OutVars{main_~x~0=v_main_~x~0_896} AuxVars[] AssignedVars[] [2021-05-03 00:04:58,653 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:04:58,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:58,672 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:04:58,682 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:58,684 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_898 50000) InVars {main_~x~0=v_main_~x~0_898} OutVars{main_~x~0=v_main_~x~0_898} AuxVars[] AssignedVars[] [2021-05-03 00:04:58,685 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:04:58,685 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:58,701 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:04:58,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_900 1000000) (<= 50000 v_main_~x~0_900)) InVars {main_~x~0=v_main_~x~0_900} OutVars{main_~x~0=v_main_~x~0_900} AuxVars[] AssignedVars[] [2021-05-03 00:04:58,714 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:04:58,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:04:58,726 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:04:58,751 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:04:58,767 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:04:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:59,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:59,198 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-03 00:04:59,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:00,270 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:00,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561284471] [2021-05-03 00:05:00,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1561284471] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:00,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:00,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:05:00,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742434917] [2021-05-03 00:05:00,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:05:00,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:05:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2746, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:05:00,271 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:02,959 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2021-05-03 00:05:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:05:02,959 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (3), 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-03 00:05:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:02,960 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:05:02,960 INFO L226 Difference]: Without dead ends: 116 [2021-05-03 00:05:02,961 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 2774.7ms TimeCoverageRelationStatistics Valid=485, Invalid=6825, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:05:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-03 00:05:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-05-03 00:05:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 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-03 00:05:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2021-05-03 00:05:02,971 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 113 [2021-05-03 00:05:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:02,971 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2021-05-03 00:05:02,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2021-05-03 00:05:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-03 00:05:02,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:02,972 INFO L523 BasicCegarLoop]: trace histogram [42, 30, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:02,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-03 00:05:02,972 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash 217754966, now seen corresponding path program 35 times [2021-05-03 00:05:02,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:02,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587482787] [2021-05-03 00:05:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:02,980 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_934 999999) (<= 50000 v_main_~x~0_934)) InVars {main_~x~0=v_main_~x~0_934} OutVars{main_~x~0=v_main_~x~0_934} AuxVars[] AssignedVars[] [2021-05-03 00:05:02,981 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:02,997 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:02,998 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:03,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:03,024 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:03,043 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_936 50000) (< v_main_~x~0_936 999999)) InVars {main_~x~0=v_main_~x~0_936} OutVars{main_~x~0=v_main_~x~0_936} AuxVars[] AssignedVars[] [2021-05-03 00:05:03,044 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:03,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:03,060 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:03,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:03,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_938 50000) InVars {main_~x~0=v_main_~x~0_938} OutVars{main_~x~0=v_main_~x~0_938} AuxVars[] AssignedVars[] [2021-05-03 00:05:03,071 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:03,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:03,101 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:03,121 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_940) (< v_main_~x~0_940 1000000)) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-03 00:05:03,123 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:03,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,144 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,155 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:03,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:03,173 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:03,193 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:03,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:03,657 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-03 00:05:03,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:04,379 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:04,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587482787] [2021-05-03 00:05:04,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587482787] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:04,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:04,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:05:04,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097897604] [2021-05-03 00:05:04,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:05:04,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:05:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=2107, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:05:04,381 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 54 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 53 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-03 00:05:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:07,359 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2021-05-03 00:05:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:05:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 53 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 115 [2021-05-03 00:05:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:07,360 INFO L225 Difference]: With dead ends: 169 [2021-05-03 00:05:07,360 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:05:07,361 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3260 ImplicationChecksByTransitivity, 3105.4ms TimeCoverageRelationStatistics Valid=2829, Invalid=8513, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:05:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:05:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-03 00:05:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 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-03 00:05:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2021-05-03 00:05:07,370 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 115 [2021-05-03 00:05:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:07,370 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2021-05-03 00:05:07,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 53 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-03 00:05:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2021-05-03 00:05:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-05-03 00:05:07,371 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:07,371 INFO L523 BasicCegarLoop]: trace histogram [43, 31, 20, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:07,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-05-03 00:05:07,371 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 647138512, now seen corresponding path program 36 times [2021-05-03 00:05:07,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:07,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305987678] [2021-05-03 00:05:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:07,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_975) (< v_main_~x~0_975 999999)) InVars {main_~x~0=v_main_~x~0_975} OutVars{main_~x~0=v_main_~x~0_975} AuxVars[] AssignedVars[] [2021-05-03 00:05:07,381 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:07,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:07,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:07,429 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:07,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_977 999999) (< v_main_~x~0_977 50000)) InVars {main_~x~0=v_main_~x~0_977} OutVars{main_~x~0=v_main_~x~0_977} AuxVars[] AssignedVars[] [2021-05-03 00:05:07,449 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:07,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:07,465 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:07,475 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:07,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_979 50000) InVars {main_~x~0=v_main_~x~0_979} OutVars{main_~x~0=v_main_~x~0_979} AuxVars[] AssignedVars[] [2021-05-03 00:05:07,477 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:07,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:07,494 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:07,506 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_981 1000000) (<= 50000 v_main_~x~0_981)) InVars {main_~x~0=v_main_~x~0_981} OutVars{main_~x~0=v_main_~x~0_981} AuxVars[] AssignedVars[] [2021-05-03 00:05:07,507 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:07,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:07,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:07,562 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:07,580 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:07,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:07,917 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-03 00:05:07,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:07,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:08,233 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:08,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305987678] [2021-05-03 00:05:08,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [305987678] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:08,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:08,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:05:08,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429213994] [2021-05-03 00:05:08,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:05:08,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:05:08,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=816, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:05:08,235 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 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-03 00:05:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:09,799 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-05-03 00:05:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:05:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 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 118 [2021-05-03 00:05:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:09,800 INFO L225 Difference]: With dead ends: 175 [2021-05-03 00:05:09,801 INFO L226 Difference]: Without dead ends: 124 [2021-05-03 00:05:09,801 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 1794.8ms TimeCoverageRelationStatistics Valid=1764, Invalid=3492, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:05:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-05-03 00:05:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-05-03 00:05:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0336134453781514) internal successors, (123), 119 states have internal predecessors, (123), 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-03 00:05:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2021-05-03 00:05:09,812 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 118 [2021-05-03 00:05:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:09,812 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2021-05-03 00:05:09,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 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-03 00:05:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2021-05-03 00:05:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-03 00:05:09,813 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:09,813 INFO L523 BasicCegarLoop]: trace histogram [45, 31, 21, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:09,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:05:09,813 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1989071241, now seen corresponding path program 37 times [2021-05-03 00:05:09,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:09,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157106392] [2021-05-03 00:05:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:09,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1028 999999) (<= 50000 v_main_~x~0_1028)) InVars {main_~x~0=v_main_~x~0_1028} OutVars{main_~x~0=v_main_~x~0_1028} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,822 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:09,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:09,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:09,865 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:09,884 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1030 50000) (< v_main_~x~0_1030 999999)) InVars {main_~x~0=v_main_~x~0_1030} OutVars{main_~x~0=v_main_~x~0_1030} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,892 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:09,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:09,909 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:09,919 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:09,920 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1032 50000) InVars {main_~x~0=v_main_~x~0_1032} OutVars{main_~x~0=v_main_~x~0_1032} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,922 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:09,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:09,939 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:09,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1034 1000000) (<= 50000 v_main_~x~0_1034)) InVars {main_~x~0=v_main_~x~0_1034} OutVars{main_~x~0=v_main_~x~0_1034} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,952 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:09,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,969 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:09,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:09,992 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:10,010 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:10,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:10,524 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-03 00:05:10,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:11,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:11,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157106392] [2021-05-03 00:05:11,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [157106392] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:11,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:11,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:05:11,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832359592] [2021-05-03 00:05:11,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:05:11,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:05:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1107, Invalid=2315, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:05:11,478 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 56 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:14,896 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2021-05-03 00:05:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:05:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 56 states have internal predecessors, (95), 2 states have call successors, (3), 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 123 [2021-05-03 00:05:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:14,897 INFO L225 Difference]: With dead ends: 183 [2021-05-03 00:05:14,897 INFO L226 Difference]: Without dead ends: 127 [2021-05-03 00:05:14,898 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3680 ImplicationChecksByTransitivity, 3681.6ms TimeCoverageRelationStatistics Valid=3226, Invalid=9430, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:05:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-03 00:05:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-03 00:05:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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-03 00:05:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2021-05-03 00:05:14,909 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 123 [2021-05-03 00:05:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:14,910 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2021-05-03 00:05:14,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 56 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2021-05-03 00:05:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-05-03 00:05:14,911 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:14,911 INFO L523 BasicCegarLoop]: trace histogram [46, 32, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:14,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-03 00:05:14,911 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash -733725699, now seen corresponding path program 38 times [2021-05-03 00:05:14,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:14,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280186590] [2021-05-03 00:05:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:14,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1070 999999) (<= 50000 v_main_~x~0_1070)) InVars {main_~x~0=v_main_~x~0_1070} OutVars{main_~x~0=v_main_~x~0_1070} AuxVars[] AssignedVars[] [2021-05-03 00:05:14,920 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:14,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:14,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:14,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:14,936 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:14,968 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:14,994 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1072 50000) (< v_main_~x~0_1072 999999)) InVars {main_~x~0=v_main_~x~0_1072} OutVars{main_~x~0=v_main_~x~0_1072} AuxVars[] AssignedVars[] [2021-05-03 00:05:14,997 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:15,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:15,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:15,021 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:15,032 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:15,034 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1074 50000) InVars {main_~x~0=v_main_~x~0_1074} OutVars{main_~x~0=v_main_~x~0_1074} AuxVars[] AssignedVars[] [2021-05-03 00:05:15,035 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:15,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:15,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:15,058 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:15,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1076 1000000) (<= 50000 v_main_~x~0_1076)) InVars {main_~x~0=v_main_~x~0_1076} OutVars{main_~x~0=v_main_~x~0_1076} AuxVars[] AssignedVars[] [2021-05-03 00:05:15,073 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:15,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:15,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:15,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:15,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:15,123 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:15,148 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:15,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:15,703 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-03 00:05:15,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:16,959 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:16,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280186590] [2021-05-03 00:05:16,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1280186590] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:16,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:16,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:05:16,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930184307] [2021-05-03 00:05:16,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:05:16,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:05:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3369, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:05:16,961 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 59 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 58 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:20,219 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2021-05-03 00:05:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:05:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 58 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2021-05-03 00:05:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:20,220 INFO L225 Difference]: With dead ends: 186 [2021-05-03 00:05:20,220 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:05:20,221 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 3293.3ms TimeCoverageRelationStatistics Valid=579, Invalid=8351, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:05:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:05:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-03 00:05:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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-03 00:05:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2021-05-03 00:05:20,228 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 126 [2021-05-03 00:05:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:20,228 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2021-05-03 00:05:20,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 58 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2021-05-03 00:05:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-03 00:05:20,229 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:20,229 INFO L523 BasicCegarLoop]: trace histogram [47, 33, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:20,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:05:20,229 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash -19095488, now seen corresponding path program 39 times [2021-05-03 00:05:20,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:20,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415121931] [2021-05-03 00:05:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:20,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1113) (< v_main_~x~0_1113 999999)) InVars {main_~x~0=v_main_~x~0_1113} OutVars{main_~x~0=v_main_~x~0_1113} AuxVars[] AssignedVars[] [2021-05-03 00:05:20,243 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:20,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:20,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:20,284 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:20,303 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1115 50000) (< v_main_~x~0_1115 999999)) InVars {main_~x~0=v_main_~x~0_1115} OutVars{main_~x~0=v_main_~x~0_1115} AuxVars[] AssignedVars[] [2021-05-03 00:05:20,304 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:20,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:20,321 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:20,330 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:20,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1117 50000) InVars {main_~x~0=v_main_~x~0_1117} OutVars{main_~x~0=v_main_~x~0_1117} AuxVars[] AssignedVars[] [2021-05-03 00:05:20,333 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:20,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:20,350 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:20,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1119 1000000) (<= 50000 v_main_~x~0_1119)) InVars {main_~x~0=v_main_~x~0_1119} OutVars{main_~x~0=v_main_~x~0_1119} AuxVars[] AssignedVars[] [2021-05-03 00:05:20,363 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:20,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:20,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:20,418 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:20,437 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:20,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:20,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-03 00:05:20,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:21,992 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:21,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415121931] [2021-05-03 00:05:21,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1415121931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:21,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:21,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:05:21,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740812050] [2021-05-03 00:05:21,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:05:21,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:05:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=3490, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:05:21,993 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 60 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 59 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-03 00:05:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:25,355 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2021-05-03 00:05:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:05:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 59 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 128 [2021-05-03 00:05:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:25,357 INFO L225 Difference]: With dead ends: 188 [2021-05-03 00:05:25,357 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:05:25,358 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 3101.6ms TimeCoverageRelationStatistics Valid=587, Invalid=8725, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:05:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:05:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:05:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 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-03 00:05:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2021-05-03 00:05:25,369 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 128 [2021-05-03 00:05:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:25,369 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2021-05-03 00:05:25,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 59 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-03 00:05:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2021-05-03 00:05:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-05-03 00:05:25,370 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:25,370 INFO L523 BasicCegarLoop]: trace histogram [48, 34, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:25,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-05-03 00:05:25,370 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash -454230077, now seen corresponding path program 40 times [2021-05-03 00:05:25,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:25,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064769729] [2021-05-03 00:05:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:25,394 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1157 999999) (<= 50000 v_main_~x~0_1157)) InVars {main_~x~0=v_main_~x~0_1157} OutVars{main_~x~0=v_main_~x~0_1157} AuxVars[] AssignedVars[] [2021-05-03 00:05:25,396 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:25,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:25,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:25,449 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:25,468 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1159 999999) (< v_main_~x~0_1159 50000)) InVars {main_~x~0=v_main_~x~0_1159} OutVars{main_~x~0=v_main_~x~0_1159} AuxVars[] AssignedVars[] [2021-05-03 00:05:25,470 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:25,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:25,487 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:25,497 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:25,499 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1161 50000) InVars {main_~x~0=v_main_~x~0_1161} OutVars{main_~x~0=v_main_~x~0_1161} AuxVars[] AssignedVars[] [2021-05-03 00:05:25,500 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:25,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:25,517 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:25,528 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1163 1000000) (<= 50000 v_main_~x~0_1163)) InVars {main_~x~0=v_main_~x~0_1163} OutVars{main_~x~0=v_main_~x~0_1163} AuxVars[] AssignedVars[] [2021-05-03 00:05:25,530 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:25,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,541 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:25,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:25,569 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:25,588 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:25,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:25,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:25,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:26,289 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:26,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064769729] [2021-05-03 00:05:26,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064769729] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:26,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:26,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:05:26,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639722414] [2021-05-03 00:05:26,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:05:26,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:05:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=1048, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:05:26,291 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 43 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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-03 00:05:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:28,327 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2021-05-03 00:05:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:05:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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 130 [2021-05-03 00:05:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:28,329 INFO L225 Difference]: With dead ends: 194 [2021-05-03 00:05:28,329 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:05:28,329 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1922 ImplicationChecksByTransitivity, 2162.1ms TimeCoverageRelationStatistics Valid=2268, Invalid=4538, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:05:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:05:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-03 00:05:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 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-03 00:05:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2021-05-03 00:05:28,341 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 130 [2021-05-03 00:05:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:28,341 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2021-05-03 00:05:28,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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-03 00:05:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2021-05-03 00:05:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-05-03 00:05:28,342 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:28,342 INFO L523 BasicCegarLoop]: trace histogram [50, 34, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:28,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-03 00:05:28,342 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1940371757, now seen corresponding path program 41 times [2021-05-03 00:05:28,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:28,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434825624] [2021-05-03 00:05:28,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:28,349 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1215) (< v_main_~x~0_1215 999999)) InVars {main_~x~0=v_main_~x~0_1215} OutVars{main_~x~0=v_main_~x~0_1215} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,352 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:28,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:28,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:28,396 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:28,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1217 50000) (< v_main_~x~0_1217 999999)) InVars {main_~x~0=v_main_~x~0_1217} OutVars{main_~x~0=v_main_~x~0_1217} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,417 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:28,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:28,434 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:28,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:28,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1219 50000) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,448 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:28,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:28,483 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:28,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1221 1000000) (<= 50000 v_main_~x~0_1221)) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,501 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:28,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:28,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:28,547 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:28,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,059 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-03 00:05:29,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:29,959 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:29,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434825624] [2021-05-03 00:05:29,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1434825624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:29,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:29,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:05:29,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925273288] [2021-05-03 00:05:29,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:05:29,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:05:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1429, Invalid=2861, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:05:29,961 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 63 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 62 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:33,822 INFO L93 Difference]: Finished difference Result 203 states and 211 transitions. [2021-05-03 00:05:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:05:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 62 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2021-05-03 00:05:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:33,824 INFO L225 Difference]: With dead ends: 203 [2021-05-03 00:05:33,824 INFO L226 Difference]: Without dead ends: 140 [2021-05-03 00:05:33,824 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4877 ImplicationChecksByTransitivity, 3909.5ms TimeCoverageRelationStatistics Valid=4090, Invalid=11660, Unknown=0, NotChecked=0, Total=15750 [2021-05-03 00:05:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-05-03 00:05:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-05-03 00:05:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.0296296296296297) internal successors, (139), 135 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-03 00:05:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2021-05-03 00:05:33,836 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 136 [2021-05-03 00:05:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:33,836 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2021-05-03 00:05:33,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 62 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2021-05-03 00:05:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-03 00:05:33,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:33,837 INFO L523 BasicCegarLoop]: trace histogram [51, 35, 25, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:33,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-05-03 00:05:33,838 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash 837620659, now seen corresponding path program 42 times [2021-05-03 00:05:33,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:33,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108120522] [2021-05-03 00:05:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:33,845 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1260 999999) (<= 50000 v_main_~x~0_1260)) InVars {main_~x~0=v_main_~x~0_1260} OutVars{main_~x~0=v_main_~x~0_1260} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,847 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:33,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:33,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:33,889 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:33,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1262 999999) (< v_main_~x~0_1262 50000)) InVars {main_~x~0=v_main_~x~0_1262} OutVars{main_~x~0=v_main_~x~0_1262} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,911 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:33,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,922 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:33,928 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:33,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:33,940 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1264 50000) InVars {main_~x~0=v_main_~x~0_1264} OutVars{main_~x~0=v_main_~x~0_1264} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,941 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:33,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,946 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:33,958 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:33,984 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1266) (< v_main_~x~0_1266 1000000)) InVars {main_~x~0=v_main_~x~0_1266} OutVars{main_~x~0=v_main_~x~0_1266} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,985 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:34,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:34,003 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:34,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:34,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:34,028 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:34,046 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:34,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:34,604 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-03 00:05:34,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:35,999 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:35,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108120522] [2021-05-03 00:05:35,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2108120522] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:35,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:35,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:05:35,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243683062] [2021-05-03 00:05:35,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:05:35,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:36,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:05:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=4057, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:05:36,000 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand has 65 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:39,878 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2021-05-03 00:05:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:05:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 2 states have call successors, (3), 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 139 [2021-05-03 00:05:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:39,880 INFO L225 Difference]: With dead ends: 206 [2021-05-03 00:05:39,880 INFO L226 Difference]: Without dead ends: 142 [2021-05-03 00:05:39,880 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 3750.0ms TimeCoverageRelationStatistics Valid=680, Invalid=10032, Unknown=0, NotChecked=0, Total=10712 [2021-05-03 00:05:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-05-03 00:05:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-05-03 00:05:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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-03 00:05:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2021-05-03 00:05:39,889 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 139 [2021-05-03 00:05:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:39,889 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2021-05-03 00:05:39,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2021-05-03 00:05:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-03 00:05:39,890 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:39,890 INFO L523 BasicCegarLoop]: trace histogram [52, 36, 25, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:39,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-03 00:05:39,890 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1105005488, now seen corresponding path program 43 times [2021-05-03 00:05:39,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:39,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775052989] [2021-05-03 00:05:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:39,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1306) (< v_main_~x~0_1306 999999)) InVars {main_~x~0=v_main_~x~0_1306} OutVars{main_~x~0=v_main_~x~0_1306} AuxVars[] AssignedVars[] [2021-05-03 00:05:39,900 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:39,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:39,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:39,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:39,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:39,941 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:39,967 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1308 50000) (< v_main_~x~0_1308 999999)) InVars {main_~x~0=v_main_~x~0_1308} OutVars{main_~x~0=v_main_~x~0_1308} AuxVars[] AssignedVars[] [2021-05-03 00:05:39,968 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:39,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:39,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:40,002 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:40,013 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:40,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1310 50000) InVars {main_~x~0=v_main_~x~0_1310} OutVars{main_~x~0=v_main_~x~0_1310} AuxVars[] AssignedVars[] [2021-05-03 00:05:40,015 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:40,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:40,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:40,032 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:40,054 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1312) (< v_main_~x~0_1312 1000000)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1312} AuxVars[] AssignedVars[] [2021-05-03 00:05:40,055 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:40,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:40,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:40,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:40,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:40,103 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:40,121 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:40,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:40,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:40,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:41,079 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:41,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775052989] [2021-05-03 00:05:41,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [775052989] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:41,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:41,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:05:41,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778828670] [2021-05-03 00:05:41,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:05:41,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:05:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=1334, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:05:41,080 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 47 states, 47 states have (on average 1.446808510638298) internal successors, (68), 46 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:43,195 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2021-05-03 00:05:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:05:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.446808510638298) internal successors, (68), 46 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-03 00:05:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:43,197 INFO L225 Difference]: With dead ends: 211 [2021-05-03 00:05:43,197 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:05:43,198 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 2487.3ms TimeCoverageRelationStatistics Valid=2737, Invalid=5635, Unknown=0, NotChecked=0, Total=8372 [2021-05-03 00:05:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:05:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-03 00:05:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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-03 00:05:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2021-05-03 00:05:43,210 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 141 [2021-05-03 00:05:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:43,210 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2021-05-03 00:05:43,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.446808510638298) internal successors, (68), 46 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2021-05-03 00:05:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-05-03 00:05:43,211 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:43,211 INFO L523 BasicCegarLoop]: trace histogram [54, 36, 26, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:43,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-03 00:05:43,211 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash -478136227, now seen corresponding path program 44 times [2021-05-03 00:05:43,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:43,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1899884107] [2021-05-03 00:05:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:43,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1368) (< v_main_~x~0_1368 999999)) InVars {main_~x~0=v_main_~x~0_1368} OutVars{main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[] [2021-05-03 00:05:43,220 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:43,221 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:43,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:43,271 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:43,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1370 50000) (< v_main_~x~0_1370 999999)) InVars {main_~x~0=v_main_~x~0_1370} OutVars{main_~x~0=v_main_~x~0_1370} AuxVars[] AssignedVars[] [2021-05-03 00:05:43,295 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:43,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:43,314 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:43,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:43,328 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1372 50000) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-03 00:05:43,329 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:43,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:43,347 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:43,359 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1374 1000000) (<= 50000 v_main_~x~0_1374)) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-03 00:05:43,360 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:43,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:43,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:43,423 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:43,442 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:44,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:44,004 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-03 00:05:44,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:44,974 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:44,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1899884107] [2021-05-03 00:05:44,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1899884107] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:44,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:44,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:05:44,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507731909] [2021-05-03 00:05:44,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:05:44,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:05:44,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:05:44,976 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:49,218 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2021-05-03 00:05:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:05:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2021-05-03 00:05:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:49,219 INFO L225 Difference]: With dead ends: 219 [2021-05-03 00:05:49,219 INFO L226 Difference]: Without dead ends: 150 [2021-05-03 00:05:49,220 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5529 ImplicationChecksByTransitivity, 4359.7ms TimeCoverageRelationStatistics Valid=4651, Invalid=13171, Unknown=0, NotChecked=0, Total=17822 [2021-05-03 00:05:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-05-03 00:05:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-05-03 00:05:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.0275862068965518) internal successors, (149), 145 states have internal predecessors, (149), 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-03 00:05:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2021-05-03 00:05:49,228 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 146 [2021-05-03 00:05:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:49,228 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2021-05-03 00:05:49,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2021-05-03 00:05:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:05:49,229 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:49,229 INFO L523 BasicCegarLoop]: trace histogram [55, 37, 27, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:49,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-05-03 00:05:49,229 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash -453834173, now seen corresponding path program 45 times [2021-05-03 00:05:49,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:49,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165092684] [2021-05-03 00:05:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:49,235 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1415 999999) (<= 50000 v_main_~x~0_1415)) InVars {main_~x~0=v_main_~x~0_1415} OutVars{main_~x~0=v_main_~x~0_1415} AuxVars[] AssignedVars[] [2021-05-03 00:05:49,236 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:49,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:49,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:49,276 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:49,296 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1417 50000) (< v_main_~x~0_1417 999999)) InVars {main_~x~0=v_main_~x~0_1417} OutVars{main_~x~0=v_main_~x~0_1417} AuxVars[] AssignedVars[] [2021-05-03 00:05:49,297 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:49,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:49,314 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:49,324 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:49,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1419 50000) InVars {main_~x~0=v_main_~x~0_1419} OutVars{main_~x~0=v_main_~x~0_1419} AuxVars[] AssignedVars[] [2021-05-03 00:05:49,339 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:49,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:49,356 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:49,368 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1421) (< v_main_~x~0_1421 1000000)) InVars {main_~x~0=v_main_~x~0_1421} OutVars{main_~x~0=v_main_~x~0_1421} AuxVars[] AssignedVars[] [2021-05-03 00:05:49,369 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:49,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,395 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:49,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:49,412 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:49,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:50,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:50,129 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-03 00:05:50,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:51,303 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:51,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165092684] [2021-05-03 00:05:51,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [165092684] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:51,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:51,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:05:51,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412985976] [2021-05-03 00:05:51,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:05:51,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:05:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1720, Invalid=3392, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:05:51,304 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:55,789 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2021-05-03 00:05:55,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:05:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 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-03 00:05:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:55,790 INFO L225 Difference]: With dead ends: 223 [2021-05-03 00:05:55,790 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:05:55,792 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5990 ImplicationChecksByTransitivity, 4767.9ms TimeCoverageRelationStatistics Valid=4945, Invalid=13961, Unknown=0, NotChecked=0, Total=18906 [2021-05-03 00:05:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:05:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-03 00:05:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 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-03 00:05:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2021-05-03 00:05:55,802 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 149 [2021-05-03 00:05:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2021-05-03 00:05:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2021-05-03 00:05:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-05-03 00:05:55,803 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:55,803 INFO L523 BasicCegarLoop]: trace histogram [56, 38, 28, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:55,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-05-03 00:05:55,804 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 350031043, now seen corresponding path program 46 times [2021-05-03 00:05:55,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:55,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778921220] [2021-05-03 00:05:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:55,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1463) (< v_main_~x~0_1463 999999)) InVars {main_~x~0=v_main_~x~0_1463} OutVars{main_~x~0=v_main_~x~0_1463} AuxVars[] AssignedVars[] [2021-05-03 00:05:55,811 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:55,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:55,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:55,852 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:55,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1465 999999) (< v_main_~x~0_1465 50000)) InVars {main_~x~0=v_main_~x~0_1465} OutVars{main_~x~0=v_main_~x~0_1465} AuxVars[] AssignedVars[] [2021-05-03 00:05:55,873 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:05:55,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:55,890 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:05:55,901 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:55,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1467 50000) InVars {main_~x~0=v_main_~x~0_1467} OutVars{main_~x~0=v_main_~x~0_1467} AuxVars[] AssignedVars[] [2021-05-03 00:05:55,903 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:05:55,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:55,921 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:05:55,933 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1469 1000000) (<= 50000 v_main_~x~0_1469)) InVars {main_~x~0=v_main_~x~0_1469} OutVars{main_~x~0=v_main_~x~0_1469} AuxVars[] AssignedVars[] [2021-05-03 00:05:55,946 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:05:55,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:05:55,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:05:55,997 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:05:56,019 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:05:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:56,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:56,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:05:57,788 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:57,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778921220] [2021-05-03 00:05:57,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1778921220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:57,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:57,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:05:57,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827367041] [2021-05-03 00:05:57,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:05:57,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:05:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1823, Invalid=3579, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:05:57,790 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand has 71 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 70 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:02,444 INFO L93 Difference]: Finished difference Result 227 states and 235 transitions. [2021-05-03 00:06:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:06:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 70 states have internal predecessors, (116), 2 states have call successors, (3), 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-03 00:06:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:02,446 INFO L225 Difference]: With dead ends: 227 [2021-05-03 00:06:02,446 INFO L226 Difference]: Without dead ends: 156 [2021-05-03 00:06:02,447 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6283 ImplicationChecksByTransitivity, 4853.9ms TimeCoverageRelationStatistics Valid=5248, Invalid=14774, Unknown=0, NotChecked=0, Total=20022 [2021-05-03 00:06:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-05-03 00:06:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-05-03 00:06:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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-03 00:06:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2021-05-03 00:06:02,461 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 152 [2021-05-03 00:06:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:02,461 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2021-05-03 00:06:02,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 70 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2021-05-03 00:06:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:06:02,462 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:02,462 INFO L523 BasicCegarLoop]: trace histogram [57, 39, 29, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:02,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-03 00:06:02,462 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 752933085, now seen corresponding path program 47 times [2021-05-03 00:06:02,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:02,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594494297] [2021-05-03 00:06:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:02,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1512) (< v_main_~x~0_1512 999999)) InVars {main_~x~0=v_main_~x~0_1512} OutVars{main_~x~0=v_main_~x~0_1512} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,480 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:02,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:02,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:02,529 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:02,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1514 50000) (< v_main_~x~0_1514 999999)) InVars {main_~x~0=v_main_~x~0_1514} OutVars{main_~x~0=v_main_~x~0_1514} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,553 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:02,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:02,572 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:02,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:02,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1516 50000) InVars {main_~x~0=v_main_~x~0_1516} OutVars{main_~x~0=v_main_~x~0_1516} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,586 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:02,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:02,606 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:02,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1518 1000000) (<= 50000 v_main_~x~0_1518)) InVars {main_~x~0=v_main_~x~0_1518} OutVars{main_~x~0=v_main_~x~0_1518} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,621 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:02,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:02,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:02,669 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:02,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:03,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:03,368 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-03 00:06:03,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:04,504 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:04,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594494297] [2021-05-03 00:06:04,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594494297] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:04,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:04,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:06:04,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723403041] [2021-05-03 00:06:04,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:06:04,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:06:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1929, Invalid=3771, Unknown=0, NotChecked=0, Total=5700 [2021-05-03 00:06:04,506 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand has 73 states, 73 states have (on average 1.63013698630137) internal successors, (119), 72 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:09,440 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2021-05-03 00:06:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:06:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.63013698630137) internal successors, (119), 72 states have internal predecessors, (119), 2 states have call successors, (3), 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-03 00:06:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:09,442 INFO L225 Difference]: With dead ends: 231 [2021-05-03 00:06:09,442 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:06:09,443 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6646 ImplicationChecksByTransitivity, 5101.1ms TimeCoverageRelationStatistics Valid=5560, Invalid=15610, Unknown=0, NotChecked=0, Total=21170 [2021-05-03 00:06:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:06:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-03 00:06:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 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-03 00:06:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2021-05-03 00:06:09,456 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 155 [2021-05-03 00:06:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:09,456 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2021-05-03 00:06:09,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.63013698630137) internal successors, (119), 72 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2021-05-03 00:06:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-03 00:06:09,457 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:09,457 INFO L523 BasicCegarLoop]: trace histogram [58, 40, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:09,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-05-03 00:06:09,457 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1763070761, now seen corresponding path program 48 times [2021-05-03 00:06:09,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:09,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87057867] [2021-05-03 00:06:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:09,464 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1562 999999) (<= 50000 v_main_~x~0_1562)) InVars {main_~x~0=v_main_~x~0_1562} OutVars{main_~x~0=v_main_~x~0_1562} AuxVars[] AssignedVars[] [2021-05-03 00:06:09,466 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:09,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:09,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:09,516 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:09,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1564 50000) (< v_main_~x~0_1564 999999)) InVars {main_~x~0=v_main_~x~0_1564} OutVars{main_~x~0=v_main_~x~0_1564} AuxVars[] AssignedVars[] [2021-05-03 00:06:09,540 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:09,541 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:09,561 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:09,573 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:09,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1566 50000) InVars {main_~x~0=v_main_~x~0_1566} OutVars{main_~x~0=v_main_~x~0_1566} AuxVars[] AssignedVars[] [2021-05-03 00:06:09,581 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:09,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:09,601 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:09,615 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1568 1000000) (<= 50000 v_main_~x~0_1568)) InVars {main_~x~0=v_main_~x~0_1568} OutVars{main_~x~0=v_main_~x~0_1568} AuxVars[] AssignedVars[] [2021-05-03 00:06:09,617 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:09,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:09,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:09,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:09,670 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:09,692 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:10,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:10,449 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-03 00:06:10,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:12,247 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:12,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87057867] [2021-05-03 00:06:12,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [87057867] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:12,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:12,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-03 00:06:12,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370651086] [2021-05-03 00:06:12,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-03 00:06:12,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-03 00:06:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=5342, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:06:12,249 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand has 75 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 74 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:17,199 INFO L93 Difference]: Finished difference Result 234 states and 241 transitions. [2021-05-03 00:06:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:06:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 74 states have internal predecessors, (122), 2 states have call successors, (3), 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-03 00:06:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:17,201 INFO L225 Difference]: With dead ends: 234 [2021-05-03 00:06:17,201 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:06:17,202 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2514 ImplicationChecksByTransitivity, 4809.2ms TimeCoverageRelationStatistics Valid=870, Invalid=13172, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:06:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:06:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-03 00:06:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 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-03 00:06:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 164 transitions. [2021-05-03 00:06:17,211 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 164 transitions. Word has length 158 [2021-05-03 00:06:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:17,211 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 164 transitions. [2021-05-03 00:06:17,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 74 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2021-05-03 00:06:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-05-03 00:06:17,212 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:17,212 INFO L523 BasicCegarLoop]: trace histogram [59, 41, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:17,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-05-03 00:06:17,212 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1754590060, now seen corresponding path program 49 times [2021-05-03 00:06:17,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:17,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498642876] [2021-05-03 00:06:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:17,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1613) (< v_main_~x~0_1613 999999)) InVars {main_~x~0=v_main_~x~0_1613} OutVars{main_~x~0=v_main_~x~0_1613} AuxVars[] AssignedVars[] [2021-05-03 00:06:17,222 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:17,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:17,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:17,268 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:17,288 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1615 999999) (< v_main_~x~0_1615 50000)) InVars {main_~x~0=v_main_~x~0_1615} OutVars{main_~x~0=v_main_~x~0_1615} AuxVars[] AssignedVars[] [2021-05-03 00:06:17,289 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:17,296 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:17,307 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:17,318 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:17,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1617 50000) InVars {main_~x~0=v_main_~x~0_1617} OutVars{main_~x~0=v_main_~x~0_1617} AuxVars[] AssignedVars[] [2021-05-03 00:06:17,321 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:17,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:17,350 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:17,367 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1619) (< v_main_~x~0_1619 1000000)) InVars {main_~x~0=v_main_~x~0_1619} OutVars{main_~x~0=v_main_~x~0_1619} AuxVars[] AssignedVars[] [2021-05-03 00:06:17,369 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:17,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:17,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:17,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:17,425 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:17,456 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:18,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:18,152 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-03 00:06:18,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:20,105 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:20,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498642876] [2021-05-03 00:06:20,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [498642876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:20,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:20,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-03 00:06:20,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386979899] [2021-05-03 00:06:20,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-03 00:06:20,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:20,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-03 00:06:20,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=5495, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:06:20,107 INFO L87 Difference]: Start difference. First operand 161 states and 164 transitions. Second operand has 76 states, 76 states have (on average 1.631578947368421) internal successors, (124), 75 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-03 00:06:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:25,270 INFO L93 Difference]: Finished difference Result 236 states and 243 transitions. [2021-05-03 00:06:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:06:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.631578947368421) internal successors, (124), 75 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 160 [2021-05-03 00:06:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:25,272 INFO L225 Difference]: With dead ends: 236 [2021-05-03 00:06:25,272 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:06:25,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 4991.7ms TimeCoverageRelationStatistics Valid=878, Invalid=13642, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:06:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:06:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-03 00:06:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0253164556962024) internal successors, (162), 158 states have internal predecessors, (162), 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-03 00:06:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 166 transitions. [2021-05-03 00:06:25,285 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 166 transitions. Word has length 160 [2021-05-03 00:06:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:25,286 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 166 transitions. [2021-05-03 00:06:25,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.631578947368421) internal successors, (124), 75 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-03 00:06:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 166 transitions. [2021-05-03 00:06:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-05-03 00:06:25,287 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:25,287 INFO L523 BasicCegarLoop]: trace histogram [60, 42, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:25,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-05-03 00:06:25,287 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2100396305, now seen corresponding path program 50 times [2021-05-03 00:06:25,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:25,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896209773] [2021-05-03 00:06:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:25,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1665 999999) (<= 50000 v_main_~x~0_1665)) InVars {main_~x~0=v_main_~x~0_1665} OutVars{main_~x~0=v_main_~x~0_1665} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,294 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:25,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:25,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:25,337 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:25,357 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1667 999999) (< v_main_~x~0_1667 50000)) InVars {main_~x~0=v_main_~x~0_1667} OutVars{main_~x~0=v_main_~x~0_1667} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,358 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:25,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:25,374 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:25,385 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:25,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1669 50000) InVars {main_~x~0=v_main_~x~0_1669} OutVars{main_~x~0=v_main_~x~0_1669} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,388 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:25,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:25,404 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:25,415 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1671 1000000) (<= 50000 v_main_~x~0_1671)) InVars {main_~x~0=v_main_~x~0_1671} OutVars{main_~x~0=v_main_~x~0_1671} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,417 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:25,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:25,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:25,459 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:25,478 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:26,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:26,141 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-03 00:06:26,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:28,177 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:28,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896209773] [2021-05-03 00:06:28,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [896209773] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:28,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:28,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:06:28,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296298345] [2021-05-03 00:06:28,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:06:28,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:06:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=5649, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:06:28,179 INFO L87 Difference]: Start difference. First operand 163 states and 166 transitions. Second operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:33,494 INFO L93 Difference]: Finished difference Result 238 states and 245 transitions. [2021-05-03 00:06:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:06:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 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 162 [2021-05-03 00:06:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:33,495 INFO L225 Difference]: With dead ends: 238 [2021-05-03 00:06:33,495 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:06:33,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 5099.8ms TimeCoverageRelationStatistics Valid=887, Invalid=14119, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:06:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:06:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:06:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.025) internal successors, (164), 160 states have internal predecessors, (164), 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-03 00:06:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2021-05-03 00:06:33,508 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 162 [2021-05-03 00:06:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:33,508 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2021-05-03 00:06:33,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2021-05-03 00:06:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-05-03 00:06:33,509 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:33,509 INFO L523 BasicCegarLoop]: trace histogram [61, 43, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:33,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-05-03 00:06:33,509 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash -185516622, now seen corresponding path program 51 times [2021-05-03 00:06:33,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:33,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004379673] [2021-05-03 00:06:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:33,515 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1718 999999) (<= 50000 v_main_~x~0_1718)) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1718} AuxVars[] AssignedVars[] [2021-05-03 00:06:33,517 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:33,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,527 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:33,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:33,560 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:33,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1720 50000) (< v_main_~x~0_1720 999999)) InVars {main_~x~0=v_main_~x~0_1720} OutVars{main_~x~0=v_main_~x~0_1720} AuxVars[] AssignedVars[] [2021-05-03 00:06:33,586 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:33,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:33,604 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:33,615 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:33,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1722 50000) InVars {main_~x~0=v_main_~x~0_1722} OutVars{main_~x~0=v_main_~x~0_1722} AuxVars[] AssignedVars[] [2021-05-03 00:06:33,617 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:33,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:33,635 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:33,647 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1724) (< v_main_~x~0_1724 1000000)) InVars {main_~x~0=v_main_~x~0_1724} OutVars{main_~x~0=v_main_~x~0_1724} AuxVars[] AssignedVars[] [2021-05-03 00:06:33,648 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:33,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:33,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:33,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:33,688 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:33,706 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:34,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:34,414 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-03 00:06:34,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:34,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:34,861 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:34,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004379673] [2021-05-03 00:06:34,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2004379673] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:34,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:34,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:06:34,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188111836] [2021-05-03 00:06:34,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:06:34,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:06:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=1653, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:06:34,862 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand has 54 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 53 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:37,487 INFO L93 Difference]: Finished difference Result 243 states and 254 transitions. [2021-05-03 00:06:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:06:37,488 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 53 states have internal predecessors, (77), 2 states have call successors, (3), 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-03 00:06:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:37,489 INFO L225 Difference]: With dead ends: 243 [2021-05-03 00:06:37,489 INFO L226 Difference]: Without dead ends: 170 [2021-05-03 00:06:37,489 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3124 ImplicationChecksByTransitivity, 3097.5ms TimeCoverageRelationStatistics Valid=3621, Invalid=7299, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:06:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-05-03 00:06:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-05-03 00:06:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.0242424242424242) internal successors, (169), 165 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-03 00:06:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2021-05-03 00:06:37,498 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 164 [2021-05-03 00:06:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:37,498 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2021-05-03 00:06:37,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 53 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2021-05-03 00:06:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:06:37,499 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:37,499 INFO L523 BasicCegarLoop]: trace histogram [63, 43, 31, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:37,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-05-03 00:06:37,499 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1772146073, now seen corresponding path program 52 times [2021-05-03 00:06:37,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:37,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094971154] [2021-05-03 00:06:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:37,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1789 999999) (<= 50000 v_main_~x~0_1789)) InVars {main_~x~0=v_main_~x~0_1789} OutVars{main_~x~0=v_main_~x~0_1789} AuxVars[] AssignedVars[] [2021-05-03 00:06:37,508 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:37,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:37,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:37,558 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:37,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1791 999999) (< v_main_~x~0_1791 50000)) InVars {main_~x~0=v_main_~x~0_1791} OutVars{main_~x~0=v_main_~x~0_1791} AuxVars[] AssignedVars[] [2021-05-03 00:06:37,579 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:37,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:37,596 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:37,611 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:37,612 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1793 50000) InVars {main_~x~0=v_main_~x~0_1793} OutVars{main_~x~0=v_main_~x~0_1793} AuxVars[] AssignedVars[] [2021-05-03 00:06:37,613 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:37,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:37,629 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:37,641 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1795) (< v_main_~x~0_1795 1000000)) InVars {main_~x~0=v_main_~x~0_1795} OutVars{main_~x~0=v_main_~x~0_1795} AuxVars[] AssignedVars[] [2021-05-03 00:06:37,643 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:37,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:37,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:37,682 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:37,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,551 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-03 00:06:38,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:39,913 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:39,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094971154] [2021-05-03 00:06:39,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2094971154] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:39,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:39,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:06:39,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613484034] [2021-05-03 00:06:39,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:06:39,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:06:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=4420, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:06:39,915 INFO L87 Difference]: Start difference. First operand 170 states and 173 transitions. Second operand has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:45,588 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2021-05-03 00:06:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:06:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 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 169 [2021-05-03 00:06:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:45,590 INFO L225 Difference]: With dead ends: 251 [2021-05-03 00:06:45,590 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:06:45,591 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7683 ImplicationChecksByTransitivity, 5931.7ms TimeCoverageRelationStatistics Valid=6423, Invalid=18383, Unknown=0, NotChecked=0, Total=24806 [2021-05-03 00:06:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:06:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-03 00:06:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 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-03 00:06:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2021-05-03 00:06:45,601 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 169 [2021-05-03 00:06:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2021-05-03 00:06:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2021-05-03 00:06:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-05-03 00:06:45,602 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:45,602 INFO L523 BasicCegarLoop]: trace histogram [64, 44, 32, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:45,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-05-03 00:06:45,602 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 575318431, now seen corresponding path program 53 times [2021-05-03 00:06:45,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:45,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1737393975] [2021-05-03 00:06:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:45,607 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1843 999999) (<= 50000 v_main_~x~0_1843)) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1843} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,609 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:45,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:45,622 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:45,657 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:45,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1845 999999) (< v_main_~x~0_1845 50000)) InVars {main_~x~0=v_main_~x~0_1845} OutVars{main_~x~0=v_main_~x~0_1845} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,691 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:45,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:45,715 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:45,730 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:45,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1847 50000) InVars {main_~x~0=v_main_~x~0_1847} OutVars{main_~x~0=v_main_~x~0_1847} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,732 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:45,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:45,752 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:45,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1849) (< v_main_~x~0_1849 1000000)) InVars {main_~x~0=v_main_~x~0_1849} OutVars{main_~x~0=v_main_~x~0_1849} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,766 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:45,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,768 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:45,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:45,805 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:45,824 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:46,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:46,667 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-03 00:06:46,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:48,761 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:48,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1737393975] [2021-05-03 00:06:48,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1737393975] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:48,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:48,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:06:48,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987973943] [2021-05-03 00:06:48,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:06:48,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:06:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=6229, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:06:48,763 INFO L87 Difference]: Start difference. First operand 173 states and 176 transitions. Second operand has 81 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 80 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:54,626 INFO L93 Difference]: Finished difference Result 254 states and 261 transitions. [2021-05-03 00:06:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:06:54,626 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 80 states have internal predecessors, (132), 2 states have call successors, (3), 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 172 [2021-05-03 00:06:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:54,627 INFO L225 Difference]: With dead ends: 254 [2021-05-03 00:06:54,627 INFO L226 Difference]: Without dead ends: 175 [2021-05-03 00:06:54,628 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 5580.9ms TimeCoverageRelationStatistics Valid=969, Invalid=15543, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:06:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-05-03 00:06:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-05-03 00:06:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.0235294117647058) internal successors, (174), 170 states have internal predecessors, (174), 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-03 00:06:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 178 transitions. [2021-05-03 00:06:54,639 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 178 transitions. Word has length 172 [2021-05-03 00:06:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:54,639 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 178 transitions. [2021-05-03 00:06:54,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 80 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 178 transitions. [2021-05-03 00:06:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-05-03 00:06:54,640 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:54,640 INFO L523 BasicCegarLoop]: trace histogram [65, 45, 32, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:54,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-05-03 00:06:54,640 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -120844126, now seen corresponding path program 54 times [2021-05-03 00:06:54,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:54,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470723800] [2021-05-03 00:06:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:54,647 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1898 999999) (<= 50000 v_main_~x~0_1898)) InVars {main_~x~0=v_main_~x~0_1898} OutVars{main_~x~0=v_main_~x~0_1898} AuxVars[] AssignedVars[] [2021-05-03 00:06:54,649 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:54,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:54,662 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:54,688 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:54,708 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1900 999999) (< v_main_~x~0_1900 50000)) InVars {main_~x~0=v_main_~x~0_1900} OutVars{main_~x~0=v_main_~x~0_1900} AuxVars[] AssignedVars[] [2021-05-03 00:06:54,709 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:06:54,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:54,735 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:06:54,746 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:54,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1902 50000) InVars {main_~x~0=v_main_~x~0_1902} OutVars{main_~x~0=v_main_~x~0_1902} AuxVars[] AssignedVars[] [2021-05-03 00:06:54,748 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:06:54,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:54,765 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:06:54,778 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1904) (< v_main_~x~0_1904 1000000)) InVars {main_~x~0=v_main_~x~0_1904} OutVars{main_~x~0=v_main_~x~0_1904} AuxVars[] AssignedVars[] [2021-05-03 00:06:54,779 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:06:54,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:54,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:06:54,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:06:54,824 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:06:54,843 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:06:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:55,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:55,617 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-03 00:06:55,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:06:57,102 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:57,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470723800] [2021-05-03 00:06:57,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [470723800] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:57,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:57,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:06:57,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529449860] [2021-05-03 00:06:57,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:06:57,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:57,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:06:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2376, Invalid=4764, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:06:57,103 INFO L87 Difference]: Start difference. First operand 175 states and 178 transitions. Second operand has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:03,309 INFO L93 Difference]: Finished difference Result 257 states and 265 transitions. [2021-05-03 00:07:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:07:03,310 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 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 174 [2021-05-03 00:07:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:03,311 INFO L225 Difference]: With dead ends: 257 [2021-05-03 00:07:03,311 INFO L226 Difference]: Without dead ends: 178 [2021-05-03 00:07:03,312 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8405 ImplicationChecksByTransitivity, 6300.2ms TimeCoverageRelationStatistics Valid=6877, Invalid=19855, Unknown=0, NotChecked=0, Total=26732 [2021-05-03 00:07:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-05-03 00:07:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-05-03 00:07:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.023121387283237) internal successors, (177), 173 states have internal predecessors, (177), 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-03 00:07:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2021-05-03 00:07:03,327 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 174 [2021-05-03 00:07:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:03,327 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2021-05-03 00:07:03,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2021-05-03 00:07:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-05-03 00:07:03,328 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:03,328 INFO L523 BasicCegarLoop]: trace histogram [66, 46, 33, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:03,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-05-03 00:07:03,329 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1602673950, now seen corresponding path program 55 times [2021-05-03 00:07:03,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:03,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920950920] [2021-05-03 00:07:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:03,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1954 999999) (<= 50000 v_main_~x~0_1954)) InVars {main_~x~0=v_main_~x~0_1954} OutVars{main_~x~0=v_main_~x~0_1954} AuxVars[] AssignedVars[] [2021-05-03 00:07:03,337 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:03,338 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,340 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,351 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:03,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:03,386 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:03,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1956 999999) (< v_main_~x~0_1956 50000)) InVars {main_~x~0=v_main_~x~0_1956} OutVars{main_~x~0=v_main_~x~0_1956} AuxVars[] AssignedVars[] [2021-05-03 00:07:03,411 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:03,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:03,432 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:03,443 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:03,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1958 50000) InVars {main_~x~0=v_main_~x~0_1958} OutVars{main_~x~0=v_main_~x~0_1958} AuxVars[] AssignedVars[] [2021-05-03 00:07:03,445 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:03,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:03,467 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:03,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1960 1000000) (<= 50000 v_main_~x~0_1960)) InVars {main_~x~0=v_main_~x~0_1960} OutVars{main_~x~0=v_main_~x~0_1960} AuxVars[] AssignedVars[] [2021-05-03 00:07:03,484 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:03,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:03,509 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:03,512 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:03,526 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:03,546 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:04,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:04,346 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-03 00:07:04,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:06,779 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:06,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920950920] [2021-05-03 00:07:06,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1920950920] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:06,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:06,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:07:06,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479558542] [2021-05-03 00:07:06,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:07:06,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:07:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=6697, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:07:06,781 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:13,269 INFO L93 Difference]: Finished difference Result 260 states and 267 transitions. [2021-05-03 00:07:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:07:13,269 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 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 177 [2021-05-03 00:07:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:13,270 INFO L225 Difference]: With dead ends: 260 [2021-05-03 00:07:13,270 INFO L226 Difference]: Without dead ends: 180 [2021-05-03 00:07:13,271 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3258 ImplicationChecksByTransitivity, 6124.8ms TimeCoverageRelationStatistics Valid=1021, Invalid=16801, Unknown=0, NotChecked=0, Total=17822 [2021-05-03 00:07:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-05-03 00:07:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-05-03 00:07:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 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-03 00:07:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2021-05-03 00:07:13,286 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 177 [2021-05-03 00:07:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:13,286 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2021-05-03 00:07:13,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2021-05-03 00:07:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:07:13,287 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:13,287 INFO L523 BasicCegarLoop]: trace histogram [67, 47, 33, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:13,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-05-03 00:07:13,287 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 971792379, now seen corresponding path program 56 times [2021-05-03 00:07:13,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:13,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638831091] [2021-05-03 00:07:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:13,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2011 999999) (<= 50000 v_main_~x~0_2011)) InVars {main_~x~0=v_main_~x~0_2011} OutVars{main_~x~0=v_main_~x~0_2011} AuxVars[] AssignedVars[] [2021-05-03 00:07:13,296 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:13,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:13,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:13,341 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:13,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2013 50000) (< v_main_~x~0_2013 999999)) InVars {main_~x~0=v_main_~x~0_2013} OutVars{main_~x~0=v_main_~x~0_2013} AuxVars[] AssignedVars[] [2021-05-03 00:07:13,362 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:13,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:13,379 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:13,390 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:13,391 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2015 50000) InVars {main_~x~0=v_main_~x~0_2015} OutVars{main_~x~0=v_main_~x~0_2015} AuxVars[] AssignedVars[] [2021-05-03 00:07:13,392 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:13,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:13,410 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:13,422 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2017) (< v_main_~x~0_2017 1000000)) InVars {main_~x~0=v_main_~x~0_2017} OutVars{main_~x~0=v_main_~x~0_2017} AuxVars[] AssignedVars[] [2021-05-03 00:07:13,424 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:13,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:13,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:13,478 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:13,498 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:14,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:14,272 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-03 00:07:14,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:14,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:14,828 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:14,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638831091] [2021-05-03 00:07:14,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1638831091] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:14,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:14,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:07:14,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446952988] [2021-05-03 00:07:14,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:07:14,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:07:14,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=2070, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:07:14,829 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand has 59 states, 59 states have (on average 1.423728813559322) internal successors, (84), 58 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:17,981 INFO L93 Difference]: Finished difference Result 265 states and 276 transitions. [2021-05-03 00:07:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:07:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.423728813559322) internal successors, (84), 58 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2021-05-03 00:07:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:17,983 INFO L225 Difference]: With dead ends: 265 [2021-05-03 00:07:17,983 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:07:17,984 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3817 ImplicationChecksByTransitivity, 3670.6ms TimeCoverageRelationStatistics Valid=4377, Invalid=8963, Unknown=0, NotChecked=0, Total=13340 [2021-05-03 00:07:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:07:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-05-03 00:07:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.0222222222222221) internal successors, (184), 180 states have internal predecessors, (184), 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-03 00:07:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2021-05-03 00:07:17,999 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 179 [2021-05-03 00:07:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2021-05-03 00:07:18,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.423728813559322) internal successors, (84), 58 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2021-05-03 00:07:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-05-03 00:07:18,001 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:18,001 INFO L523 BasicCegarLoop]: trace histogram [69, 47, 34, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:18,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-05-03 00:07:18,001 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1283110290, now seen corresponding path program 57 times [2021-05-03 00:07:18,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:18,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270073517] [2021-05-03 00:07:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:18,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2088 999999) (<= 50000 v_main_~x~0_2088)) InVars {main_~x~0=v_main_~x~0_2088} OutVars{main_~x~0=v_main_~x~0_2088} AuxVars[] AssignedVars[] [2021-05-03 00:07:18,016 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:18,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:18,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:18,059 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:18,079 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2090 999999) (< v_main_~x~0_2090 50000)) InVars {main_~x~0=v_main_~x~0_2090} OutVars{main_~x~0=v_main_~x~0_2090} AuxVars[] AssignedVars[] [2021-05-03 00:07:18,080 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:18,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:18,101 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:18,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:18,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2092 50000) InVars {main_~x~0=v_main_~x~0_2092} OutVars{main_~x~0=v_main_~x~0_2092} AuxVars[] AssignedVars[] [2021-05-03 00:07:18,115 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:18,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:18,137 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:18,151 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2094) (< v_main_~x~0_2094 1000000)) InVars {main_~x~0=v_main_~x~0_2094} OutVars{main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[] [2021-05-03 00:07:18,152 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:18,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,169 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:18,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:18,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:18,194 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:18,213 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:19,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:19,245 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-03 00:07:19,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:20,864 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:20,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270073517] [2021-05-03 00:07:20,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1270073517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:20,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:20,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-03 00:07:20,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774469090] [2021-05-03 00:07:20,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-03 00:07:20,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-03 00:07:20,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2534, Invalid=5122, Unknown=0, NotChecked=0, Total=7656 [2021-05-03 00:07:20,866 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand has 86 states, 86 states have (on average 1.627906976744186) internal successors, (140), 85 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:27,688 INFO L93 Difference]: Finished difference Result 273 states and 281 transitions. [2021-05-03 00:07:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-03 00:07:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.627906976744186) internal successors, (140), 85 states have internal predecessors, (140), 2 states have call successors, (3), 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 184 [2021-05-03 00:07:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:27,689 INFO L225 Difference]: With dead ends: 273 [2021-05-03 00:07:27,689 INFO L226 Difference]: Without dead ends: 188 [2021-05-03 00:07:27,691 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8942 ImplicationChecksByTransitivity, 7088.1ms TimeCoverageRelationStatistics Valid=7465, Invalid=21605, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:07:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-05-03 00:07:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-05-03 00:07:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.0218579234972678) internal successors, (187), 183 states have internal predecessors, (187), 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-03 00:07:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2021-05-03 00:07:27,713 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 184 [2021-05-03 00:07:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:27,713 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 191 transitions. [2021-05-03 00:07:27,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 86 states have (on average 1.627906976744186) internal successors, (140), 85 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 191 transitions. [2021-05-03 00:07:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-05-03 00:07:27,714 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:27,714 INFO L523 BasicCegarLoop]: trace histogram [70, 48, 35, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:27,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-05-03 00:07:27,714 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1445882386, now seen corresponding path program 58 times [2021-05-03 00:07:27,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:27,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708085458] [2021-05-03 00:07:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:27,721 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2146) (< v_main_~x~0_2146 999999)) InVars {main_~x~0=v_main_~x~0_2146} OutVars{main_~x~0=v_main_~x~0_2146} AuxVars[] AssignedVars[] [2021-05-03 00:07:27,722 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:27,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:27,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:27,763 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:27,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2148 50000) (< v_main_~x~0_2148 999999)) InVars {main_~x~0=v_main_~x~0_2148} OutVars{main_~x~0=v_main_~x~0_2148} AuxVars[] AssignedVars[] [2021-05-03 00:07:27,785 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:27,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,790 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:27,803 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:27,814 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:27,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2150 50000) InVars {main_~x~0=v_main_~x~0_2150} OutVars{main_~x~0=v_main_~x~0_2150} AuxVars[] AssignedVars[] [2021-05-03 00:07:27,816 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:27,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:27,837 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:27,849 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2152) (< v_main_~x~0_2152 1000000)) InVars {main_~x~0=v_main_~x~0_2152} OutVars{main_~x~0=v_main_~x~0_2152} AuxVars[] AssignedVars[] [2021-05-03 00:07:27,850 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:27,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:27,877 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:27,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:27,893 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:27,912 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:28,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:28,843 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-03 00:07:28,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:30,584 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:30,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708085458] [2021-05-03 00:07:30,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1708085458] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:30,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:30,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-03 00:07:30,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551810459] [2021-05-03 00:07:30,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-03 00:07:30,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-03 00:07:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2748, Invalid=5442, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:07:30,586 INFO L87 Difference]: Start difference. First operand 188 states and 191 transitions. Second operand has 88 states, 88 states have (on average 1.625) internal successors, (143), 87 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:37,844 INFO L93 Difference]: Finished difference Result 277 states and 285 transitions. [2021-05-03 00:07:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-03 00:07:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.625) internal successors, (143), 87 states have internal predecessors, (143), 2 states have call successors, (3), 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 187 [2021-05-03 00:07:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:37,845 INFO L225 Difference]: With dead ends: 277 [2021-05-03 00:07:37,845 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:07:37,846 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9695 ImplicationChecksByTransitivity, 7357.7ms TimeCoverageRelationStatistics Valid=7975, Invalid=22825, Unknown=0, NotChecked=0, Total=30800 [2021-05-03 00:07:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:07:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-05-03 00:07:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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-03 00:07:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 194 transitions. [2021-05-03 00:07:37,857 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 194 transitions. Word has length 187 [2021-05-03 00:07:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:37,857 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 194 transitions. [2021-05-03 00:07:37,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 88 states have (on average 1.625) internal successors, (143), 87 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2021-05-03 00:07:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-05-03 00:07:37,858 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:37,858 INFO L523 BasicCegarLoop]: trace histogram [71, 49, 36, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:37,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-05-03 00:07:37,858 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1857000392, now seen corresponding path program 59 times [2021-05-03 00:07:37,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:37,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052386121] [2021-05-03 00:07:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:37,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2205) (< v_main_~x~0_2205 999999)) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,865 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:37,880 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:37,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:37,907 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:37,927 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2207 999999) (< v_main_~x~0_2207 50000)) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,929 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:37,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,939 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:37,946 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:37,956 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:37,958 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2209 50000) InVars {main_~x~0=v_main_~x~0_2209} OutVars{main_~x~0=v_main_~x~0_2209} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,958 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:37,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:37,976 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:37,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2211 1000000) (<= 50000 v_main_~x~0_2211)) InVars {main_~x~0=v_main_~x~0_2211} OutVars{main_~x~0=v_main_~x~0_2211} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,990 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:38,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:38,017 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:38,032 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:38,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:38,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:38,976 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-03 00:07:38,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:41,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:41,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052386121] [2021-05-03 00:07:41,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2052386121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:41,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:41,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-03 00:07:41,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993530646] [2021-05-03 00:07:41,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-03 00:07:41,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-03 00:07:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=7603, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:07:41,756 INFO L87 Difference]: Start difference. First operand 191 states and 194 transitions. Second operand has 90 states, 90 states have (on average 1.6222222222222222) internal successors, (146), 89 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:49,157 INFO L93 Difference]: Finished difference Result 280 states and 287 transitions. [2021-05-03 00:07:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:07:49,158 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.6222222222222222) internal successors, (146), 89 states have internal predecessors, (146), 2 states have call successors, (3), 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 190 [2021-05-03 00:07:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:49,159 INFO L225 Difference]: With dead ends: 280 [2021-05-03 00:07:49,159 INFO L226 Difference]: Without dead ends: 193 [2021-05-03 00:07:49,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3613 ImplicationChecksByTransitivity, 6989.8ms TimeCoverageRelationStatistics Valid=1253, Invalid=19053, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:07:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-03 00:07:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-05-03 00:07:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.0212765957446808) internal successors, (192), 188 states have internal predecessors, (192), 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-03 00:07:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2021-05-03 00:07:49,177 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 190 [2021-05-03 00:07:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2021-05-03 00:07:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 90 states have (on average 1.6222222222222222) internal successors, (146), 89 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2021-05-03 00:07:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-05-03 00:07:49,178 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:49,178 INFO L523 BasicCegarLoop]: trace histogram [72, 50, 36, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:49,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-05-03 00:07:49,178 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 535115899, now seen corresponding path program 60 times [2021-05-03 00:07:49,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:49,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197072283] [2021-05-03 00:07:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:49,186 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2265) (< v_main_~x~0_2265 999999)) InVars {main_~x~0=v_main_~x~0_2265} OutVars{main_~x~0=v_main_~x~0_2265} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,188 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:49,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:49,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:49,241 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:49,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2267 999999) (< v_main_~x~0_2267 50000)) InVars {main_~x~0=v_main_~x~0_2267} OutVars{main_~x~0=v_main_~x~0_2267} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,262 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:07:49,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:49,280 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:07:49,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:49,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2269 50000) InVars {main_~x~0=v_main_~x~0_2269} OutVars{main_~x~0=v_main_~x~0_2269} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,294 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:07:49,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:49,312 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:07:49,325 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2271 1000000) (<= 50000 v_main_~x~0_2271)) InVars {main_~x~0=v_main_~x~0_2271} OutVars{main_~x~0=v_main_~x~0_2271} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,326 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:07:49,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:07:49,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:07:49,366 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:07:49,387 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:07:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:50,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:50,339 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-03 00:07:50,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:07:53,337 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:53,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197072283] [2021-05-03 00:07:53,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [197072283] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:53,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:53,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2021-05-03 00:07:53,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001270916] [2021-05-03 00:07:53,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2021-05-03 00:07:53,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-05-03 00:07:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=7834, Unknown=0, NotChecked=0, Total=8742 [2021-05-03 00:07:53,339 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand has 91 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 90 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-03 00:08:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:01,043 INFO L93 Difference]: Finished difference Result 282 states and 289 transitions. [2021-05-03 00:08:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:08:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 90 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 192 [2021-05-03 00:08:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:01,044 INFO L225 Difference]: With dead ends: 282 [2021-05-03 00:08:01,044 INFO L226 Difference]: Without dead ends: 195 [2021-05-03 00:08:01,045 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 92 SyntacticMatches, 10 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3870 ImplicationChecksByTransitivity, 7353.8ms TimeCoverageRelationStatistics Valid=1164, Invalid=19716, Unknown=0, NotChecked=0, Total=20880 [2021-05-03 00:08:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-05-03 00:08:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-05-03 00:08:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.0210526315789474) internal successors, (194), 190 states have internal predecessors, (194), 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-03 00:08:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 198 transitions. [2021-05-03 00:08:01,061 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 198 transitions. Word has length 192 [2021-05-03 00:08:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:01,062 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 198 transitions. [2021-05-03 00:08:01,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 91 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 90 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-03 00:08:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2021-05-03 00:08:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-05-03 00:08:01,063 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:01,063 INFO L523 BasicCegarLoop]: trace histogram [73, 51, 36, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:01,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-05-03 00:08:01,063 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1551368190, now seen corresponding path program 61 times [2021-05-03 00:08:01,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:01,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468561727] [2021-05-03 00:08:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:01,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2326 999999) (<= 50000 v_main_~x~0_2326)) InVars {main_~x~0=v_main_~x~0_2326} OutVars{main_~x~0=v_main_~x~0_2326} AuxVars[] AssignedVars[] [2021-05-03 00:08:01,084 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:01,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:01,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:01,135 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:01,165 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2328 50000) (< v_main_~x~0_2328 999999)) InVars {main_~x~0=v_main_~x~0_2328} OutVars{main_~x~0=v_main_~x~0_2328} AuxVars[] AssignedVars[] [2021-05-03 00:08:01,167 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:08:01,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:01,192 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:08:01,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:01,209 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2330 50000) InVars {main_~x~0=v_main_~x~0_2330} OutVars{main_~x~0=v_main_~x~0_2330} AuxVars[] AssignedVars[] [2021-05-03 00:08:01,210 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:08:01,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:01,237 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:08:01,255 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2332) (< v_main_~x~0_2332 1000000)) InVars {main_~x~0=v_main_~x~0_2332} OutVars{main_~x~0=v_main_~x~0_2332} AuxVars[] AssignedVars[] [2021-05-03 00:08:01,257 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:01,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:01,298 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:01,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:01,344 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:01,370 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:02,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:02,299 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-03 00:08:02,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:02,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:02,980 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:02,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468561727] [2021-05-03 00:08:02,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [468561727] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:02,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:02,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:08:02,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759727888] [2021-05-03 00:08:02,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:08:02,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:08:02,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1793, Invalid=2497, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:08:02,982 INFO L87 Difference]: Start difference. First operand 195 states and 198 transitions. Second operand has 65 states, 65 states have (on average 1.4) internal successors, (91), 64 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-03 00:08:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:06,789 INFO L93 Difference]: Finished difference Result 288 states and 300 transitions. [2021-05-03 00:08:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:08:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 64 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 194 [2021-05-03 00:08:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:06,790 INFO L225 Difference]: With dead ends: 288 [2021-05-03 00:08:06,790 INFO L226 Difference]: Without dead ends: 201 [2021-05-03 00:08:06,791 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 4442.6ms TimeCoverageRelationStatistics Valid=5343, Invalid=10913, Unknown=0, NotChecked=0, Total=16256 [2021-05-03 00:08:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-05-03 00:08:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-05-03 00:08:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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-03 00:08:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2021-05-03 00:08:06,808 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 194 [2021-05-03 00:08:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:06,808 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2021-05-03 00:08:06,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 64 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-03 00:08:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2021-05-03 00:08:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-05-03 00:08:06,809 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:06,810 INFO L523 BasicCegarLoop]: trace histogram [75, 51, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:06,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-05-03 00:08:06,810 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1889806248, now seen corresponding path program 62 times [2021-05-03 00:08:06,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:06,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137764619] [2021-05-03 00:08:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:06,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2409) (< v_main_~x~0_2409 999999)) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-03 00:08:06,824 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:06,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:06,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:06,882 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:06,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2411 50000) (< v_main_~x~0_2411 999999)) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-03 00:08:06,908 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:08:06,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:06,927 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:08:06,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:06,940 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2413 50000) InVars {main_~x~0=v_main_~x~0_2413} OutVars{main_~x~0=v_main_~x~0_2413} AuxVars[] AssignedVars[] [2021-05-03 00:08:06,941 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:08:06,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:06,966 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:08:06,980 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2415 1000000) (<= 50000 v_main_~x~0_2415)) InVars {main_~x~0=v_main_~x~0_2415} OutVars{main_~x~0=v_main_~x~0_2415} AuxVars[] AssignedVars[] [2021-05-03 00:08:06,981 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:06,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,983 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:06,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:06,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:07,026 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:07,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:08,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:08,102 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-03 00:08:08,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:11,229 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:11,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137764619] [2021-05-03 00:08:11,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [137764619] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:11,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:11,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-03 00:08:11,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970416416] [2021-05-03 00:08:11,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-03 00:08:11,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:11,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-03 00:08:11,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=8322, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:08:11,230 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand has 94 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 93 states have internal predecessors, (152), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:19,495 INFO L93 Difference]: Finished difference Result 296 states and 303 transitions. [2021-05-03 00:08:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:08:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 93 states have internal predecessors, (152), 2 states have call successors, (3), 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 200 [2021-05-03 00:08:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:19,496 INFO L225 Difference]: With dead ends: 296 [2021-05-03 00:08:19,496 INFO L226 Difference]: Without dead ends: 203 [2021-05-03 00:08:19,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4050 ImplicationChecksByTransitivity, 7842.4ms TimeCoverageRelationStatistics Valid=1251, Invalid=20801, Unknown=0, NotChecked=0, Total=22052 [2021-05-03 00:08:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-05-03 00:08:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-05-03 00:08:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.02020202020202) internal successors, (202), 198 states have internal predecessors, (202), 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-03 00:08:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 206 transitions. [2021-05-03 00:08:19,508 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 206 transitions. Word has length 200 [2021-05-03 00:08:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 206 transitions. [2021-05-03 00:08:19,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 93 states have internal predecessors, (152), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 206 transitions. [2021-05-03 00:08:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-05-03 00:08:19,509 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:19,510 INFO L523 BasicCegarLoop]: trace histogram [76, 52, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:19,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-05-03 00:08:19,510 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash 210025515, now seen corresponding path program 63 times [2021-05-03 00:08:19,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:19,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111108463] [2021-05-03 00:08:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:19,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2471) (< v_main_~x~0_2471 999999)) InVars {main_~x~0=v_main_~x~0_2471} OutVars{main_~x~0=v_main_~x~0_2471} AuxVars[] AssignedVars[] [2021-05-03 00:08:19,517 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:19,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:19,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:19,576 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:19,611 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2473 50000) (< v_main_~x~0_2473 999999)) InVars {main_~x~0=v_main_~x~0_2473} OutVars{main_~x~0=v_main_~x~0_2473} AuxVars[] AssignedVars[] [2021-05-03 00:08:19,613 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:08:19,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:19,637 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:08:19,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:19,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2475 50000) InVars {main_~x~0=v_main_~x~0_2475} OutVars{main_~x~0=v_main_~x~0_2475} AuxVars[] AssignedVars[] [2021-05-03 00:08:19,656 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:08:19,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:19,680 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:08:19,698 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2477) (< v_main_~x~0_2477 1000000)) InVars {main_~x~0=v_main_~x~0_2477} OutVars{main_~x~0=v_main_~x~0_2477} AuxVars[] AssignedVars[] [2021-05-03 00:08:19,700 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:19,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:19,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:19,719 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:19,758 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:19,786 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:20,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:20,848 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-03 00:08:20,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:24,031 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:24,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111108463] [2021-05-03 00:08:24,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1111108463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:24,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:24,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2021-05-03 00:08:24,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373590489] [2021-05-03 00:08:24,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2021-05-03 00:08:24,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2021-05-03 00:08:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=8514, Unknown=0, NotChecked=0, Total=9506 [2021-05-03 00:08:24,033 INFO L87 Difference]: Start difference. First operand 203 states and 206 transitions. Second operand has 95 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 94 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-03 00:08:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:32,674 INFO L93 Difference]: Finished difference Result 298 states and 305 transitions. [2021-05-03 00:08:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:08:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 94 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 202 [2021-05-03 00:08:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:32,676 INFO L225 Difference]: With dead ends: 298 [2021-05-03 00:08:32,676 INFO L226 Difference]: Without dead ends: 205 [2021-05-03 00:08:32,677 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4106 ImplicationChecksByTransitivity, 8041.7ms TimeCoverageRelationStatistics Valid=1258, Invalid=21392, Unknown=0, NotChecked=0, Total=22650 [2021-05-03 00:08:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-03 00:08:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-05-03 00:08:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.02) internal successors, (204), 200 states have internal predecessors, (204), 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-03 00:08:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2021-05-03 00:08:32,688 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 202 [2021-05-03 00:08:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2021-05-03 00:08:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 95 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 94 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-03 00:08:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2021-05-03 00:08:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-05-03 00:08:32,689 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:32,689 INFO L523 BasicCegarLoop]: trace histogram [77, 53, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:32,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-05-03 00:08:32,689 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 848444398, now seen corresponding path program 64 times [2021-05-03 00:08:32,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:32,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884266784] [2021-05-03 00:08:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:32,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2534) (< v_main_~x~0_2534 999999)) InVars {main_~x~0=v_main_~x~0_2534} OutVars{main_~x~0=v_main_~x~0_2534} AuxVars[] AssignedVars[] [2021-05-03 00:08:32,702 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:32,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:32,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:32,748 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:32,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2536 50000) (< v_main_~x~0_2536 999999)) InVars {main_~x~0=v_main_~x~0_2536} OutVars{main_~x~0=v_main_~x~0_2536} AuxVars[] AssignedVars[] [2021-05-03 00:08:32,772 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:08:32,773 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:32,799 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:08:32,814 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:32,816 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2538 50000) InVars {main_~x~0=v_main_~x~0_2538} OutVars{main_~x~0=v_main_~x~0_2538} AuxVars[] AssignedVars[] [2021-05-03 00:08:32,817 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:08:32,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:32,838 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:08:32,854 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2540 1000000) (<= 50000 v_main_~x~0_2540)) InVars {main_~x~0=v_main_~x~0_2540} OutVars{main_~x~0=v_main_~x~0_2540} AuxVars[] AssignedVars[] [2021-05-03 00:08:32,859 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:32,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:32,888 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:32,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:32,908 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:32,930 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:33,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:33,995 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-03 00:08:33,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:37,603 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:37,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884266784] [2021-05-03 00:08:37,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [884266784] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:37,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:37,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-03 00:08:37,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864923943] [2021-05-03 00:08:37,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-03 00:08:37,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-03 00:08:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=8707, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:08:37,605 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand has 96 states, 96 states have (on average 1.625) internal successors, (156), 95 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:46,902 INFO L93 Difference]: Finished difference Result 300 states and 307 transitions. [2021-05-03 00:08:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:08:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.625) internal successors, (156), 95 states have internal predecessors, (156), 2 states have call successors, (3), 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 204 [2021-05-03 00:08:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:46,903 INFO L225 Difference]: With dead ends: 300 [2021-05-03 00:08:46,903 INFO L226 Difference]: Without dead ends: 207 [2021-05-03 00:08:46,905 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 100 SyntacticMatches, 9 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4202 ImplicationChecksByTransitivity, 8700.7ms TimeCoverageRelationStatistics Valid=1266, Invalid=21990, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:08:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-05-03 00:08:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-05-03 00:08:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.0198019801980198) internal successors, (206), 202 states have internal predecessors, (206), 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-03 00:08:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 210 transitions. [2021-05-03 00:08:46,923 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 210 transitions. Word has length 204 [2021-05-03 00:08:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:46,923 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 210 transitions. [2021-05-03 00:08:46,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 96 states have (on average 1.625) internal successors, (156), 95 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 210 transitions. [2021-05-03 00:08:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-05-03 00:08:46,924 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:46,924 INFO L523 BasicCegarLoop]: trace histogram [78, 54, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:46,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-05-03 00:08:46,924 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash 188667633, now seen corresponding path program 65 times [2021-05-03 00:08:46,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:46,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580192614] [2021-05-03 00:08:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:46,933 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2598) (< v_main_~x~0_2598 999999)) InVars {main_~x~0=v_main_~x~0_2598} OutVars{main_~x~0=v_main_~x~0_2598} AuxVars[] AssignedVars[] [2021-05-03 00:08:46,935 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:46,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:46,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:46,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:46,975 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:46,992 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:47,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2600 999999) (< v_main_~x~0_2600 50000)) InVars {main_~x~0=v_main_~x~0_2600} OutVars{main_~x~0=v_main_~x~0_2600} AuxVars[] AssignedVars[] [2021-05-03 00:08:47,019 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:08:47,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:47,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:47,042 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:08:47,055 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:47,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2602 50000) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2602} AuxVars[] AssignedVars[] [2021-05-03 00:08:47,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:08:47,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:47,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:47,078 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:08:47,094 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2604) (< v_main_~x~0_2604 1000000)) InVars {main_~x~0=v_main_~x~0_2604} OutVars{main_~x~0=v_main_~x~0_2604} AuxVars[] AssignedVars[] [2021-05-03 00:08:47,096 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:08:47,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:47,098 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:47,109 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:08:47,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:08:47,146 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:08:47,169 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:08:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:48,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:48,298 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-03 00:08:48,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:08:51,897 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:51,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580192614] [2021-05-03 00:08:51,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [580192614] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:51,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:51,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2021-05-03 00:08:51,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246082815] [2021-05-03 00:08:51,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2021-05-03 00:08:51,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-05-03 00:08:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=8901, Unknown=0, NotChecked=0, Total=9900 [2021-05-03 00:08:51,899 INFO L87 Difference]: Start difference. First operand 207 states and 210 transitions. Second operand has 97 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 96 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:01,668 INFO L93 Difference]: Finished difference Result 302 states and 309 transitions. [2021-05-03 00:09:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:09:01,668 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 96 states have internal predecessors, (158), 2 states have call successors, (3), 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 206 [2021-05-03 00:09:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:01,669 INFO L225 Difference]: With dead ends: 302 [2021-05-03 00:09:01,669 INFO L226 Difference]: Without dead ends: 209 [2021-05-03 00:09:01,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4380 ImplicationChecksByTransitivity, 8986.9ms TimeCoverageRelationStatistics Valid=1275, Invalid=22595, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:09:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-05-03 00:09:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-05-03 00:09:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.0196078431372548) internal successors, (208), 204 states have internal predecessors, (208), 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-03 00:09:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 212 transitions. [2021-05-03 00:09:01,687 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 212 transitions. Word has length 206 [2021-05-03 00:09:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:01,688 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 212 transitions. [2021-05-03 00:09:01,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 97 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 96 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 212 transitions. [2021-05-03 00:09:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-05-03 00:09:01,689 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:01,689 INFO L523 BasicCegarLoop]: trace histogram [79, 55, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:01,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-05-03 00:09:01,689 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1798356276, now seen corresponding path program 66 times [2021-05-03 00:09:01,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:01,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296683037] [2021-05-03 00:09:01,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:01,697 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2663) (< v_main_~x~0_2663 999999)) InVars {main_~x~0=v_main_~x~0_2663} OutVars{main_~x~0=v_main_~x~0_2663} AuxVars[] AssignedVars[] [2021-05-03 00:09:01,699 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:01,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:01,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:01,749 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:01,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2665 50000) (< v_main_~x~0_2665 999999)) InVars {main_~x~0=v_main_~x~0_2665} OutVars{main_~x~0=v_main_~x~0_2665} AuxVars[] AssignedVars[] [2021-05-03 00:09:01,773 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:01,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,785 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:01,792 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:01,805 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:01,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2667 50000) InVars {main_~x~0=v_main_~x~0_2667} OutVars{main_~x~0=v_main_~x~0_2667} AuxVars[] AssignedVars[] [2021-05-03 00:09:01,807 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:01,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:01,827 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:01,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2669) (< v_main_~x~0_2669 1000000)) InVars {main_~x~0=v_main_~x~0_2669} OutVars{main_~x~0=v_main_~x~0_2669} AuxVars[] AssignedVars[] [2021-05-03 00:09:01,843 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:01,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,863 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:01,872 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:01,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:01,898 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:01,920 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:03,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:03,051 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-03 00:09:03,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:06,765 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:06,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296683037] [2021-05-03 00:09:06,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1296683037] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:06,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:06,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2021-05-03 00:09:06,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038682609] [2021-05-03 00:09:06,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2021-05-03 00:09:06,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-05-03 00:09:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=9099, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:09:06,767 INFO L87 Difference]: Start difference. First operand 209 states and 212 transitions. Second operand has 98 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 97 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-03 00:09:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:17,252 INFO L93 Difference]: Finished difference Result 304 states and 311 transitions. [2021-05-03 00:09:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:09:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 97 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 208 [2021-05-03 00:09:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:17,253 INFO L225 Difference]: With dead ends: 304 [2021-05-03 00:09:17,253 INFO L226 Difference]: Without dead ends: 211 [2021-05-03 00:09:17,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 9392.3ms TimeCoverageRelationStatistics Valid=1282, Invalid=23210, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:09:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-03 00:09:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-05-03 00:09:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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-03 00:09:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 214 transitions. [2021-05-03 00:09:17,273 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 214 transitions. Word has length 208 [2021-05-03 00:09:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:17,273 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 214 transitions. [2021-05-03 00:09:17,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 98 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 97 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-03 00:09:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 214 transitions. [2021-05-03 00:09:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-05-03 00:09:17,274 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:17,274 INFO L523 BasicCegarLoop]: trace histogram [80, 56, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:17,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-05-03 00:09:17,275 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1774051657, now seen corresponding path program 67 times [2021-05-03 00:09:17,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:17,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150700664] [2021-05-03 00:09:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:17,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2729) (< v_main_~x~0_2729 999999)) InVars {main_~x~0=v_main_~x~0_2729} OutVars{main_~x~0=v_main_~x~0_2729} AuxVars[] AssignedVars[] [2021-05-03 00:09:17,286 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:17,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:17,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:17,354 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:17,388 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2731 999999) (< v_main_~x~0_2731 50000)) InVars {main_~x~0=v_main_~x~0_2731} OutVars{main_~x~0=v_main_~x~0_2731} AuxVars[] AssignedVars[] [2021-05-03 00:09:17,390 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:17,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:17,419 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:17,433 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:17,435 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2733 50000) InVars {main_~x~0=v_main_~x~0_2733} OutVars{main_~x~0=v_main_~x~0_2733} AuxVars[] AssignedVars[] [2021-05-03 00:09:17,436 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:17,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:17,460 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:17,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2735) (< v_main_~x~0_2735 1000000)) InVars {main_~x~0=v_main_~x~0_2735} OutVars{main_~x~0=v_main_~x~0_2735} AuxVars[] AssignedVars[] [2021-05-03 00:09:17,479 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:17,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:17,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:17,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:17,534 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:17,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:18,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:18,761 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-03 00:09:18,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:23,037 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:23,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150700664] [2021-05-03 00:09:23,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [150700664] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:23,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:23,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [99] imperfect sequences [] total 99 [2021-05-03 00:09:23,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037219442] [2021-05-03 00:09:23,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2021-05-03 00:09:23,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2021-05-03 00:09:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1004, Invalid=9298, Unknown=0, NotChecked=0, Total=10302 [2021-05-03 00:09:23,039 INFO L87 Difference]: Start difference. First operand 211 states and 214 transitions. Second operand has 99 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 98 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:34,443 INFO L93 Difference]: Finished difference Result 306 states and 313 transitions. [2021-05-03 00:09:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:09:34,444 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 98 states have internal predecessors, (162), 2 states have call successors, (3), 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 210 [2021-05-03 00:09:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:34,445 INFO L225 Difference]: With dead ends: 306 [2021-05-03 00:09:34,445 INFO L226 Difference]: Without dead ends: 213 [2021-05-03 00:09:34,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 101 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4580 ImplicationChecksByTransitivity, 10377.4ms TimeCoverageRelationStatistics Valid=1290, Invalid=23832, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:09:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-05-03 00:09:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-05-03 00:09:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.0192307692307692) internal successors, (212), 208 states have internal predecessors, (212), 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-03 00:09:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 216 transitions. [2021-05-03 00:09:34,458 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 216 transitions. Word has length 210 [2021-05-03 00:09:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:34,458 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 216 transitions. [2021-05-03 00:09:34,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 99 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 98 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 216 transitions. [2021-05-03 00:09:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-05-03 00:09:34,459 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:34,459 INFO L523 BasicCegarLoop]: trace histogram [81, 57, 38, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:34,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-05-03 00:09:34,459 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1115761530, now seen corresponding path program 68 times [2021-05-03 00:09:34,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:34,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305341668] [2021-05-03 00:09:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:34,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2796) (< v_main_~x~0_2796 999999)) InVars {main_~x~0=v_main_~x~0_2796} OutVars{main_~x~0=v_main_~x~0_2796} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,477 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:34,498 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:34,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:34,533 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:34,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2798 50000) (< v_main_~x~0_2798 999999)) InVars {main_~x~0=v_main_~x~0_2798} OutVars{main_~x~0=v_main_~x~0_2798} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,564 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:34,573 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:34,588 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:34,603 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:34,605 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2800 50000) InVars {main_~x~0=v_main_~x~0_2800} OutVars{main_~x~0=v_main_~x~0_2800} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,606 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:34,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:34,629 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:34,645 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2802) (< v_main_~x~0_2802 1000000)) InVars {main_~x~0=v_main_~x~0_2802} OutVars{main_~x~0=v_main_~x~0_2802} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,647 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:34,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:34,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:34,715 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:34,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:35,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:35,911 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-03 00:09:35,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:35,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:36,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:36,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305341668] [2021-05-03 00:09:36,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [305341668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:36,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:36,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:09:36,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974588015] [2021-05-03 00:09:36,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:09:36,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:09:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1942, Invalid=2750, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:09:36,757 INFO L87 Difference]: Start difference. First operand 213 states and 216 transitions. Second operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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-03 00:09:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:41,807 INFO L93 Difference]: Finished difference Result 311 states and 322 transitions. [2021-05-03 00:09:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:09:41,808 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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 212 [2021-05-03 00:09:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:41,809 INFO L225 Difference]: With dead ends: 311 [2021-05-03 00:09:41,809 INFO L226 Difference]: Without dead ends: 218 [2021-05-03 00:09:41,809 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5160 ImplicationChecksByTransitivity, 5693.7ms TimeCoverageRelationStatistics Valid=5789, Invalid=12033, Unknown=0, NotChecked=0, Total=17822 [2021-05-03 00:09:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-05-03 00:09:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2021-05-03 00:09:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.0187793427230047) internal successors, (217), 213 states have internal predecessors, (217), 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-03 00:09:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 221 transitions. [2021-05-03 00:09:41,821 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 221 transitions. Word has length 212 [2021-05-03 00:09:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:41,821 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 221 transitions. [2021-05-03 00:09:41,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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-03 00:09:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 221 transitions. [2021-05-03 00:09:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-05-03 00:09:41,822 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:41,822 INFO L523 BasicCegarLoop]: trace histogram [83, 57, 39, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:41,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-05-03 00:09:41,822 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash -679605345, now seen corresponding path program 69 times [2021-05-03 00:09:41,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:41,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626500724] [2021-05-03 00:09:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:41,829 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2887 999999) (<= 50000 v_main_~x~0_2887)) InVars {main_~x~0=v_main_~x~0_2887} OutVars{main_~x~0=v_main_~x~0_2887} AuxVars[] AssignedVars[] [2021-05-03 00:09:41,831 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:41,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:41,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:41,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:41,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:41,884 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:41,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2889 999999) (< v_main_~x~0_2889 50000)) InVars {main_~x~0=v_main_~x~0_2889} OutVars{main_~x~0=v_main_~x~0_2889} AuxVars[] AssignedVars[] [2021-05-03 00:09:41,913 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:41,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:41,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:41,934 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:41,949 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:41,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2891 50000) InVars {main_~x~0=v_main_~x~0_2891} OutVars{main_~x~0=v_main_~x~0_2891} AuxVars[] AssignedVars[] [2021-05-03 00:09:41,953 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:41,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:41,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:41,984 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:42,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2893 1000000) (<= 50000 v_main_~x~0_2893)) InVars {main_~x~0=v_main_~x~0_2893} OutVars{main_~x~0=v_main_~x~0_2893} AuxVars[] AssignedVars[] [2021-05-03 00:09:42,005 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:42,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:42,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:42,056 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:42,083 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:43,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:43,362 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-03 00:09:43,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:48,355 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:48,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626500724] [2021-05-03 00:09:48,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1626500724] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:48,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:48,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2021-05-03 00:09:48,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197975238] [2021-05-03 00:09:48,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2021-05-03 00:09:48,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2021-05-03 00:09:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=9606, Unknown=0, NotChecked=0, Total=10712 [2021-05-03 00:09:48,356 INFO L87 Difference]: Start difference. First operand 218 states and 221 transitions. Second operand has 101 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 100 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:01,027 INFO L93 Difference]: Finished difference Result 318 states and 325 transitions. [2021-05-03 00:10:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:10:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 100 states have internal predecessors, (165), 2 states have call successors, (3), 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 217 [2021-05-03 00:10:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:01,029 INFO L225 Difference]: With dead ends: 318 [2021-05-03 00:10:01,029 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:10:01,030 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 102 SyntacticMatches, 15 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4906 ImplicationChecksByTransitivity, 11597.1ms TimeCoverageRelationStatistics Valid=1454, Invalid=24628, Unknown=0, NotChecked=0, Total=26082 [2021-05-03 00:10:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:10:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-05-03 00:10:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.0186046511627906) internal successors, (219), 215 states have internal predecessors, (219), 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-03 00:10:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 223 transitions. [2021-05-03 00:10:01,042 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 223 transitions. Word has length 217 [2021-05-03 00:10:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:01,042 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 223 transitions. [2021-05-03 00:10:01,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 101 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 100 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 223 transitions. [2021-05-03 00:10:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-05-03 00:10:01,043 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:01,043 INFO L523 BasicCegarLoop]: trace histogram [84, 58, 39, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:01,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-05-03 00:10:01,043 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1694412156, now seen corresponding path program 70 times [2021-05-03 00:10:01,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:01,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038518808] [2021-05-03 00:10:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:01,051 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2955 999999) (<= 50000 v_main_~x~0_2955)) InVars {main_~x~0=v_main_~x~0_2955} OutVars{main_~x~0=v_main_~x~0_2955} AuxVars[] AssignedVars[] [2021-05-03 00:10:01,052 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:01,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,076 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:01,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:01,109 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:01,136 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2957 50000) (< v_main_~x~0_2957 999999)) InVars {main_~x~0=v_main_~x~0_2957} OutVars{main_~x~0=v_main_~x~0_2957} AuxVars[] AssignedVars[] [2021-05-03 00:10:01,138 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:01,148 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:01,164 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:01,182 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:01,183 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2959 50000) InVars {main_~x~0=v_main_~x~0_2959} OutVars{main_~x~0=v_main_~x~0_2959} AuxVars[] AssignedVars[] [2021-05-03 00:10:01,185 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:01,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:01,210 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:01,228 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2961 1000000) (<= 50000 v_main_~x~0_2961)) InVars {main_~x~0=v_main_~x~0_2961} OutVars{main_~x~0=v_main_~x~0_2961} AuxVars[] AssignedVars[] [2021-05-03 00:10:01,230 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:01,251 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,253 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:01,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:01,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:01,288 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:01,317 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:02,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:02,878 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-03 00:10:02,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:06,096 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:06,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038518808] [2021-05-03 00:10:06,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038518808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:06,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:06,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2021-05-03 00:10:06,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486305400] [2021-05-03 00:10:06,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2021-05-03 00:10:06,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-05-03 00:10:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3550, Invalid=7370, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:10:06,098 INFO L87 Difference]: Start difference. First operand 220 states and 223 transitions. Second operand has 102 states, 102 states have (on average 1.6372549019607843) internal successors, (167), 101 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:20,371 INFO L93 Difference]: Finished difference Result 321 states and 329 transitions. [2021-05-03 00:10:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-05-03 00:10:20,372 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.6372549019607843) internal successors, (167), 101 states have internal predecessors, (167), 2 states have call successors, (3), 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 219 [2021-05-03 00:10:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:20,373 INFO L225 Difference]: With dead ends: 321 [2021-05-03 00:10:20,373 INFO L226 Difference]: Without dead ends: 223 [2021-05-03 00:10:20,375 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 110 SyntacticMatches, 8 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12872 ImplicationChecksByTransitivity, 13502.0ms TimeCoverageRelationStatistics Valid=10345, Invalid=31067, Unknown=0, NotChecked=0, Total=41412 [2021-05-03 00:10:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-03 00:10:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-05-03 00:10:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.018348623853211) internal successors, (222), 218 states have internal predecessors, (222), 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-03 00:10:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 226 transitions. [2021-05-03 00:10:20,414 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 226 transitions. Word has length 219 [2021-05-03 00:10:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:20,414 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 226 transitions. [2021-05-03 00:10:20,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 102 states, 102 states have (on average 1.6372549019607843) internal successors, (167), 101 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 226 transitions. [2021-05-03 00:10:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-05-03 00:10:20,416 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:20,416 INFO L523 BasicCegarLoop]: trace histogram [85, 59, 40, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:20,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-05-03 00:10:20,416 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 151616106, now seen corresponding path program 71 times [2021-05-03 00:10:20,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:20,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1222632209] [2021-05-03 00:10:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:20,427 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3024) (< v_main_~x~0_3024 999999)) InVars {main_~x~0=v_main_~x~0_3024} OutVars{main_~x~0=v_main_~x~0_3024} AuxVars[] AssignedVars[] [2021-05-03 00:10:20,429 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:20,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,466 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:20,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:20,519 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:20,562 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3026 50000) (< v_main_~x~0_3026 999999)) InVars {main_~x~0=v_main_~x~0_3026} OutVars{main_~x~0=v_main_~x~0_3026} AuxVars[] AssignedVars[] [2021-05-03 00:10:20,564 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:20,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:20,602 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:20,626 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:20,629 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3028 50000) InVars {main_~x~0=v_main_~x~0_3028} OutVars{main_~x~0=v_main_~x~0_3028} AuxVars[] AssignedVars[] [2021-05-03 00:10:20,631 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:20,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:20,666 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:20,691 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3030) (< v_main_~x~0_3030 1000000)) InVars {main_~x~0=v_main_~x~0_3030} OutVars{main_~x~0=v_main_~x~0_3030} AuxVars[] AssignedVars[] [2021-05-03 00:10:20,694 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:20,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:20,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:20,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:20,773 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:20,814 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:22,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:22,605 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-03 00:10:22,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:28,656 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:28,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1222632209] [2021-05-03 00:10:28,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1222632209] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:28,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:28,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2021-05-03 00:10:28,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529664842] [2021-05-03 00:10:28,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2021-05-03 00:10:28,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:28,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-05-03 00:10:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1097, Invalid=10245, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:10:28,657 INFO L87 Difference]: Start difference. First operand 223 states and 226 transitions. Second operand has 104 states, 104 states have (on average 1.6346153846153846) internal successors, (170), 103 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:45,250 INFO L93 Difference]: Finished difference Result 324 states and 331 transitions. [2021-05-03 00:10:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:10:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.6346153846153846) internal successors, (170), 103 states have internal predecessors, (170), 2 states have call successors, (3), 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 222 [2021-05-03 00:10:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:45,253 INFO L225 Difference]: With dead ends: 324 [2021-05-03 00:10:45,253 INFO L226 Difference]: Without dead ends: 225 [2021-05-03 00:10:45,255 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 105 SyntacticMatches, 14 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5202 ImplicationChecksByTransitivity, 14597.5ms TimeCoverageRelationStatistics Valid=1398, Invalid=26324, Unknown=0, NotChecked=0, Total=27722 [2021-05-03 00:10:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-03 00:10:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-05-03 00:10:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.018181818181818) internal successors, (224), 220 states have internal predecessors, (224), 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-03 00:10:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 228 transitions. [2021-05-03 00:10:45,271 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 228 transitions. Word has length 222 [2021-05-03 00:10:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:45,271 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 228 transitions. [2021-05-03 00:10:45,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 104 states, 104 states have (on average 1.6346153846153846) internal successors, (170), 103 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 228 transitions. [2021-05-03 00:10:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-03 00:10:45,272 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:45,273 INFO L523 BasicCegarLoop]: trace histogram [86, 60, 40, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:45,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-05-03 00:10:45,273 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 551844525, now seen corresponding path program 72 times [2021-05-03 00:10:45,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:45,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598554914] [2021-05-03 00:10:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:45,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3094 999999) (<= 50000 v_main_~x~0_3094)) InVars {main_~x~0=v_main_~x~0_3094} OutVars{main_~x~0=v_main_~x~0_3094} AuxVars[] AssignedVars[] [2021-05-03 00:10:45,287 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:45,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,310 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:45,315 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:45,383 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:45,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3096 999999) (< v_main_~x~0_3096 50000)) InVars {main_~x~0=v_main_~x~0_3096} OutVars{main_~x~0=v_main_~x~0_3096} AuxVars[] AssignedVars[] [2021-05-03 00:10:45,440 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:45,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:45,483 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:45,508 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:45,511 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3098 50000) InVars {main_~x~0=v_main_~x~0_3098} OutVars{main_~x~0=v_main_~x~0_3098} AuxVars[] AssignedVars[] [2021-05-03 00:10:45,513 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:45,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:45,548 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:45,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3100 1000000) (<= 50000 v_main_~x~0_3100)) InVars {main_~x~0=v_main_~x~0_3100} OutVars{main_~x~0=v_main_~x~0_3100} AuxVars[] AssignedVars[] [2021-05-03 00:10:45,574 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:45,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:45,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:45,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:45,642 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:45,690 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:47,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:47,530 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-03 00:10:47,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:54,158 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:54,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598554914] [2021-05-03 00:10:54,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [598554914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:54,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:54,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2021-05-03 00:10:54,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988323238] [2021-05-03 00:10:54,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2021-05-03 00:10:54,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-05-03 00:10:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=10456, Unknown=0, NotChecked=0, Total=11556 [2021-05-03 00:10:54,160 INFO L87 Difference]: Start difference. First operand 225 states and 228 transitions. Second operand has 105 states, 105 states have (on average 1.638095238095238) internal successors, (172), 104 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-03 00:11:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:12,487 INFO L93 Difference]: Finished difference Result 326 states and 333 transitions. [2021-05-03 00:11:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:11:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.638095238095238) internal successors, (172), 104 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 224 [2021-05-03 00:11:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:12,490 INFO L225 Difference]: With dead ends: 326 [2021-05-03 00:11:12,490 INFO L226 Difference]: Without dead ends: 227 [2021-05-03 00:11:12,492 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 15795.1ms TimeCoverageRelationStatistics Valid=1406, Invalid=26986, Unknown=0, NotChecked=0, Total=28392 [2021-05-03 00:11:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-05-03 00:11:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-05-03 00:11:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.018018018018018) internal successors, (226), 222 states have internal predecessors, (226), 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-03 00:11:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 230 transitions. [2021-05-03 00:11:12,506 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 230 transitions. Word has length 224 [2021-05-03 00:11:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 230 transitions. [2021-05-03 00:11:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 105 states, 105 states have (on average 1.638095238095238) internal successors, (172), 104 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-03 00:11:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 230 transitions. [2021-05-03 00:11:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-05-03 00:11:12,508 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:12,508 INFO L523 BasicCegarLoop]: trace histogram [87, 61, 40, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:12,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-05-03 00:11:12,508 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1375701456, now seen corresponding path program 73 times [2021-05-03 00:11:12,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:12,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183583287] [2021-05-03 00:11:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:12,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3165) (< v_main_~x~0_3165 999999)) InVars {main_~x~0=v_main_~x~0_3165} OutVars{main_~x~0=v_main_~x~0_3165} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,522 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:12,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,555 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,571 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:12,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:12,609 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:12,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3167 999999) (< v_main_~x~0_3167 50000)) InVars {main_~x~0=v_main_~x~0_3167} OutVars{main_~x~0=v_main_~x~0_3167} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,661 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:12,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:12,700 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:12,724 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:12,727 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3169 50000) InVars {main_~x~0=v_main_~x~0_3169} OutVars{main_~x~0=v_main_~x~0_3169} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,729 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:12,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:12,761 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:12,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3171) (< v_main_~x~0_3171 1000000)) InVars {main_~x~0=v_main_~x~0_3171} OutVars{main_~x~0=v_main_~x~0_3171} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,791 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:12,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:12,816 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:12,868 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:12,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:14,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:14,756 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-03 00:11:14,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:14,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:16,153 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:16,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183583287] [2021-05-03 00:11:16,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [183583287] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:16,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:16,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:11:16,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988266155] [2021-05-03 00:11:16,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:11:16,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:11:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2207, Invalid=3049, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:11:16,155 INFO L87 Difference]: Start difference. First operand 227 states and 230 transitions. Second operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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-03 00:11:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:24,067 INFO L93 Difference]: Finished difference Result 332 states and 344 transitions. [2021-05-03 00:11:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:11:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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 226 [2021-05-03 00:11:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:24,070 INFO L225 Difference]: With dead ends: 332 [2021-05-03 00:11:24,070 INFO L226 Difference]: Without dead ends: 233 [2021-05-03 00:11:24,072 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5927 ImplicationChecksByTransitivity, 8872.4ms TimeCoverageRelationStatistics Valid=6615, Invalid=13691, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:11:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-05-03 00:11:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-05-03 00:11:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.0175438596491229) internal successors, (232), 228 states have internal predecessors, (232), 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-03 00:11:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 236 transitions. [2021-05-03 00:11:24,092 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 236 transitions. Word has length 226 [2021-05-03 00:11:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:24,093 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 236 transitions. [2021-05-03 00:11:24,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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-03 00:11:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 236 transitions. [2021-05-03 00:11:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-05-03 00:11:24,094 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:24,094 INFO L523 BasicCegarLoop]: trace histogram [89, 61, 42, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:24,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-05-03 00:11:24,094 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash -418899110, now seen corresponding path program 74 times [2021-05-03 00:11:24,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:24,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460846048] [2021-05-03 00:11:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:24,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3262) (< v_main_~x~0_3262 999999)) InVars {main_~x~0=v_main_~x~0_3262} OutVars{main_~x~0=v_main_~x~0_3262} AuxVars[] AssignedVars[] [2021-05-03 00:11:24,108 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:24,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:24,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:24,183 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:24,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3264 50000) (< v_main_~x~0_3264 999999)) InVars {main_~x~0=v_main_~x~0_3264} OutVars{main_~x~0=v_main_~x~0_3264} AuxVars[] AssignedVars[] [2021-05-03 00:11:24,227 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:24,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:24,262 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:24,278 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:24,279 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3266 50000) InVars {main_~x~0=v_main_~x~0_3266} OutVars{main_~x~0=v_main_~x~0_3266} AuxVars[] AssignedVars[] [2021-05-03 00:11:24,281 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:24,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:24,319 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:24,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3268) (< v_main_~x~0_3268 1000000)) InVars {main_~x~0=v_main_~x~0_3268} OutVars{main_~x~0=v_main_~x~0_3268} AuxVars[] AssignedVars[] [2021-05-03 00:11:24,347 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:24,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:24,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:24,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:24,428 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:24,469 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:26,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:26,638 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-03 00:11:26,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:31,663 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:31,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460846048] [2021-05-03 00:11:31,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [460846048] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:31,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:31,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2021-05-03 00:11:31,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236582252] [2021-05-03 00:11:31,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2021-05-03 00:11:31,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2021-05-03 00:11:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3894, Invalid=8096, Unknown=0, NotChecked=0, Total=11990 [2021-05-03 00:11:31,666 INFO L87 Difference]: Start difference. First operand 233 states and 236 transitions. Second operand has 108 states, 108 states have (on average 1.6296296296296295) internal successors, (176), 107 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:52,004 INFO L93 Difference]: Finished difference Result 341 states and 349 transitions. [2021-05-03 00:11:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-05-03 00:11:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.6296296296296295) internal successors, (176), 107 states have internal predecessors, (176), 2 states have call successors, (3), 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 232 [2021-05-03 00:11:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:52,006 INFO L225 Difference]: With dead ends: 341 [2021-05-03 00:11:52,006 INFO L226 Difference]: Without dead ends: 236 [2021-05-03 00:11:52,008 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 113 SyntacticMatches, 13 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14417 ImplicationChecksByTransitivity, 18877.8ms TimeCoverageRelationStatistics Valid=11515, Invalid=34495, Unknown=0, NotChecked=0, Total=46010 [2021-05-03 00:11:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-05-03 00:11:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-05-03 00:11:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.0173160173160174) internal successors, (235), 231 states have internal predecessors, (235), 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-03 00:11:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2021-05-03 00:11:52,024 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 232 [2021-05-03 00:11:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:52,024 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2021-05-03 00:11:52,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 108 states, 108 states have (on average 1.6296296296296295) internal successors, (176), 107 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2021-05-03 00:11:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-05-03 00:11:52,025 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:52,025 INFO L523 BasicCegarLoop]: trace histogram [90, 62, 43, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:52,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-05-03 00:11:52,025 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:52,026 INFO L82 PathProgramCache]: Analyzing trace with hash 14474022, now seen corresponding path program 75 times [2021-05-03 00:11:52,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:52,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051584510] [2021-05-03 00:11:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:52,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3334 999999) (<= 50000 v_main_~x~0_3334)) InVars {main_~x~0=v_main_~x~0_3334} OutVars{main_~x~0=v_main_~x~0_3334} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,037 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:52,038 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,040 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,056 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:52,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:52,113 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:52,160 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3336 50000) (< v_main_~x~0_3336 999999)) InVars {main_~x~0=v_main_~x~0_3336} OutVars{main_~x~0=v_main_~x~0_3336} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,161 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:52,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:52,201 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:52,226 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:52,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3338 50000) InVars {main_~x~0=v_main_~x~0_3338} OutVars{main_~x~0=v_main_~x~0_3338} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,231 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:52,233 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:52,268 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:52,297 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3340) (< v_main_~x~0_3340 1000000)) InVars {main_~x~0=v_main_~x~0_3340} OutVars{main_~x~0=v_main_~x~0_3340} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,300 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:52,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:52,335 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:52,392 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:52,437 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:54,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:54,738 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-03 00:11:54,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:02,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051584510] [2021-05-03 00:12:02,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2051584510] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2021-05-03 00:12:02,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160096294] [2021-05-03 00:12:02,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2021-05-03 00:12:02,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-05-03 00:12:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1238, Invalid=11418, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:12:02,857 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand has 110 states, 110 states have (on average 1.6272727272727272) internal successors, (179), 109 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:25,088 INFO L93 Difference]: Finished difference Result 344 states and 351 transitions. [2021-05-03 00:12:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:12:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.6272727272727272) internal successors, (179), 109 states have internal predecessors, (179), 2 states have call successors, (3), 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 235 [2021-05-03 00:12:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:25,091 INFO L225 Difference]: With dead ends: 344 [2021-05-03 00:12:25,091 INFO L226 Difference]: Without dead ends: 238 [2021-05-03 00:12:25,092 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 112 SyntacticMatches, 14 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5760 ImplicationChecksByTransitivity, 19068.5ms TimeCoverageRelationStatistics Valid=1554, Invalid=29246, Unknown=0, NotChecked=0, Total=30800 [2021-05-03 00:12:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-05-03 00:12:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-05-03 00:12:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.0171673819742488) internal successors, (237), 233 states have internal predecessors, (237), 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-03 00:12:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 241 transitions. [2021-05-03 00:12:25,110 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 241 transitions. Word has length 235 [2021-05-03 00:12:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:25,110 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 241 transitions. [2021-05-03 00:12:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 110 states, 110 states have (on average 1.6272727272727272) internal successors, (179), 109 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 241 transitions. [2021-05-03 00:12:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-05-03 00:12:25,112 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:25,112 INFO L523 BasicCegarLoop]: trace histogram [91, 63, 43, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:25,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-05-03 00:12:25,112 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash -504520765, now seen corresponding path program 76 times [2021-05-03 00:12:25,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:25,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980103032] [2021-05-03 00:12:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:25,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3407 999999) (<= 50000 v_main_~x~0_3407)) InVars {main_~x~0=v_main_~x~0_3407} OutVars{main_~x~0=v_main_~x~0_3407} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,127 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:25,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,169 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:25,191 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:25,222 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:25,270 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3409 50000) (< v_main_~x~0_3409 999999)) InVars {main_~x~0=v_main_~x~0_3409} OutVars{main_~x~0=v_main_~x~0_3409} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,272 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:25,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:25,310 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:25,340 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:25,343 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3411 50000) InVars {main_~x~0=v_main_~x~0_3411} OutVars{main_~x~0=v_main_~x~0_3411} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,345 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:25,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,356 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:25,381 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:25,420 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3413 1000000) (<= 50000 v_main_~x~0_3413)) InVars {main_~x~0=v_main_~x~0_3413} OutVars{main_~x~0=v_main_~x~0_3413} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,422 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:25,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:25,479 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:25,508 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:25,557 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:27,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:27,757 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-03 00:12:27,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:27,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:29,469 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:29,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980103032] [2021-05-03 00:12:29,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1980103032] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:29,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:29,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:12:29,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449331246] [2021-05-03 00:12:29,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:12:29,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:12:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2522, Invalid=3484, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:12:29,471 INFO L87 Difference]: Start difference. First operand 238 states and 241 transitions. Second operand has 78 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 77 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:39,348 INFO L93 Difference]: Finished difference Result 350 states and 362 transitions. [2021-05-03 00:12:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:12:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 77 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 237 [2021-05-03 00:12:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:39,350 INFO L225 Difference]: With dead ends: 350 [2021-05-03 00:12:39,350 INFO L226 Difference]: Without dead ends: 244 [2021-05-03 00:12:39,351 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6808 ImplicationChecksByTransitivity, 10865.8ms TimeCoverageRelationStatistics Valid=7560, Invalid=15696, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:12:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-05-03 00:12:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-05-03 00:12:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.0167364016736402) internal successors, (243), 239 states have internal predecessors, (243), 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-03 00:12:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2021-05-03 00:12:39,365 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 237 [2021-05-03 00:12:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:39,365 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2021-05-03 00:12:39,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 77 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2021-05-03 00:12:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-05-03 00:12:39,366 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:39,367 INFO L523 BasicCegarLoop]: trace histogram [93, 63, 45, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:39,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-05-03 00:12:39,367 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1552253351, now seen corresponding path program 77 times [2021-05-03 00:12:39,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:39,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374225339] [2021-05-03 00:12:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:39,390 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3508 999999) (<= 50000 v_main_~x~0_3508)) InVars {main_~x~0=v_main_~x~0_3508} OutVars{main_~x~0=v_main_~x~0_3508} AuxVars[] AssignedVars[] [2021-05-03 00:12:39,393 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:39,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:39,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:39,500 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:39,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3510 999999) (< v_main_~x~0_3510 50000)) InVars {main_~x~0=v_main_~x~0_3510} OutVars{main_~x~0=v_main_~x~0_3510} AuxVars[] AssignedVars[] [2021-05-03 00:12:39,564 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:39,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:39,611 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:39,644 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:39,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3512 50000) InVars {main_~x~0=v_main_~x~0_3512} OutVars{main_~x~0=v_main_~x~0_3512} AuxVars[] AssignedVars[] [2021-05-03 00:12:39,650 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:39,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:39,698 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:39,737 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3514 1000000) (<= 50000 v_main_~x~0_3514)) InVars {main_~x~0=v_main_~x~0_3514} OutVars{main_~x~0=v_main_~x~0_3514} AuxVars[] AssignedVars[] [2021-05-03 00:12:39,739 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:39,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,767 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:39,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:39,847 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:39,911 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,582 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-03 00:12:42,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:42,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:44,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:44,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374225339] [2021-05-03 00:12:44,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1374225339] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:44,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:44,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:12:44,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570898656] [2021-05-03 00:12:44,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:12:44,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:44,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:12:44,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=3865, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:12:44,660 INFO L87 Difference]: Start difference. First operand 244 states and 247 transitions. Second operand has 82 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 81 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:56,380 INFO L93 Difference]: Finished difference Result 362 states and 374 transitions. [2021-05-03 00:12:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:12:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 81 states have internal predecessors, (116), 2 states have call successors, (3), 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 243 [2021-05-03 00:12:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:56,382 INFO L225 Difference]: With dead ends: 362 [2021-05-03 00:12:56,382 INFO L226 Difference]: Without dead ends: 250 [2021-05-03 00:12:56,383 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7574 ImplicationChecksByTransitivity, 12857.1ms TimeCoverageRelationStatistics Valid=8325, Invalid=17435, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:12:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-05-03 00:12:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-05-03 00:12:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.0163265306122449) internal successors, (249), 245 states have internal predecessors, (249), 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-03 00:12:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 253 transitions. [2021-05-03 00:12:56,397 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 253 transitions. Word has length 243 [2021-05-03 00:12:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:56,397 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 253 transitions. [2021-05-03 00:12:56,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 81 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 253 transitions. [2021-05-03 00:12:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-05-03 00:12:56,398 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:56,398 INFO L523 BasicCegarLoop]: trace histogram [95, 63, 47, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:56,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-05-03 00:12:56,399 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -324108561, now seen corresponding path program 78 times [2021-05-03 00:12:56,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:56,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818344042] [2021-05-03 00:12:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:56,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3611 999999) (<= 50000 v_main_~x~0_3611)) InVars {main_~x~0=v_main_~x~0_3611} OutVars{main_~x~0=v_main_~x~0_3611} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,411 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:56,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:56,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:56,502 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:56,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3613 50000) (< v_main_~x~0_3613 999999)) InVars {main_~x~0=v_main_~x~0_3613} OutVars{main_~x~0=v_main_~x~0_3613} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,558 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:56,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,596 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:56,625 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:56,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3615 50000) InVars {main_~x~0=v_main_~x~0_3615} OutVars{main_~x~0=v_main_~x~0_3615} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,630 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:56,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,667 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:56,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3617) (< v_main_~x~0_3617 1000000)) InVars {main_~x~0=v_main_~x~0_3617} OutVars{main_~x~0=v_main_~x~0_3617} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,701 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:56,735 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:56,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:56,794 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:56,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,697 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-03 00:12:59,700 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:08,606 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:08,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818344042] [2021-05-03 00:13:08,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1818344042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:08,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:08,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [115] imperfect sequences [] total 115 [2021-05-03 00:13:08,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156581078] [2021-05-03 00:13:08,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2021-05-03 00:13:08,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:08,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2021-05-03 00:13:08,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1430, Invalid=12376, Unknown=0, NotChecked=0, Total=13806 [2021-05-03 00:13:08,608 INFO L87 Difference]: Start difference. First operand 250 states and 253 transitions. Second operand has 115 states, 115 states have (on average 1.608695652173913) internal successors, (185), 114 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:35,050 INFO L93 Difference]: Finished difference Result 370 states and 377 transitions. [2021-05-03 00:13:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:13:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 1.608695652173913) internal successors, (185), 114 states have internal predecessors, (185), 2 states have call successors, (3), 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 249 [2021-05-03 00:13:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:35,053 INFO L225 Difference]: With dead ends: 370 [2021-05-03 00:13:35,053 INFO L226 Difference]: Without dead ends: 252 [2021-05-03 00:13:35,055 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 123 SyntacticMatches, 12 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6045 ImplicationChecksByTransitivity, 21840.9ms TimeCoverageRelationStatistics Valid=1751, Invalid=31191, Unknown=0, NotChecked=0, Total=32942 [2021-05-03 00:13:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-05-03 00:13:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2021-05-03 00:13:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.0161943319838056) internal successors, (251), 247 states have internal predecessors, (251), 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-03 00:13:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 255 transitions. [2021-05-03 00:13:35,069 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 255 transitions. Word has length 249 [2021-05-03 00:13:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:35,069 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 255 transitions. [2021-05-03 00:13:35,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 115 states, 115 states have (on average 1.608695652173913) internal successors, (185), 114 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2021-05-03 00:13:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-05-03 00:13:35,070 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:35,070 INFO L523 BasicCegarLoop]: trace histogram [96, 64, 47, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:35,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-05-03 00:13:35,070 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash -894931764, now seen corresponding path program 79 times [2021-05-03 00:13:35,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:35,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857034229] [2021-05-03 00:13:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:35,081 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3685 999999) (<= 50000 v_main_~x~0_3685)) InVars {main_~x~0=v_main_~x~0_3685} OutVars{main_~x~0=v_main_~x~0_3685} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,083 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:35,085 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:35,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:35,168 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:35,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3687 50000) (< v_main_~x~0_3687 999999)) InVars {main_~x~0=v_main_~x~0_3687} OutVars{main_~x~0=v_main_~x~0_3687} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,219 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:35,232 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,242 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:35,258 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:35,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:35,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3689 50000) InVars {main_~x~0=v_main_~x~0_3689} OutVars{main_~x~0=v_main_~x~0_3689} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,294 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:35,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:35,337 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:35,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3691 1000000) (<= 50000 v_main_~x~0_3691)) InVars {main_~x~0=v_main_~x~0_3691} OutVars{main_~x~0=v_main_~x~0_3691} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,376 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:35,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:35,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:35,471 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:35,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:38,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:38,740 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-03 00:13:38,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:48,692 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:48,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857034229] [2021-05-03 00:13:48,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1857034229] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:48,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:48,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2021-05-03 00:13:48,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092281093] [2021-05-03 00:13:48,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2021-05-03 00:13:48,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-05-03 00:13:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=12609, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:13:48,694 INFO L87 Difference]: Start difference. First operand 252 states and 255 transitions. Second operand has 116 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 115 states have internal predecessors, (187), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:18,762 INFO L93 Difference]: Finished difference Result 372 states and 379 transitions. [2021-05-03 00:14:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:14:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 115 states have internal predecessors, (187), 2 states have call successors, (3), 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 251 [2021-05-03 00:14:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:18,765 INFO L225 Difference]: With dead ends: 372 [2021-05-03 00:14:18,765 INFO L226 Difference]: Without dead ends: 254 [2021-05-03 00:14:18,766 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 123 SyntacticMatches, 13 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 24564.0ms TimeCoverageRelationStatistics Valid=1759, Invalid=31913, Unknown=0, NotChecked=0, Total=33672 [2021-05-03 00:14:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-05-03 00:14:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-05-03 00:14:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.0160642570281124) internal successors, (253), 249 states have internal predecessors, (253), 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-03 00:14:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 257 transitions. [2021-05-03 00:14:18,781 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 257 transitions. Word has length 251 [2021-05-03 00:14:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:18,781 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 257 transitions. [2021-05-03 00:14:18,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 116 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 115 states have internal predecessors, (187), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 257 transitions. [2021-05-03 00:14:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-05-03 00:14:18,782 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:18,782 INFO L523 BasicCegarLoop]: trace histogram [97, 65, 47, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:18,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-05-03 00:14:18,782 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 299784041, now seen corresponding path program 80 times [2021-05-03 00:14:18,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:18,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453944709] [2021-05-03 00:14:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:18,792 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3760) (< v_main_~x~0_3760 999999)) InVars {main_~x~0=v_main_~x~0_3760} OutVars{main_~x~0=v_main_~x~0_3760} AuxVars[] AssignedVars[] [2021-05-03 00:14:18,795 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:18,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:18,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:18,885 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:18,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3762 999999) (< v_main_~x~0_3762 50000)) InVars {main_~x~0=v_main_~x~0_3762} OutVars{main_~x~0=v_main_~x~0_3762} AuxVars[] AssignedVars[] [2021-05-03 00:14:18,938 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:18,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:18,977 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:19,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:19,007 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3764 50000) InVars {main_~x~0=v_main_~x~0_3764} OutVars{main_~x~0=v_main_~x~0_3764} AuxVars[] AssignedVars[] [2021-05-03 00:14:19,009 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:19,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:19,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:19,047 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:19,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3766 1000000) (<= 50000 v_main_~x~0_3766)) InVars {main_~x~0=v_main_~x~0_3766} OutVars{main_~x~0=v_main_~x~0_3766} AuxVars[] AssignedVars[] [2021-05-03 00:14:19,082 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:19,084 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:19,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:19,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:19,108 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:19,171 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:19,224 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:22,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:22,479 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-03 00:14:22,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:29,220 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:29,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453944709] [2021-05-03 00:14:29,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1453944709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:29,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:29,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [117] imperfect sequences [] total 117 [2021-05-03 00:14:29,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003498139] [2021-05-03 00:14:29,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2021-05-03 00:14:29,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2021-05-03 00:14:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4648, Invalid=9394, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:14:29,222 INFO L87 Difference]: Start difference. First operand 254 states and 257 transitions. Second operand has 117 states, 117 states have (on average 1.6153846153846154) internal successors, (189), 116 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:00,193 INFO L93 Difference]: Finished difference Result 375 states and 383 transitions. [2021-05-03 00:15:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-05-03 00:15:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 1.6153846153846154) internal successors, (189), 116 states have internal predecessors, (189), 2 states have call successors, (3), 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 253 [2021-05-03 00:15:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:00,197 INFO L225 Difference]: With dead ends: 375 [2021-05-03 00:15:00,197 INFO L226 Difference]: Without dead ends: 257 [2021-05-03 00:15:00,199 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16723 ImplicationChecksByTransitivity, 27627.3ms TimeCoverageRelationStatistics Valid=13763, Invalid=40293, Unknown=0, NotChecked=0, Total=54056 [2021-05-03 00:15:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-03 00:15:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2021-05-03 00:15:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.0158730158730158) internal successors, (256), 252 states have internal predecessors, (256), 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-03 00:15:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 260 transitions. [2021-05-03 00:15:00,214 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 260 transitions. Word has length 253 [2021-05-03 00:15:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:00,214 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 260 transitions. [2021-05-03 00:15:00,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 117 states, 117 states have (on average 1.6153846153846154) internal successors, (189), 116 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 260 transitions. [2021-05-03 00:15:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-05-03 00:15:00,223 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:00,223 INFO L523 BasicCegarLoop]: trace histogram [98, 66, 48, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:00,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-05-03 00:15:00,223 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 123473245, now seen corresponding path program 81 times [2021-05-03 00:15:00,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:00,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587748435] [2021-05-03 00:15:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:00,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3836) (< v_main_~x~0_3836 999999)) InVars {main_~x~0=v_main_~x~0_3836} OutVars{main_~x~0=v_main_~x~0_3836} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,253 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:00,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:00,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:00,365 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:00,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3838 50000) (< v_main_~x~0_3838 999999)) InVars {main_~x~0=v_main_~x~0_3838} OutVars{main_~x~0=v_main_~x~0_3838} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,434 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:00,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:00,480 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:00,512 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:00,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3840 50000) InVars {main_~x~0=v_main_~x~0_3840} OutVars{main_~x~0=v_main_~x~0_3840} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,518 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:00,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:00,563 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:00,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3842 1000000) (<= 50000 v_main_~x~0_3842)) InVars {main_~x~0=v_main_~x~0_3842} OutVars{main_~x~0=v_main_~x~0_3842} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,601 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:00,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:00,631 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:00,703 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:00,758 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:04,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:04,520 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-03 00:15:04,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:04,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:07,783 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:07,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587748435] [2021-05-03 00:15:07,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587748435] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:07,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:07,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-03 00:15:07,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431106917] [2021-05-03 00:15:07,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-03 00:15:07,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-03 00:15:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3129, Invalid=4353, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:15:07,785 INFO L87 Difference]: Start difference. First operand 257 states and 260 transitions. Second operand has 87 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 86 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:26,079 INFO L93 Difference]: Finished difference Result 382 states and 394 transitions. [2021-05-03 00:15:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-03 00:15:26,083 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 86 states have internal predecessors, (123), 2 states have call successors, (3), 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 256 [2021-05-03 00:15:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:26,083 INFO L225 Difference]: With dead ends: 382 [2021-05-03 00:15:26,083 INFO L226 Difference]: Without dead ends: 263 [2021-05-03 00:15:26,085 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8566 ImplicationChecksByTransitivity, 19353.6ms TimeCoverageRelationStatistics Valid=9381, Invalid=19689, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:15:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-05-03 00:15:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-05-03 00:15:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.0155038759689923) internal successors, (262), 258 states have internal predecessors, (262), 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-03 00:15:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2021-05-03 00:15:26,101 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 256 [2021-05-03 00:15:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:26,101 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2021-05-03 00:15:26,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 86 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2021-05-03 00:15:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-05-03 00:15:26,102 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:26,102 INFO L523 BasicCegarLoop]: trace histogram [100, 66, 50, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:26,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-05-03 00:15:26,102 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash -688966969, now seen corresponding path program 82 times [2021-05-03 00:15:26,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:26,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215018183] [2021-05-03 00:15:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:26,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3944) (< v_main_~x~0_3944 999999)) InVars {main_~x~0=v_main_~x~0_3944} OutVars{main_~x~0=v_main_~x~0_3944} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,118 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:26,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:26,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:26,252 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:26,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3946 999999) (< v_main_~x~0_3946 50000)) InVars {main_~x~0=v_main_~x~0_3946} OutVars{main_~x~0=v_main_~x~0_3946} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,319 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:26,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,377 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:26,421 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:26,425 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3948 50000) InVars {main_~x~0=v_main_~x~0_3948} OutVars{main_~x~0=v_main_~x~0_3948} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,427 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:26,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,482 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:26,523 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3950) (< v_main_~x~0_3950 1000000)) InVars {main_~x~0=v_main_~x~0_3950} OutVars{main_~x~0=v_main_~x~0_3950} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,525 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:26,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:26,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:26,647 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:26,729 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,486 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-03 00:15:31,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:41,343 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:41,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215018183] [2021-05-03 00:15:41,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1215018183] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:41,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:41,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [121] imperfect sequences [] total 121 [2021-05-03 00:15:41,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124789232] [2021-05-03 00:15:41,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2021-05-03 00:15:41,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2021-05-03 00:15:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4993, Invalid=10259, Unknown=0, NotChecked=0, Total=15252 [2021-05-03 00:15:41,346 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand has 121 states, 121 states have (on average 1.603305785123967) internal successors, (194), 120 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)