/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:10:59,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:10:59,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:10:59,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:10:59,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:10:59,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:10:59,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:10:59,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:10:59,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:10:59,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:10:59,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:10:59,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:10:59,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:10:59,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:10:59,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:10:59,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:10:59,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:10:59,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:10:59,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:10:59,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:10:59,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:10:59,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:10:59,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:10:59,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:10:59,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:10:59,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:10:59,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:10:59,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:10:59,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:10:59,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:10:59,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:10:59,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:10:59,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:10:59,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:10:59,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:10:59,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:10:59,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:10:59,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:10:59,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:10:59,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:10:59,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:10:59,935 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:10:59,942 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:10:59,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:10:59,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:10:59,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:10:59,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:10:59,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:10:59,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:10:59,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:10:59,946 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:10:59,946 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:11:00,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:11:00,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:11:00,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:11:00,249 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:11:00,252 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:11:00,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2021-05-03 00:11:00,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19104042f/cc5e9f72f92741c893c45bf11967a6d3/FLAG5029c1934 [2021-05-03 00:11:00,645 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:11:00,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2021-05-03 00:11:00,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19104042f/cc5e9f72f92741c893c45bf11967a6d3/FLAG5029c1934 [2021-05-03 00:11:00,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19104042f/cc5e9f72f92741c893c45bf11967a6d3 [2021-05-03 00:11:00,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:11:00,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:11:00,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:11:00,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:11:00,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:11:00,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3837aad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00, skipping insertion in model container [2021-05-03 00:11:00,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:11:00,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:11:00,827 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_6.c[318,331] [2021-05-03 00:11:00,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:11:00,846 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:11:00,886 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_6.c[318,331] [2021-05-03 00:11:00,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:11:00,899 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:11:00,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00 WrapperNode [2021-05-03 00:11:00,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:11:00,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:11:00,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:11:00,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:11:00,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (1/1) ... [2021-05-03 00:11:00,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:11:00,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:11:00,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:11:00,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:11:00,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (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:11:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:11:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:11:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:11:01,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:11:01,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:11:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:11:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:11:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:11:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:11:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:11:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:11:01,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:11:01,239 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:11:01,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:11:01 BoogieIcfgContainer [2021-05-03 00:11:01,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:11:01,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:11:01,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:11:01,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:11:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:11:00" (1/3) ... [2021-05-03 00:11:01,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288b7f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:11:01, skipping insertion in model container [2021-05-03 00:11:01,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:00" (2/3) ... [2021-05-03 00:11:01,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288b7f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:11:01, skipping insertion in model container [2021-05-03 00:11:01,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:11:01" (3/3) ... [2021-05-03 00:11:01,246 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_6.c [2021-05-03 00:11:01,267 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:11:01,269 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:11:01,280 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:11:01,297 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:11:01,297 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:11:01,297 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:11:01,297 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:11:01,298 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:11:01,298 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:11:01,298 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:11:01,298 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:11:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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:11:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:11:01,333 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:01,333 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:01,334 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1440262230, now seen corresponding path program 1 times [2021-05-03 00:11:01,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:01,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650208430] [2021-05-03 00:11:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:01,395 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:11:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:01,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:01,555 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:01,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650208430] [2021-05-03 00:11:01,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1650208430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:01,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:01,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:11:01,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019624344] [2021-05-03 00:11:01,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:11:01,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:11:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:11:01,570 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:01,690 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2021-05-03 00:11:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:11:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:11:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:01,696 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:11:01,696 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:11:01,698 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:11:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:11:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-03 00:11:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-05-03 00:11:01,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-05-03 00:11:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:01,733 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-05-03 00:11:01,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-05-03 00:11:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-03 00:11:01,735 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:01,735 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:01,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:11:01,735 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash -273622713, now seen corresponding path program 1 times [2021-05-03 00:11:01,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:01,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241880572] [2021-05-03 00:11:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:01,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_15 500000) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-03 00:11:01,786 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:01,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:01,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:01,850 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:01,867 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:01,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:01,933 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:01,971 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:01,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241880572] [2021-05-03 00:11:01,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [241880572] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:01,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:01,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:11:01,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217961773] [2021-05-03 00:11:01,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:11:01,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:11:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:11:01,973 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states 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:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:02,093 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-05-03 00:11:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:11:02,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2021-05-03 00:11:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:02,094 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:11:02,094 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:11:02,095 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 115.7ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:11:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:11:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-03 00:11:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-05-03 00:11:02,100 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2021-05-03 00:11:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:02,100 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-05-03 00:11:02,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states 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:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2021-05-03 00:11:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:11:02,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:02,101 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:02,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:11:02,101 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -119511132, now seen corresponding path program 2 times [2021-05-03 00:11:02,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:02,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847867858] [2021-05-03 00:11:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:02,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_19 500000) (< v_main_~x~0_19 999999)) InVars {main_~x~0=v_main_~x~0_19} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,112 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:02,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,140 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:02,162 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_21 500000) InVars {main_~x~0=v_main_~x~0_21} OutVars{main_~x~0=v_main_~x~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,172 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:02,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,191 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,211 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:02,222 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:02,306 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:02,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847867858] [2021-05-03 00:11:02,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1847867858] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:02,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:02,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:11:02,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638072363] [2021-05-03 00:11:02,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:11:02,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:11:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:11:02,308 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states 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:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:02,422 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2021-05-03 00:11:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:11:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2021-05-03 00:11:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:02,424 INFO L225 Difference]: With dead ends: 30 [2021-05-03 00:11:02,424 INFO L226 Difference]: Without dead ends: 21 [2021-05-03 00:11:02,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:11:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-03 00:11:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-03 00:11:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:11:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-05-03 00:11:02,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2021-05-03 00:11:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:02,434 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-05-03 00:11:02,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states 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:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2021-05-03 00:11:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:11:02,435 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:02,435 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:02,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:11:02,436 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1952830145, now seen corresponding path program 3 times [2021-05-03 00:11:02,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:02,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1495096035] [2021-05-03 00:11:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:02,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_26 999999) (< v_main_~x~0_26 500000)) InVars {main_~x~0=v_main_~x~0_26} OutVars{main_~x~0=v_main_~x~0_26} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,454 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:02,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,476 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:02,486 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,488 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_28 500000) InVars {main_~x~0=v_main_~x~0_28} OutVars{main_~x~0=v_main_~x~0_28} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,491 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:02,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,512 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:02,523 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,567 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:02,617 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:02,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1495096035] [2021-05-03 00:11:02,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1495096035] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:02,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:02,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:11:02,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586491343] [2021-05-03 00:11:02,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:11:02,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:11:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:11:02,619 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:02,753 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-05-03 00:11:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:11:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-03 00:11:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:02,754 INFO L225 Difference]: With dead ends: 32 [2021-05-03 00:11:02,754 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:11:02,754 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 140.1ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:11:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:11:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-03 00:11:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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:11:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-05-03 00:11:02,758 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2021-05-03 00:11:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:02,758 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-05-03 00:11:02,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2021-05-03 00:11:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:11:02,759 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:02,759 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:02,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:11:02,759 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 607971998, now seen corresponding path program 4 times [2021-05-03 00:11:02,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:02,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191829310] [2021-05-03 00:11:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:02,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_34 999999) (< v_main_~x~0_34 500000)) InVars {main_~x~0=v_main_~x~0_34} OutVars{main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,768 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:02,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,789 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:02,799 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,801 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_36 500000) InVars {main_~x~0=v_main_~x~0_36} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:11:02,803 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:02,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:02,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:02,823 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:02,832 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:02,917 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:02,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191829310] [2021-05-03 00:11:02,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1191829310] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:02,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:02,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:11:02,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45109189] [2021-05-03 00:11:02,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:11:02,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:02,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:11:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:11:02,918 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:11:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:03,090 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-05-03 00:11:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:11:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:11:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:03,092 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:11:03,092 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:11:03,092 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 148.7ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:11:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:11:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-03 00:11:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-05-03 00:11:03,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2021-05-03 00:11:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:03,109 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-05-03 00:11:03,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:11:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-05-03 00:11:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:11:03,110 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:03,110 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:03,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:11:03,110 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash 984448827, now seen corresponding path program 5 times [2021-05-03 00:11:03,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:03,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772997797] [2021-05-03 00:11:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:03,117 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_43 999999) (< v_main_~x~0_43 500000)) InVars {main_~x~0=v_main_~x~0_43} OutVars{main_~x~0=v_main_~x~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,120 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:03,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:03,141 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:03,156 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:03,160 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_45 500000) InVars {main_~x~0=v_main_~x~0_45} OutVars{main_~x~0=v_main_~x~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,164 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:03,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:03,182 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:03,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:03,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:03,255 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:03,309 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:03,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772997797] [2021-05-03 00:11:03,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1772997797] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:03,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:03,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:11:03,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690952811] [2021-05-03 00:11:03,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:11:03,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:03,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:11:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:11:03,311 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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:11:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:03,534 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-05-03 00:11:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:11:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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:11:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:03,535 INFO L225 Difference]: With dead ends: 36 [2021-05-03 00:11:03,535 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:11:03,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 172.2ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:11:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:11:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-03 00:11:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-05-03 00:11:03,540 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2021-05-03 00:11:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:03,540 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-05-03 00:11:03,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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:11:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-05-03 00:11:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:11:03,540 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:03,540 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:03,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:11:03,541 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2001428632, now seen corresponding path program 6 times [2021-05-03 00:11:03,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:03,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566362238] [2021-05-03 00:11:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:03,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_53 999999) (< v_main_~x~0_53 500000)) InVars {main_~x~0=v_main_~x~0_53} OutVars{main_~x~0=v_main_~x~0_53} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,549 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:03,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:03,567 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:03,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:03,579 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_55 500000) InVars {main_~x~0=v_main_~x~0_55} OutVars{main_~x~0=v_main_~x~0_55} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,580 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:03,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:03,602 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:03,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:03,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:03,655 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:03,739 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:03,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [566362238] [2021-05-03 00:11:03,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [566362238] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:03,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:03,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:11:03,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649401309] [2021-05-03 00:11:03,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:11:03,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:11:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:11:03,741 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:03,973 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-05-03 00:11:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:11:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-03 00:11:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:03,974 INFO L225 Difference]: With dead ends: 38 [2021-05-03 00:11:03,974 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:11:03,975 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 208.8ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:11:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:11:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-03 00:11:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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:11:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-05-03 00:11:03,979 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2021-05-03 00:11:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:03,979 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-05-03 00:11:03,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2021-05-03 00:11:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:11:03,980 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:03,980 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:03,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:11:03,980 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 66477749, now seen corresponding path program 7 times [2021-05-03 00:11:03,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:03,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265875590] [2021-05-03 00:11:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:03,985 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_64 999999) (< v_main_~x~0_64 500000)) InVars {main_~x~0=v_main_~x~0_64} OutVars{main_~x~0=v_main_~x~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,986 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:03,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:04,003 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:04,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:04,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_66 500000) InVars {main_~x~0=v_main_~x~0_66} OutVars{main_~x~0=v_main_~x~0_66} AuxVars[] AssignedVars[] [2021-05-03 00:11:04,016 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:04,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:04,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:04,034 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:04,043 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,079 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:04,155 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:04,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265875590] [2021-05-03 00:11:04,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [265875590] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:04,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:04,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:11:04,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007068929] [2021-05-03 00:11:04,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:11:04,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:11:04,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:11:04,157 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states 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:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:04,430 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-05-03 00:11:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:11:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 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 25 [2021-05-03 00:11:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:04,431 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:11:04,431 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:11:04,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 240.5ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:11:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:11:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-03 00:11:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-05-03 00:11:04,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2021-05-03 00:11:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:04,436 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-05-03 00:11:04,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states 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:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2021-05-03 00:11:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:11:04,436 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:04,436 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:04,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:11:04,436 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 299518354, now seen corresponding path program 8 times [2021-05-03 00:11:04,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:04,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692630163] [2021-05-03 00:11:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:04,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_76 500000) (< v_main_~x~0_76 999999)) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:11:04,443 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:04,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:04,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:04,459 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:04,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:04,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_78 500000) InVars {main_~x~0=v_main_~x~0_78} OutVars{main_~x~0=v_main_~x~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:11:04,471 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:04,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:04,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:04,489 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:04,498 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,531 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:04,624 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:04,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692630163] [2021-05-03 00:11:04,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [692630163] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:04,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:04,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:11:04,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420622901] [2021-05-03 00:11:04,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:11:04,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:11:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:11:04,626 INFO L87 Difference]: Start difference. First operand 31 states and 33 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:11:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:04,965 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-05-03 00:11:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:11:04,966 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:11:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:04,966 INFO L225 Difference]: With dead ends: 42 [2021-05-03 00:11:04,966 INFO L226 Difference]: Without dead ends: 33 [2021-05-03 00:11:04,967 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 296.4ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:11:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-03 00:11:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-03 00:11:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2021-05-03 00:11:04,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2021-05-03 00:11:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:04,971 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-05-03 00:11:04,971 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:11:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2021-05-03 00:11:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:11:04,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:04,972 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:04,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:11:04,972 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash 913240367, now seen corresponding path program 9 times [2021-05-03 00:11:04,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:04,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666263793] [2021-05-03 00:11:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:04,976 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_89 999999) (< v_main_~x~0_89 500000)) InVars {main_~x~0=v_main_~x~0_89} OutVars{main_~x~0=v_main_~x~0_89} AuxVars[] AssignedVars[] [2021-05-03 00:11:04,978 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:04,979 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:04,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:04,993 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:05,001 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:05,003 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_91 500000) InVars {main_~x~0=v_main_~x~0_91} OutVars{main_~x~0=v_main_~x~0_91} AuxVars[] AssignedVars[] [2021-05-03 00:11:05,005 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:05,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:05,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:05,021 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:05,030 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:05,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:05,061 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:05,187 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:05,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666263793] [2021-05-03 00:11:05,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [666263793] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:05,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:05,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:11:05,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031950414] [2021-05-03 00:11:05,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:11:05,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:11:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:11:05,188 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:05,562 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2021-05-03 00:11:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:11:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-03 00:11:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:05,563 INFO L225 Difference]: With dead ends: 44 [2021-05-03 00:11:05,563 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:11:05,563 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 330.8ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:11:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:11:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:11:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-05-03 00:11:05,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2021-05-03 00:11:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:05,567 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-05-03 00:11:05,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2021-05-03 00:11:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:11:05,568 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:05,568 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:05,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:11:05,568 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2005391988, now seen corresponding path program 10 times [2021-05-03 00:11:05,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:05,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284172863] [2021-05-03 00:11:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:05,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_103 500000) (< v_main_~x~0_103 999999)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:11:05,574 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:05,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:05,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:05,601 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:05,610 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:05,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_105 500000) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:11:05,615 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:05,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:05,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:05,631 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:05,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:05,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:05,678 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:05,786 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:05,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284172863] [2021-05-03 00:11:05,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [284172863] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:05,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:05,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:11:05,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558418211] [2021-05-03 00:11:05,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:11:05,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:05,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:11:05,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:11:05,787 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states 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:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:06,210 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-05-03 00:11:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:11:06,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 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 31 [2021-05-03 00:11:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:06,211 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:11:06,211 INFO L226 Difference]: Without dead ends: 37 [2021-05-03 00:11:06,211 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 336.5ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:11:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-03 00:11:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-03 00:11:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-05-03 00:11:06,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 31 [2021-05-03 00:11:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:06,216 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-05-03 00:11:06,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states 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:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-05-03 00:11:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-03 00:11:06,216 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:06,216 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:06,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:11:06,216 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2097526441, now seen corresponding path program 11 times [2021-05-03 00:11:06,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:06,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711350169] [2021-05-03 00:11:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:06,222 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_118 999999) (< v_main_~x~0_118 500000)) InVars {main_~x~0=v_main_~x~0_118} OutVars{main_~x~0=v_main_~x~0_118} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,223 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:06,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,238 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:06,247 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:06,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_120 500000) InVars {main_~x~0=v_main_~x~0_120} OutVars{main_~x~0=v_main_~x~0_120} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,250 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:06,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,266 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:06,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:06,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:06,326 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:06,462 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:06,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711350169] [2021-05-03 00:11:06,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [711350169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:06,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:06,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:11:06,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397801673] [2021-05-03 00:11:06,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:11:06,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:06,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:11:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:11:06,465 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states 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:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:06,935 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2021-05-03 00:11:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:11:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 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 33 [2021-05-03 00:11:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:06,936 INFO L225 Difference]: With dead ends: 48 [2021-05-03 00:11:06,936 INFO L226 Difference]: Without dead ends: 39 [2021-05-03 00:11:06,937 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 390.3ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:11:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-03 00:11:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-03 00:11:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-05-03 00:11:06,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2021-05-03 00:11:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:06,941 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-05-03 00:11:06,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states 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:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-05-03 00:11:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:11:06,941 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:06,941 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:06,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:11:06,941 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:06,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2072808314, now seen corresponding path program 12 times [2021-05-03 00:11:06,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:06,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90199050] [2021-05-03 00:11:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:06,945 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_134 500000) (< v_main_~x~0_134 999999)) InVars {main_~x~0=v_main_~x~0_134} OutVars{main_~x~0=v_main_~x~0_134} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,947 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:06,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,962 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:06,970 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:06,973 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_136 500000) InVars {main_~x~0=v_main_~x~0_136} OutVars{main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,974 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:06,980 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,990 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:06,999 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:07,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:07,173 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:07,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90199050] [2021-05-03 00:11:07,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [90199050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:07,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:07,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:11:07,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472802868] [2021-05-03 00:11:07,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:11:07,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:07,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:11:07,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:11:07,175 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:07,692 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2021-05-03 00:11:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:11:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-03 00:11:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:07,693 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:11:07,693 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:11:07,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 448.7ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:11:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:11:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-03 00:11:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2021-05-03 00:11:07,698 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2021-05-03 00:11:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:07,698 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2021-05-03 00:11:07,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2021-05-03 00:11:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:11:07,698 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:07,698 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:07,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:11:07,699 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1734946595, now seen corresponding path program 13 times [2021-05-03 00:11:07,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:07,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800177763] [2021-05-03 00:11:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:07,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_151 500000) (< v_main_~x~0_151 999999)) InVars {main_~x~0=v_main_~x~0_151} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[] [2021-05-03 00:11:07,704 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:07,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:07,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:07,720 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:07,729 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:07,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_153 500000) InVars {main_~x~0=v_main_~x~0_153} OutVars{main_~x~0=v_main_~x~0_153} AuxVars[] AssignedVars[] [2021-05-03 00:11:07,732 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:07,732 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:07,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:07,749 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:07,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:07,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:07,791 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:07,929 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:07,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800177763] [2021-05-03 00:11:07,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [800177763] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:07,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:07,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:11:07,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893548246] [2021-05-03 00:11:07,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:11:07,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:11:07,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:11:07,930 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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:11:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:08,492 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2021-05-03 00:11:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:11:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 37 [2021-05-03 00:11:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:08,493 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:11:08,493 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:11:08,493 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 442.3ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:11:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:11:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-03 00:11:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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:11:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2021-05-03 00:11:08,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 37 [2021-05-03 00:11:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-05-03 00:11:08,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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:11:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2021-05-03 00:11:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:11:08,498 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:08,498 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:08,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-03 00:11:08,498 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1675277952, now seen corresponding path program 14 times [2021-05-03 00:11:08,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:08,498 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624887610] [2021-05-03 00:11:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:08,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_169 999999) (< v_main_~x~0_169 500000)) InVars {main_~x~0=v_main_~x~0_169} OutVars{main_~x~0=v_main_~x~0_169} AuxVars[] AssignedVars[] [2021-05-03 00:11:08,503 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:08,509 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:08,512 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:08,517 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:08,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:08,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_171 500000) InVars {main_~x~0=v_main_~x~0_171} OutVars{main_~x~0=v_main_~x~0_171} AuxVars[] AssignedVars[] [2021-05-03 00:11:08,528 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:08,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:08,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:08,543 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:08,551 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:08,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:08,753 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:08,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624887610] [2021-05-03 00:11:08,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1624887610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:08,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:08,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:11:08,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872254633] [2021-05-03 00:11:08,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:11:08,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:08,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:11:08,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:11:08,755 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:09,335 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2021-05-03 00:11:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:11:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2021-05-03 00:11:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:09,336 INFO L225 Difference]: With dead ends: 54 [2021-05-03 00:11:09,336 INFO L226 Difference]: Without dead ends: 45 [2021-05-03 00:11:09,337 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 470.4ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:11:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-03 00:11:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-03 00:11:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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:11:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-05-03 00:11:09,343 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 39 [2021-05-03 00:11:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:09,343 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-05-03 00:11:09,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2021-05-03 00:11:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:11:09,344 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:09,344 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:09,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:11:09,345 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 168286877, now seen corresponding path program 15 times [2021-05-03 00:11:09,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:09,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620321123] [2021-05-03 00:11:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:09,362 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_188 500000) (< v_main_~x~0_188 999999)) InVars {main_~x~0=v_main_~x~0_188} OutVars{main_~x~0=v_main_~x~0_188} AuxVars[] AssignedVars[] [2021-05-03 00:11:09,363 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:09,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:09,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:09,378 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:09,390 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:09,391 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_190 500000) InVars {main_~x~0=v_main_~x~0_190} OutVars{main_~x~0=v_main_~x~0_190} AuxVars[] AssignedVars[] [2021-05-03 00:11:09,393 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:09,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:09,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:09,410 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:09,417 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:09,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:09,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:09,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620321123] [2021-05-03 00:11:09,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1620321123] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:09,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:09,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:11:09,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424572676] [2021-05-03 00:11:09,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:11:09,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:11:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:11:09,659 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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:11:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:10,280 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2021-05-03 00:11:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:11:10,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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:11:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:10,281 INFO L225 Difference]: With dead ends: 56 [2021-05-03 00:11:10,281 INFO L226 Difference]: Without dead ends: 47 [2021-05-03 00:11:10,281 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 514.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:11:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-03 00:11:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-03 00:11:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 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:11:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-05-03 00:11:10,286 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 41 [2021-05-03 00:11:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:10,286 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-05-03 00:11:10,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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:11:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2021-05-03 00:11:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:11:10,287 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:10,287 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:10,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-03 00:11:10,287 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -646157446, now seen corresponding path program 16 times [2021-05-03 00:11:10,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:10,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177243631] [2021-05-03 00:11:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:10,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_208 500000) (< v_main_~x~0_208 999999)) InVars {main_~x~0=v_main_~x~0_208} OutVars{main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[] [2021-05-03 00:11:10,318 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:10,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:10,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:10,336 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:10,345 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:10,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_210 500000) InVars {main_~x~0=v_main_~x~0_210} OutVars{main_~x~0=v_main_~x~0_210} AuxVars[] AssignedVars[] [2021-05-03 00:11:10,352 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:10,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:10,356 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:10,367 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:10,375 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:10,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:10,417 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:10,607 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:10,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177243631] [2021-05-03 00:11:10,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177243631] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:10,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:10,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:11:10,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909849026] [2021-05-03 00:11:10,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:11:10,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:11:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:11:10,609 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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:11:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:11,259 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2021-05-03 00:11:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:11:11,259 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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:11:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:11,260 INFO L225 Difference]: With dead ends: 58 [2021-05-03 00:11:11,260 INFO L226 Difference]: Without dead ends: 49 [2021-05-03 00:11:11,261 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 551.0ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:11:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-03 00:11:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-03 00:11:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:11:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2021-05-03 00:11:11,265 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 43 [2021-05-03 00:11:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:11,265 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2021-05-03 00:11:11,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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:11:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2021-05-03 00:11:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-03 00:11:11,265 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:11,265 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:11,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:11:11,266 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1643103977, now seen corresponding path program 17 times [2021-05-03 00:11:11,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:11,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700861260] [2021-05-03 00:11:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:11,280 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_229 500000) (< v_main_~x~0_229 999999)) InVars {main_~x~0=v_main_~x~0_229} OutVars{main_~x~0=v_main_~x~0_229} AuxVars[] AssignedVars[] [2021-05-03 00:11:11,284 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:11,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:11,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:11,302 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:11,311 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:11,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_231 500000) InVars {main_~x~0=v_main_~x~0_231} OutVars{main_~x~0=v_main_~x~0_231} AuxVars[] AssignedVars[] [2021-05-03 00:11:11,317 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:11,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:11,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:11,332 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:11,340 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:11,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:11,375 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:11,568 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:11,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700861260] [2021-05-03 00:11:11,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [700861260] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:11,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:11,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:11:11,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142102450] [2021-05-03 00:11:11,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:11:11,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:11:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:11:11,569 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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:11:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:12,281 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2021-05-03 00:11:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:11:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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:11:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:12,282 INFO L225 Difference]: With dead ends: 60 [2021-05-03 00:11:12,282 INFO L226 Difference]: Without dead ends: 51 [2021-05-03 00:11:12,283 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 575.9ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:11:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-03 00:11:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-03 00:11:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-05-03 00:11:12,287 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 45 [2021-05-03 00:11:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:12,287 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-05-03 00:11:12,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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:11:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-05-03 00:11:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-03 00:11:12,288 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:12,288 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:12,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:11:12,289 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:12,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1931013260, now seen corresponding path program 18 times [2021-05-03 00:11:12,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:12,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208786208] [2021-05-03 00:11:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:12,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_251 500000) (< v_main_~x~0_251 999999)) InVars {main_~x~0=v_main_~x~0_251} OutVars{main_~x~0=v_main_~x~0_251} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,296 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:12,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:12,311 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:12,319 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:12,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_253 500000) InVars {main_~x~0=v_main_~x~0_253} OutVars{main_~x~0=v_main_~x~0_253} AuxVars[] AssignedVars[] [2021-05-03 00:11:12,322 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:12,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:12,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:12,338 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:12,347 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:12,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:12,398 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:12,610 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:12,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208786208] [2021-05-03 00:11:12,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [208786208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:12,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:12,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:11:12,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124491122] [2021-05-03 00:11:12,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:11:12,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:11:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:11:12,612 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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:11:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:13,398 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-05-03 00:11:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:11:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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:11:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:13,398 INFO L225 Difference]: With dead ends: 62 [2021-05-03 00:11:13,398 INFO L226 Difference]: Without dead ends: 53 [2021-05-03 00:11:13,399 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 628.9ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:11:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-03 00:11:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-03 00:11:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-05-03 00:11:13,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2021-05-03 00:11:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-05-03 00:11:13,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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:11:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-05-03 00:11:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:11:13,405 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:13,405 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:13,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:11:13,405 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 561040017, now seen corresponding path program 19 times [2021-05-03 00:11:13,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:13,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952596258] [2021-05-03 00:11:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:13,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_274 999999) (< v_main_~x~0_274 500000)) InVars {main_~x~0=v_main_~x~0_274} OutVars{main_~x~0=v_main_~x~0_274} AuxVars[] AssignedVars[] [2021-05-03 00:11:13,412 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:13,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:13,422 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:13,427 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:13,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:13,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_276 500000) InVars {main_~x~0=v_main_~x~0_276} OutVars{main_~x~0=v_main_~x~0_276} AuxVars[] AssignedVars[] [2021-05-03 00:11:13,449 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:13,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:13,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:13,467 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:13,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:13,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:13,742 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:13,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952596258] [2021-05-03 00:11:13,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [952596258] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:13,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:13,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:11:13,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588503265] [2021-05-03 00:11:13,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:11:13,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:11:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:11:13,744 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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:11:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:14,538 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-05-03 00:11:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:11:14,540 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 49 [2021-05-03 00:11:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:14,541 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:11:14,541 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:11:14,542 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 662.0ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:11:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:11:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-03 00:11:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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:11:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-03 00:11:14,546 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 49 [2021-05-03 00:11:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:14,546 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-03 00:11:14,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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:11:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-03 00:11:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-03 00:11:14,546 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:14,546 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:14,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-03 00:11:14,546 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1167511954, now seen corresponding path program 20 times [2021-05-03 00:11:14,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:14,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404445644] [2021-05-03 00:11:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:14,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_298 500000) (< v_main_~x~0_298 999999)) InVars {main_~x~0=v_main_~x~0_298} OutVars{main_~x~0=v_main_~x~0_298} AuxVars[] AssignedVars[] [2021-05-03 00:11:14,553 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:14,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:14,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:14,571 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:14,580 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:14,582 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_300 500000) InVars {main_~x~0=v_main_~x~0_300} OutVars{main_~x~0=v_main_~x~0_300} AuxVars[] AssignedVars[] [2021-05-03 00:11:14,583 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:14,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:14,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:14,602 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:14,610 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:14,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:14,911 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:14,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404445644] [2021-05-03 00:11:14,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [404445644] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:14,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:14,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:11:14,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726155866] [2021-05-03 00:11:14,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:11:14,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:11:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:11:14,912 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states 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:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:15,791 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2021-05-03 00:11:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:11:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 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 51 [2021-05-03 00:11:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:15,792 INFO L225 Difference]: With dead ends: 66 [2021-05-03 00:11:15,792 INFO L226 Difference]: Without dead ends: 57 [2021-05-03 00:11:15,793 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 739.6ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:11:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-03 00:11:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-03 00:11:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 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:11:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-03 00:11:15,796 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 51 [2021-05-03 00:11:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:15,796 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-03 00:11:15,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states 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:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-03 00:11:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:11:15,797 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:15,797 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:15,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:11:15,797 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -153612533, now seen corresponding path program 21 times [2021-05-03 00:11:15,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:15,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672263909] [2021-05-03 00:11:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:15,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_323 500000) (< v_main_~x~0_323 999999)) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_323} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,804 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:15,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:15,821 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:15,829 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:15,830 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_325 500000) InVars {main_~x~0=v_main_~x~0_325} OutVars{main_~x~0=v_main_~x~0_325} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,834 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:15,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:15,861 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:15,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:15,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:15,913 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:16,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:16,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672263909] [2021-05-03 00:11:16,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1672263909] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:16,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:16,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:11:16,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828465512] [2021-05-03 00:11:16,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:11:16,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:11:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:11:16,202 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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:11:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:17,164 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2021-05-03 00:11:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:11:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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:11:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:17,175 INFO L225 Difference]: With dead ends: 68 [2021-05-03 00:11:17,175 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:11:17,176 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 807.7ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:11:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:11:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-03 00:11:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-03 00:11:17,179 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 53 [2021-05-03 00:11:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:17,180 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-03 00:11:17,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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:11:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-03 00:11:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:11:17,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:17,181 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:17,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-03 00:11:17,181 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash -753845144, now seen corresponding path program 22 times [2021-05-03 00:11:17,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:17,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426776065] [2021-05-03 00:11:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:17,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_349 500000) (< v_main_~x~0_349 999999)) InVars {main_~x~0=v_main_~x~0_349} OutVars{main_~x~0=v_main_~x~0_349} AuxVars[] AssignedVars[] [2021-05-03 00:11:17,188 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:17,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:17,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:17,203 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:17,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:17,214 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_351 500000) InVars {main_~x~0=v_main_~x~0_351} OutVars{main_~x~0=v_main_~x~0_351} AuxVars[] AssignedVars[] [2021-05-03 00:11:17,216 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:17,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:17,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:17,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:17,244 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:17,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:17,274 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:17,562 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:17,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426776065] [2021-05-03 00:11:17,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [426776065] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:17,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:17,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:11:17,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911375102] [2021-05-03 00:11:17,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:11:17,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:17,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:11:17,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:11:17,564 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states 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:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:18,560 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-05-03 00:11:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:11:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 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:11:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:18,561 INFO L225 Difference]: With dead ends: 70 [2021-05-03 00:11:18,561 INFO L226 Difference]: Without dead ends: 61 [2021-05-03 00:11:18,562 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 834.0ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:11:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-03 00:11:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-03 00:11:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-03 00:11:18,565 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 55 [2021-05-03 00:11:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:18,566 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-03 00:11:18,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states 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:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-03 00:11:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-03 00:11:18,566 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:18,566 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:18,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-03 00:11:18,566 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2051766651, now seen corresponding path program 23 times [2021-05-03 00:11:18,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:18,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334703605] [2021-05-03 00:11:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:18,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_376 500000) (< v_main_~x~0_376 999999)) InVars {main_~x~0=v_main_~x~0_376} OutVars{main_~x~0=v_main_~x~0_376} AuxVars[] AssignedVars[] [2021-05-03 00:11:18,573 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:18,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:18,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:18,589 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:18,596 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:18,598 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_378 500000) InVars {main_~x~0=v_main_~x~0_378} OutVars{main_~x~0=v_main_~x~0_378} AuxVars[] AssignedVars[] [2021-05-03 00:11:18,599 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:18,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:18,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:18,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:18,622 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:18,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:18,656 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:18,959 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:18,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334703605] [2021-05-03 00:11:18,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [334703605] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:18,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:18,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:11:18,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938393366] [2021-05-03 00:11:18,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:11:18,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:11:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:11:18,961 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states 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:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:20,013 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2021-05-03 00:11:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:11:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 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 57 [2021-05-03 00:11:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:20,014 INFO L225 Difference]: With dead ends: 72 [2021-05-03 00:11:20,014 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:11:20,015 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 875.7ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:11:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:11:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-03 00:11:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 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:11:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-05-03 00:11:20,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 57 [2021-05-03 00:11:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:20,019 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-05-03 00:11:20,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states 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:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2021-05-03 00:11:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:11:20,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:20,019 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:20,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:11:20,019 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 481148258, now seen corresponding path program 24 times [2021-05-03 00:11:20,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:20,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705468275] [2021-05-03 00:11:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:20,023 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_404 999999) (< v_main_~x~0_404 500000)) InVars {main_~x~0=v_main_~x~0_404} OutVars{main_~x~0=v_main_~x~0_404} AuxVars[] AssignedVars[] [2021-05-03 00:11:20,024 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:20,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:20,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:20,039 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:20,047 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:20,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_406 500000) InVars {main_~x~0=v_main_~x~0_406} OutVars{main_~x~0=v_main_~x~0_406} AuxVars[] AssignedVars[] [2021-05-03 00:11:20,049 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:20,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:20,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:20,063 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:20,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:20,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:20,111 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:20,470 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:20,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705468275] [2021-05-03 00:11:20,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [705468275] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:20,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:20,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:11:20,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435867537] [2021-05-03 00:11:20,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:11:20,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:11:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:11:20,472 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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:11:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:21,604 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-05-03 00:11:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:11:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-03 00:11:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:21,605 INFO L225 Difference]: With dead ends: 74 [2021-05-03 00:11:21,605 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:11:21,606 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 978.4ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:11:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:11:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-03 00:11:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2021-05-03 00:11:21,609 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 59 [2021-05-03 00:11:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:21,610 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2021-05-03 00:11:21,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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:11:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2021-05-03 00:11:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:11:21,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:21,610 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:21,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:11:21,610 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash -634081025, now seen corresponding path program 25 times [2021-05-03 00:11:21,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:21,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942500668] [2021-05-03 00:11:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:21,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_433 999999) (< v_main_~x~0_433 500000)) InVars {main_~x~0=v_main_~x~0_433} OutVars{main_~x~0=v_main_~x~0_433} AuxVars[] AssignedVars[] [2021-05-03 00:11:21,624 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:21,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:21,633 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:21,639 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:21,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:21,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_435 500000) InVars {main_~x~0=v_main_~x~0_435} OutVars{main_~x~0=v_main_~x~0_435} AuxVars[] AssignedVars[] [2021-05-03 00:11:21,650 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:21,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:21,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:21,666 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:21,674 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:21,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:21,713 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:22,048 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:22,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942500668] [2021-05-03 00:11:22,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1942500668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:22,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:22,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:11:22,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544654319] [2021-05-03 00:11:22,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:11:22,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:11:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:11:22,049 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states 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:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:23,261 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-05-03 00:11:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:11:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 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:11:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:23,262 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:11:23,262 INFO L226 Difference]: Without dead ends: 67 [2021-05-03 00:11:23,262 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 978.6ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:11:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-03 00:11:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-03 00:11:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2021-05-03 00:11:23,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2021-05-03 00:11:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-05-03 00:11:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states 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:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2021-05-03 00:11:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-03 00:11:23,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:23,268 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:23,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-03 00:11:23,268 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1372402012, now seen corresponding path program 26 times [2021-05-03 00:11:23,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:23,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882131771] [2021-05-03 00:11:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:23,271 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_463 999999) (< v_main_~x~0_463 500000)) InVars {main_~x~0=v_main_~x~0_463} OutVars{main_~x~0=v_main_~x~0_463} AuxVars[] AssignedVars[] [2021-05-03 00:11:23,274 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:23,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:23,287 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:23,293 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:23,301 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:23,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_465 500000) InVars {main_~x~0=v_main_~x~0_465} OutVars{main_~x~0=v_main_~x~0_465} AuxVars[] AssignedVars[] [2021-05-03 00:11:23,303 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:23,309 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:23,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:23,318 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:23,327 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:23,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:23,364 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:23,722 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:23,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882131771] [2021-05-03 00:11:23,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1882131771] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:23,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:23,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:11:23,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848138032] [2021-05-03 00:11:23,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:11:23,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:11:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:11:23,723 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states 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:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:25,044 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2021-05-03 00:11:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:11:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 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 63 [2021-05-03 00:11:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:25,045 INFO L225 Difference]: With dead ends: 78 [2021-05-03 00:11:25,045 INFO L226 Difference]: Without dead ends: 69 [2021-05-03 00:11:25,046 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1041.8ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:11:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-03 00:11:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-03 00:11:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-05-03 00:11:25,050 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 63 [2021-05-03 00:11:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:25,050 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-05-03 00:11:25,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states 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:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-05-03 00:11:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:11:25,051 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:25,051 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:25,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:11:25,051 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1162284665, now seen corresponding path program 27 times [2021-05-03 00:11:25,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:25,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063121704] [2021-05-03 00:11:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:25,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_494 999999) (< v_main_~x~0_494 500000)) InVars {main_~x~0=v_main_~x~0_494} OutVars{main_~x~0=v_main_~x~0_494} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,056 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:25,063 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,067 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:25,072 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:25,081 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:25,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_496 500000) InVars {main_~x~0=v_main_~x~0_496} OutVars{main_~x~0=v_main_~x~0_496} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,083 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:25,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:25,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:25,106 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:25,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:25,146 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:25,561 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:25,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063121704] [2021-05-03 00:11:25,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1063121704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:25,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:25,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:11:25,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828804181] [2021-05-03 00:11:25,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:11:25,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:11:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:11:25,562 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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:11:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:26,952 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2021-05-03 00:11:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:11:26,953 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-03 00:11:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:26,953 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:11:26,954 INFO L226 Difference]: Without dead ends: 71 [2021-05-03 00:11:26,954 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1139.8ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:11:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-03 00:11:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-03 00:11:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-05-03 00:11:26,959 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 65 [2021-05-03 00:11:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:26,959 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-05-03 00:11:26,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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:11:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2021-05-03 00:11:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:11:26,959 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:26,959 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:26,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-03 00:11:26,960 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1102977110, now seen corresponding path program 28 times [2021-05-03 00:11:26,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:26,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017316289] [2021-05-03 00:11:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:26,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_526 500000) (< v_main_~x~0_526 999999)) InVars {main_~x~0=v_main_~x~0_526} OutVars{main_~x~0=v_main_~x~0_526} AuxVars[] AssignedVars[] [2021-05-03 00:11:26,965 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:26,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:26,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:26,980 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:26,988 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:26,990 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_528 500000) InVars {main_~x~0=v_main_~x~0_528} OutVars{main_~x~0=v_main_~x~0_528} AuxVars[] AssignedVars[] [2021-05-03 00:11:26,991 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:26,997 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:27,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:27,007 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:27,016 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:27,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:27,045 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:27,470 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:27,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017316289] [2021-05-03 00:11:27,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1017316289] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:27,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:27,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:11:27,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613303897] [2021-05-03 00:11:27,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:11:27,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:11:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:11:27,472 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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:11:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:28,937 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-05-03 00:11:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:11:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 67 [2021-05-03 00:11:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:28,938 INFO L225 Difference]: With dead ends: 82 [2021-05-03 00:11:28,939 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:11:28,939 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1190.4ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:11:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:11:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-03 00:11:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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:11:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-05-03 00:11:28,944 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 67 [2021-05-03 00:11:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:28,944 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-05-03 00:11:28,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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:11:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-05-03 00:11:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-03 00:11:28,944 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:28,944 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:28,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-03 00:11:28,945 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:28,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash -57008397, now seen corresponding path program 29 times [2021-05-03 00:11:28,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:28,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [837164454] [2021-05-03 00:11:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:28,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_559 500000) (< v_main_~x~0_559 999999)) InVars {main_~x~0=v_main_~x~0_559} OutVars{main_~x~0=v_main_~x~0_559} AuxVars[] AssignedVars[] [2021-05-03 00:11:28,955 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:28,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:28,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:28,974 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:28,985 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:28,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_561 500000) InVars {main_~x~0=v_main_~x~0_561} OutVars{main_~x~0=v_main_~x~0_561} AuxVars[] AssignedVars[] [2021-05-03 00:11:28,988 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:28,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:28,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:29,004 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:29,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:29,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:29,043 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:29,504 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:29,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [837164454] [2021-05-03 00:11:29,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [837164454] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:29,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:29,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:11:29,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260811081] [2021-05-03 00:11:29,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:11:29,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:29,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:11:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:11:29,506 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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:11:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:31,011 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-05-03 00:11:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:11:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 69 [2021-05-03 00:11:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:31,012 INFO L225 Difference]: With dead ends: 84 [2021-05-03 00:11:31,012 INFO L226 Difference]: Without dead ends: 75 [2021-05-03 00:11:31,013 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1239.0ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:11:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-03 00:11:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-03 00:11:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-05-03 00:11:31,017 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 69 [2021-05-03 00:11:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:31,017 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-05-03 00:11:31,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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:11:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2021-05-03 00:11:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:11:31,018 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:31,018 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:31,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:11:31,018 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1888416336, now seen corresponding path program 30 times [2021-05-03 00:11:31,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:31,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699743412] [2021-05-03 00:11:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:31,022 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_593 999999) (< v_main_~x~0_593 500000)) InVars {main_~x~0=v_main_~x~0_593} OutVars{main_~x~0=v_main_~x~0_593} AuxVars[] AssignedVars[] [2021-05-03 00:11:31,023 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:31,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:31,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:31,037 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:31,045 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:31,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_595 500000) InVars {main_~x~0=v_main_~x~0_595} OutVars{main_~x~0=v_main_~x~0_595} AuxVars[] AssignedVars[] [2021-05-03 00:11:31,047 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:31,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:31,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:31,062 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:31,071 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:31,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:31,107 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:31,575 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:31,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699743412] [2021-05-03 00:11:31,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [699743412] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:31,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:31,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:11:31,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596902966] [2021-05-03 00:11:31,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:11:31,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:11:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:11:31,577 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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:11:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:33,158 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-05-03 00:11:33,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:11:33,159 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-03 00:11:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:33,159 INFO L225 Difference]: With dead ends: 86 [2021-05-03 00:11:33,159 INFO L226 Difference]: Without dead ends: 77 [2021-05-03 00:11:33,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1288.7ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:11:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-03 00:11:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-03 00:11:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-05-03 00:11:33,164 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 71 [2021-05-03 00:11:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:33,164 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-05-03 00:11:33,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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:11:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2021-05-03 00:11:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:11:33,165 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:33,165 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:33,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:11:33,165 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1164156307, now seen corresponding path program 31 times [2021-05-03 00:11:33,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:33,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360199404] [2021-05-03 00:11:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:33,168 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_628 999999) (< v_main_~x~0_628 500000)) InVars {main_~x~0=v_main_~x~0_628} OutVars{main_~x~0=v_main_~x~0_628} AuxVars[] AssignedVars[] [2021-05-03 00:11:33,169 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:33,170 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:33,174 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:33,185 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:33,193 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:33,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_630 500000) InVars {main_~x~0=v_main_~x~0_630} OutVars{main_~x~0=v_main_~x~0_630} AuxVars[] AssignedVars[] [2021-05-03 00:11:33,195 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:33,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:33,199 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:33,210 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:33,218 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:33,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:33,252 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:33,777 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:33,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360199404] [2021-05-03 00:11:33,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [360199404] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:33,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:33,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:11:33,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445708974] [2021-05-03 00:11:33,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:11:33,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:11:33,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:11:33,779 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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:11:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:35,454 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-05-03 00:11:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:11:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 73 [2021-05-03 00:11:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:35,455 INFO L225 Difference]: With dead ends: 88 [2021-05-03 00:11:35,455 INFO L226 Difference]: Without dead ends: 79 [2021-05-03 00:11:35,456 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1397.4ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:11:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-03 00:11:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-03 00:11:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-05-03 00:11:35,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 73 [2021-05-03 00:11:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:35,461 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-05-03 00:11:35,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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:11:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-05-03 00:11:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-03 00:11:35,461 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:35,461 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:35,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-03 00:11:35,461 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1223803062, now seen corresponding path program 32 times [2021-05-03 00:11:35,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:35,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750803986] [2021-05-03 00:11:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:35,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_664 999999) (< v_main_~x~0_664 500000)) InVars {main_~x~0=v_main_~x~0_664} OutVars{main_~x~0=v_main_~x~0_664} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,467 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:35,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:35,482 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:35,491 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:35,492 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_666 500000) InVars {main_~x~0=v_main_~x~0_666} OutVars{main_~x~0=v_main_~x~0_666} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,493 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:35,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:35,508 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:35,517 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:35,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:35,556 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:36,078 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:36,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750803986] [2021-05-03 00:11:36,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [750803986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:36,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:36,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:11:36,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588065105] [2021-05-03 00:11:36,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:11:36,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:36,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:11:36,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:11:36,079 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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:11:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:37,890 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2021-05-03 00:11:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:11:37,891 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 75 [2021-05-03 00:11:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:37,891 INFO L225 Difference]: With dead ends: 90 [2021-05-03 00:11:37,891 INFO L226 Difference]: Without dead ends: 81 [2021-05-03 00:11:37,892 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1466.4ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:11:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-03 00:11:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-03 00:11:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2021-05-03 00:11:37,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 75 [2021-05-03 00:11:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2021-05-03 00:11:37,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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:11:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2021-05-03 00:11:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:11:37,897 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:37,897 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:37,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:11:37,897 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1585207527, now seen corresponding path program 33 times [2021-05-03 00:11:37,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:37,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849818675] [2021-05-03 00:11:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:37,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_701 500000) (< v_main_~x~0_701 999999)) InVars {main_~x~0=v_main_~x~0_701} OutVars{main_~x~0=v_main_~x~0_701} AuxVars[] AssignedVars[] [2021-05-03 00:11:37,903 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:37,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:37,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:37,922 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:37,931 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:37,932 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_703 500000) InVars {main_~x~0=v_main_~x~0_703} OutVars{main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[] [2021-05-03 00:11:37,937 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:37,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:37,948 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:37,954 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:37,964 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:37,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:37,997 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:38,584 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:38,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849818675] [2021-05-03 00:11:38,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849818675] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:38,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:38,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:11:38,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495443964] [2021-05-03 00:11:38,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:11:38,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:11:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:11:38,586 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:40,433 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2021-05-03 00:11:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:11:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-03 00:11:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:40,434 INFO L225 Difference]: With dead ends: 92 [2021-05-03 00:11:40,434 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:11:40,435 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1541.9ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:11:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:11:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-03 00:11:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2021-05-03 00:11:40,439 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 77 [2021-05-03 00:11:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:40,439 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-05-03 00:11:40,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2021-05-03 00:11:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:11:40,439 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:40,440 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:40,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-03 00:11:40,440 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -490045628, now seen corresponding path program 34 times [2021-05-03 00:11:40,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:40,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694893808] [2021-05-03 00:11:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:40,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_739 999999) (< v_main_~x~0_739 500000)) InVars {main_~x~0=v_main_~x~0_739} OutVars{main_~x~0=v_main_~x~0_739} AuxVars[] AssignedVars[] [2021-05-03 00:11:40,448 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:40,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:40,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:40,463 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:40,472 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:40,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_741 500000) InVars {main_~x~0=v_main_~x~0_741} OutVars{main_~x~0=v_main_~x~0_741} AuxVars[] AssignedVars[] [2021-05-03 00:11:40,475 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:40,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:40,479 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:40,490 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:40,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:40,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:40,534 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:41,165 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:41,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694893808] [2021-05-03 00:11:41,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1694893808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:41,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:41,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:11:41,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97072184] [2021-05-03 00:11:41,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:11:41,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:11:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:11:41,166 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states 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:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:43,174 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-05-03 00:11:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:11:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 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 79 [2021-05-03 00:11:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:43,175 INFO L225 Difference]: With dead ends: 94 [2021-05-03 00:11:43,175 INFO L226 Difference]: Without dead ends: 85 [2021-05-03 00:11:43,176 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1672.6ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:11:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-03 00:11:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-03 00:11:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-05-03 00:11:43,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 79 [2021-05-03 00:11:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:43,180 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-05-03 00:11:43,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states 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:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2021-05-03 00:11:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-03 00:11:43,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:43,181 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:43,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-03 00:11:43,181 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1943502239, now seen corresponding path program 35 times [2021-05-03 00:11:43,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:43,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126614519] [2021-05-03 00:11:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:43,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_778 999999) (< v_main_~x~0_778 500000)) InVars {main_~x~0=v_main_~x~0_778} OutVars{main_~x~0=v_main_~x~0_778} AuxVars[] AssignedVars[] [2021-05-03 00:11:43,186 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:43,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:43,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:43,201 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:43,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:43,211 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_780 500000) InVars {main_~x~0=v_main_~x~0_780} OutVars{main_~x~0=v_main_~x~0_780} AuxVars[] AssignedVars[] [2021-05-03 00:11:43,212 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:43,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:43,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:43,226 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:43,235 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:43,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:43,273 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:43,886 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:43,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126614519] [2021-05-03 00:11:43,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2126614519] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:43,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:43,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:11:43,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313159115] [2021-05-03 00:11:43,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:11:43,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:11:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:11:43,887 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 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:11:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:45,919 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2021-05-03 00:11:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:11:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 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 81 [2021-05-03 00:11:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:45,920 INFO L225 Difference]: With dead ends: 96 [2021-05-03 00:11:45,920 INFO L226 Difference]: Without dead ends: 87 [2021-05-03 00:11:45,920 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1653.6ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:11:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-03 00:11:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-03 00:11:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 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:11:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2021-05-03 00:11:45,925 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 81 [2021-05-03 00:11:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:45,925 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-05-03 00:11:45,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 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:11:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2021-05-03 00:11:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-03 00:11:45,926 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:45,926 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:45,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:11:45,926 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1444033086, now seen corresponding path program 36 times [2021-05-03 00:11:45,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:45,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513753397] [2021-05-03 00:11:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:45,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_818 500000) (< v_main_~x~0_818 999999)) InVars {main_~x~0=v_main_~x~0_818} OutVars{main_~x~0=v_main_~x~0_818} AuxVars[] AssignedVars[] [2021-05-03 00:11:45,932 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:45,933 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:45,937 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:45,947 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:45,955 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:45,957 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_820 500000) InVars {main_~x~0=v_main_~x~0_820} OutVars{main_~x~0=v_main_~x~0_820} AuxVars[] AssignedVars[] [2021-05-03 00:11:45,960 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:45,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:45,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:45,975 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:45,983 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:46,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:46,017 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:46,739 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:46,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513753397] [2021-05-03 00:11:46,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [513753397] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:46,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:46,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:11:46,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934860673] [2021-05-03 00:11:46,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:11:46,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:11:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:11:46,740 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 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:11:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:48,922 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-05-03 00:11:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:11:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-03 00:11:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:48,923 INFO L225 Difference]: With dead ends: 98 [2021-05-03 00:11:48,923 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:11:48,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1849.9ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:11:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:11:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-03 00:11:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 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:11:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2021-05-03 00:11:48,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 83 [2021-05-03 00:11:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:48,929 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2021-05-03 00:11:48,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 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:11:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2021-05-03 00:11:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-03 00:11:48,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:48,929 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:48,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:11:48,929 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1280270043, now seen corresponding path program 37 times [2021-05-03 00:11:48,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:48,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852471802] [2021-05-03 00:11:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:48,933 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_859 999999) (< v_main_~x~0_859 500000)) InVars {main_~x~0=v_main_~x~0_859} OutVars{main_~x~0=v_main_~x~0_859} AuxVars[] AssignedVars[] [2021-05-03 00:11:48,935 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:48,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:48,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:48,950 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:48,958 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:48,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_861 500000) InVars {main_~x~0=v_main_~x~0_861} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[] [2021-05-03 00:11:48,960 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:48,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:48,965 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:48,977 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:48,985 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:49,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:49,765 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:49,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852471802] [2021-05-03 00:11:49,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1852471802] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:49,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:49,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:11:49,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809269349] [2021-05-03 00:11:49,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:11:49,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:11:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:11:49,767 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states 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:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:51,999 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-05-03 00:11:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:11:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 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:11:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:52,000 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:11:52,001 INFO L226 Difference]: Without dead ends: 91 [2021-05-03 00:11:52,001 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1855.0ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:11:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-03 00:11:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-03 00:11:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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:11:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2021-05-03 00:11:52,007 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 85 [2021-05-03 00:11:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:52,007 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2021-05-03 00:11:52,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states 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,008 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2021-05-03 00:11:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:11:52,008 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:52,008 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:52,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-03 00:11:52,008 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1477191624, now seen corresponding path program 38 times [2021-05-03 00:11:52,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:52,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41796546] [2021-05-03 00:11:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:52,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_901 500000) (< v_main_~x~0_901 999999)) InVars {main_~x~0=v_main_~x~0_901} OutVars{main_~x~0=v_main_~x~0_901} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,013 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:52,019 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:52,028 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:52,037 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:52,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_903 500000) InVars {main_~x~0=v_main_~x~0_903} OutVars{main_~x~0=v_main_~x~0_903} AuxVars[] AssignedVars[] [2021-05-03 00:11:52,039 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:52,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:52,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:52,053 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:52,062 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:52,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:52,095 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:52,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:52,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41796546] [2021-05-03 00:11:52,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [41796546] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:52,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:52,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:11:52,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96108690] [2021-05-03 00:11:52,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:11:52,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:52,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:11:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:11:52,757 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states 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:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:55,080 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-05-03 00:11:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:11:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 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:11:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:55,081 INFO L225 Difference]: With dead ends: 102 [2021-05-03 00:11:55,081 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:11:55,081 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1842.7ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:11:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:11:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-03 00:11:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 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:11:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2021-05-03 00:11:55,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 87 [2021-05-03 00:11:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:55,086 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2021-05-03 00:11:55,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states 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:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2021-05-03 00:11:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:11:55,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:55,087 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:55,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:11:55,087 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1403031979, now seen corresponding path program 39 times [2021-05-03 00:11:55,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:55,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488121179] [2021-05-03 00:11:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:55,091 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_944 500000) (< v_main_~x~0_944 999999)) InVars {main_~x~0=v_main_~x~0_944} OutVars{main_~x~0=v_main_~x~0_944} AuxVars[] AssignedVars[] [2021-05-03 00:11:55,092 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:55,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:55,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:55,108 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:55,117 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:55,121 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_946 500000) InVars {main_~x~0=v_main_~x~0_946} OutVars{main_~x~0=v_main_~x~0_946} AuxVars[] AssignedVars[] [2021-05-03 00:11:55,122 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:55,122 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:55,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:55,137 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:55,146 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:55,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:55,199 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:55,954 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:55,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488121179] [2021-05-03 00:11:55,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1488121179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:55,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:55,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:11:55,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820604290] [2021-05-03 00:11:55,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:11:55,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:11:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:11:55,955 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:58,425 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-05-03 00:11:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:11:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-03 00:11:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:58,426 INFO L225 Difference]: With dead ends: 104 [2021-05-03 00:11:58,426 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:11:58,426 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 2016.0ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:11:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:11:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-03 00:11:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 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:11:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2021-05-03 00:11:58,432 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 89 [2021-05-03 00:11:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:58,432 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2021-05-03 00:11:58,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2021-05-03 00:11:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:11:58,432 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:58,432 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:58,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-03 00:11:58,432 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1144910130, now seen corresponding path program 40 times [2021-05-03 00:11:58,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:58,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069521032] [2021-05-03 00:11:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:58,436 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_988 500000) (< v_main_~x~0_988 999999)) InVars {main_~x~0=v_main_~x~0_988} OutVars{main_~x~0=v_main_~x~0_988} AuxVars[] AssignedVars[] [2021-05-03 00:11:58,438 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:58,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:58,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:58,453 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:58,461 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:58,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_990 500000) InVars {main_~x~0=v_main_~x~0_990} OutVars{main_~x~0=v_main_~x~0_990} AuxVars[] AssignedVars[] [2021-05-03 00:11:58,463 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:58,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:58,473 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:58,478 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:58,487 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:58,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:58,521 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:59,320 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:59,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069521032] [2021-05-03 00:11:59,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2069521032] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:59,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:59,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:11:59,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125514357] [2021-05-03 00:11:59,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:11:59,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:11:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:11:59,321 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states 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:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:01,849 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2021-05-03 00:12:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:12:01,849 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 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:12:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:01,850 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:12:01,850 INFO L226 Difference]: Without dead ends: 97 [2021-05-03 00:12:01,852 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 2077.6ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:12:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-03 00:12:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-03 00:12:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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:12:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2021-05-03 00:12:01,857 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 91 [2021-05-03 00:12:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:01,857 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2021-05-03 00:12:01,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states 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:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2021-05-03 00:12:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-03 00:12:01,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:01,857 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:01,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-03 00:12:01,857 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1585918159, now seen corresponding path program 41 times [2021-05-03 00:12:01,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:01,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516230874] [2021-05-03 00:12:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:01,861 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1033 999999) (< v_main_~x~0_1033 500000)) InVars {main_~x~0=v_main_~x~0_1033} OutVars{main_~x~0=v_main_~x~0_1033} AuxVars[] AssignedVars[] [2021-05-03 00:12:01,862 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:01,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:01,872 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:01,877 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:01,885 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:01,886 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1035 500000) InVars {main_~x~0=v_main_~x~0_1035} OutVars{main_~x~0=v_main_~x~0_1035} AuxVars[] AssignedVars[] [2021-05-03 00:12:01,887 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:01,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:01,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:01,902 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:01,910 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:01,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:01,941 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:02,795 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516230874] [2021-05-03 00:12:02,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [516230874] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:12:02,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266337] [2021-05-03 00:12:02,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:12:02,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:12:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:12:02,796 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 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:12:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:05,437 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-03 00:12:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:12:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 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 93 [2021-05-03 00:12:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:05,438 INFO L225 Difference]: With dead ends: 108 [2021-05-03 00:12:05,438 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:12:05,438 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 2168.5ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:12:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:12:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-03 00:12:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2021-05-03 00:12:05,443 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 93 [2021-05-03 00:12:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:05,443 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-05-03 00:12:05,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 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:12:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2021-05-03 00:12:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:12:05,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:05,444 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:05,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:12:05,444 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash 192871724, now seen corresponding path program 42 times [2021-05-03 00:12:05,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:05,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [447781174] [2021-05-03 00:12:05,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:05,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1079 999999) (< v_main_~x~0_1079 500000)) InVars {main_~x~0=v_main_~x~0_1079} OutVars{main_~x~0=v_main_~x~0_1079} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,449 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:05,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:05,469 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:05,478 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:05,479 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1081 500000) InVars {main_~x~0=v_main_~x~0_1081} OutVars{main_~x~0=v_main_~x~0_1081} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,480 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:05,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:05,495 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:05,504 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:05,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:05,540 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:06,487 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:06,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [447781174] [2021-05-03 00:12:06,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [447781174] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:06,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:06,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:12:06,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876760230] [2021-05-03 00:12:06,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:12:06,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:06,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:12:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:12:06,488 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 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:12:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:09,263 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-05-03 00:12:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:12:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-03 00:12:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:09,269 INFO L225 Difference]: With dead ends: 110 [2021-05-03 00:12:09,269 INFO L226 Difference]: Without dead ends: 101 [2021-05-03 00:12:09,270 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2333.4ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:12:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-03 00:12:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-03 00:12:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2021-05-03 00:12:09,276 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 95 [2021-05-03 00:12:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:09,277 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2021-05-03 00:12:09,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 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:12:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2021-05-03 00:12:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:12:09,278 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:09,278 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:09,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-03 00:12:09,278 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1505044041, now seen corresponding path program 43 times [2021-05-03 00:12:09,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:09,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680018176] [2021-05-03 00:12:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:09,282 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1126 500000) (< v_main_~x~0_1126 999999)) InVars {main_~x~0=v_main_~x~0_1126} OutVars{main_~x~0=v_main_~x~0_1126} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,283 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:09,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,288 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:09,300 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:09,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:09,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1128 500000) InVars {main_~x~0=v_main_~x~0_1128} OutVars{main_~x~0=v_main_~x~0_1128} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,311 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:09,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:09,330 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:09,339 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:09,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:09,372 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:10,284 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:10,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680018176] [2021-05-03 00:12:10,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680018176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:10,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:10,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:12:10,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119230266] [2021-05-03 00:12:10,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:12:10,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:12:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:12:10,285 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states 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:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:13,205 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-05-03 00:12:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:12:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 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 97 [2021-05-03 00:12:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:13,206 INFO L225 Difference]: With dead ends: 112 [2021-05-03 00:12:13,206 INFO L226 Difference]: Without dead ends: 103 [2021-05-03 00:12:13,207 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 2349.3ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:12:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-03 00:12:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-03 00:12:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2021-05-03 00:12:13,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 97 [2021-05-03 00:12:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:13,212 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-05-03 00:12:13,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states 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:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2021-05-03 00:12:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-03 00:12:13,213 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:13,213 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:13,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-03 00:12:13,213 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -217744346, now seen corresponding path program 44 times [2021-05-03 00:12:13,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:13,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2021269071] [2021-05-03 00:12:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:13,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1174 999999) (< v_main_~x~0_1174 500000)) InVars {main_~x~0=v_main_~x~0_1174} OutVars{main_~x~0=v_main_~x~0_1174} AuxVars[] AssignedVars[] [2021-05-03 00:12:13,222 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:13,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:13,238 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:13,247 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:13,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1176 500000) InVars {main_~x~0=v_main_~x~0_1176} OutVars{main_~x~0=v_main_~x~0_1176} AuxVars[] AssignedVars[] [2021-05-03 00:12:13,250 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:13,250 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:13,266 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:13,274 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:13,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:13,310 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:14,330 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:14,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2021269071] [2021-05-03 00:12:14,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2021269071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:14,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:14,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-03 00:12:14,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228197771] [2021-05-03 00:12:14,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-03 00:12:14,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-03 00:12:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-03 00:12:14,331 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 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:12:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:17,361 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-05-03 00:12:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:12:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 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 99 [2021-05-03 00:12:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:17,362 INFO L225 Difference]: With dead ends: 114 [2021-05-03 00:12:17,362 INFO L226 Difference]: Without dead ends: 105 [2021-05-03 00:12:17,363 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2534.0ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:12:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-03 00:12:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-03 00:12:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 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:12:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2021-05-03 00:12:17,368 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 99 [2021-05-03 00:12:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:17,368 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-05-03 00:12:17,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 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:12:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2021-05-03 00:12:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-03 00:12:17,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:17,369 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:17,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:12:17,369 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2039992003, now seen corresponding path program 45 times [2021-05-03 00:12:17,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:17,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704293552] [2021-05-03 00:12:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:17,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1223 500000) (< v_main_~x~0_1223 999999)) InVars {main_~x~0=v_main_~x~0_1223} OutVars{main_~x~0=v_main_~x~0_1223} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,378 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:17,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:17,392 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:17,406 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:17,407 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1225 500000) InVars {main_~x~0=v_main_~x~0_1225} OutVars{main_~x~0=v_main_~x~0_1225} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,408 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:17,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:17,422 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:17,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:17,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:18,538 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:18,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704293552] [2021-05-03 00:12:18,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [704293552] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:18,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:18,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:12:18,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442301680] [2021-05-03 00:12:18,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:12:18,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:12:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:12:18,539 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 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:12:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:21,731 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-05-03 00:12:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:12:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-03 00:12:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:21,732 INFO L225 Difference]: With dead ends: 116 [2021-05-03 00:12:21,732 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:12:21,733 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 2640.0ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:12:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:12:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-03 00:12:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2021-05-03 00:12:21,738 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 101 [2021-05-03 00:12:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:21,738 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-05-03 00:12:21,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 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:12:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2021-05-03 00:12:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-03 00:12:21,739 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:21,739 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:21,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-03 00:12:21,739 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1528828384, now seen corresponding path program 46 times [2021-05-03 00:12:21,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:21,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [161265983] [2021-05-03 00:12:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:21,742 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1273 500000) (< v_main_~x~0_1273 999999)) InVars {main_~x~0=v_main_~x~0_1273} OutVars{main_~x~0=v_main_~x~0_1273} AuxVars[] AssignedVars[] [2021-05-03 00:12:21,743 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:21,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:21,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:21,758 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:21,771 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:21,772 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1275 500000) InVars {main_~x~0=v_main_~x~0_1275} OutVars{main_~x~0=v_main_~x~0_1275} AuxVars[] AssignedVars[] [2021-05-03 00:12:21,773 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:21,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:21,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:21,788 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:21,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:21,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:21,839 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:22,904 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:22,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [161265983] [2021-05-03 00:12:22,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [161265983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:22,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:22,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:12:22,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137535748] [2021-05-03 00:12:22,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:12:22,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:12:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:12:22,905 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states 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:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:26,181 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2021-05-03 00:12:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:12:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 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:12:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:26,182 INFO L225 Difference]: With dead ends: 118 [2021-05-03 00:12:26,182 INFO L226 Difference]: Without dead ends: 109 [2021-05-03 00:12:26,183 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 2681.8ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:12:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-03 00:12:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-03 00:12:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2021-05-03 00:12:26,188 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 103 [2021-05-03 00:12:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:26,188 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2021-05-03 00:12:26,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states 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:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2021-05-03 00:12:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-03 00:12:26,189 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:26,189 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:26,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-03 00:12:26,189 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:26,189 INFO L82 PathProgramCache]: Analyzing trace with hash 513649213, now seen corresponding path program 47 times [2021-05-03 00:12:26,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:26,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2147027880] [2021-05-03 00:12:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:26,193 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1324 500000) (< v_main_~x~0_1324 999999)) InVars {main_~x~0=v_main_~x~0_1324} OutVars{main_~x~0=v_main_~x~0_1324} AuxVars[] AssignedVars[] [2021-05-03 00:12:26,194 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:26,195 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:26,199 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:26,210 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:26,219 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:26,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1326 500000) InVars {main_~x~0=v_main_~x~0_1326} OutVars{main_~x~0=v_main_~x~0_1326} AuxVars[] AssignedVars[] [2021-05-03 00:12:26,221 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:26,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:26,230 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:26,236 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:26,245 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:26,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:26,277 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,432 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:27,432 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2147027880] [2021-05-03 00:12:27,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2147027880] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:27,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:27,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:12:27,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987353029] [2021-05-03 00:12:27,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:12:27,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:12:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:12:27,433 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states 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:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:30,891 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2021-05-03 00:12:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:12:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2021-05-03 00:12:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:30,893 INFO L225 Difference]: With dead ends: 120 [2021-05-03 00:12:30,893 INFO L226 Difference]: Without dead ends: 111 [2021-05-03 00:12:30,893 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2844.5ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:12:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-03 00:12:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-03 00:12:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2021-05-03 00:12:30,899 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 105 [2021-05-03 00:12:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:30,899 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2021-05-03 00:12:30,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states 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:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2021-05-03 00:12:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:12:30,899 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:30,899 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:30,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-03 00:12:30,900 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 534565658, now seen corresponding path program 48 times [2021-05-03 00:12:30,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:30,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452117358] [2021-05-03 00:12:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:30,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1376 500000) (< v_main_~x~0_1376 999999)) InVars {main_~x~0=v_main_~x~0_1376} OutVars{main_~x~0=v_main_~x~0_1376} AuxVars[] AssignedVars[] [2021-05-03 00:12:30,904 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:30,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:30,918 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:30,926 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:30,928 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1378 500000) InVars {main_~x~0=v_main_~x~0_1378} OutVars{main_~x~0=v_main_~x~0_1378} AuxVars[] AssignedVars[] [2021-05-03 00:12:30,929 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:30,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:30,943 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:30,951 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:30,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:30,980 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:32,034 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:32,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452117358] [2021-05-03 00:12:32,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1452117358] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:32,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:32,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:12:32,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004673820] [2021-05-03 00:12:32,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:12:32,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:12:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:12:32,035 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 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:12:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:35,571 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2021-05-03 00:12:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:12:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-03 00:12:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:35,572 INFO L225 Difference]: With dead ends: 122 [2021-05-03 00:12:35,572 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:12:35,573 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 2791.9ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-03 00:12:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:12:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-03 00:12:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2021-05-03 00:12:35,579 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 107 [2021-05-03 00:12:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:35,579 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2021-05-03 00:12:35,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 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:12:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2021-05-03 00:12:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-03 00:12:35,579 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:35,579 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:35,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-03 00:12:35,579 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -839567177, now seen corresponding path program 49 times [2021-05-03 00:12:35,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:35,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [649960654] [2021-05-03 00:12:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:35,583 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1429 999999) (< v_main_~x~0_1429 500000)) InVars {main_~x~0=v_main_~x~0_1429} OutVars{main_~x~0=v_main_~x~0_1429} AuxVars[] AssignedVars[] [2021-05-03 00:12:35,588 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:35,595 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:35,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:35,604 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:35,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:35,615 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1431 500000) InVars {main_~x~0=v_main_~x~0_1431} OutVars{main_~x~0=v_main_~x~0_1431} AuxVars[] AssignedVars[] [2021-05-03 00:12:35,616 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:35,616 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:35,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:35,634 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:35,643 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:35,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:35,673 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:36,877 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:36,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [649960654] [2021-05-03 00:12:36,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [649960654] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:36,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:36,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:12:36,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343332055] [2021-05-03 00:12:36,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:12:36,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:12:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:12:36,879 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states 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:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:40,569 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2021-05-03 00:12:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:12:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 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 109 [2021-05-03 00:12:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:40,570 INFO L225 Difference]: With dead ends: 124 [2021-05-03 00:12:40,570 INFO L226 Difference]: Without dead ends: 115 [2021-05-03 00:12:40,571 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 2994.8ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:12:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-03 00:12:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-03 00:12:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 110 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:12:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2021-05-03 00:12:40,576 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 109 [2021-05-03 00:12:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:40,576 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2021-05-03 00:12:40,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states 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:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2021-05-03 00:12:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-03 00:12:40,577 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:40,577 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:40,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-03 00:12:40,577 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1468705556, now seen corresponding path program 50 times [2021-05-03 00:12:40,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:40,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150980447] [2021-05-03 00:12:40,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:40,581 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1483 500000) (< v_main_~x~0_1483 999999)) InVars {main_~x~0=v_main_~x~0_1483} OutVars{main_~x~0=v_main_~x~0_1483} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,582 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:40,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,596 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:40,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:40,606 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1485 500000) InVars {main_~x~0=v_main_~x~0_1485} OutVars{main_~x~0=v_main_~x~0_1485} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,607 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:40,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,622 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:40,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:40,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:40,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:12:41,957 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:41,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150980447] [2021-05-03 00:12:41,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [150980447] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:41,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:41,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:12:41,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502415003] [2021-05-03 00:12:41,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:12:41,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:12:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:12:41,958 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 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:12:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:45,802 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2021-05-03 00:12:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:12:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 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 111 [2021-05-03 00:12:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:45,803 INFO L225 Difference]: With dead ends: 126 [2021-05-03 00:12:45,803 INFO L226 Difference]: Without dead ends: 117 [2021-05-03 00:12:45,804 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3170.6ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:12:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-03 00:12:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-03 00:12:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 112 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:12:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2021-05-03 00:12:45,810 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 111 [2021-05-03 00:12:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:45,810 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2021-05-03 00:12:45,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 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:12:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2021-05-03 00:12:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:12:45,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:45,810 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:45,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:12:45,810 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:45,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -779290063, now seen corresponding path program 51 times [2021-05-03 00:12:45,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:45,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664223059] [2021-05-03 00:12:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:45,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1538 999999) (< v_main_~x~0_1538 500000)) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1538} AuxVars[] AssignedVars[] [2021-05-03 00:12:45,815 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:45,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,820 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:45,830 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:45,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:45,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1540 500000) InVars {main_~x~0=v_main_~x~0_1540} OutVars{main_~x~0=v_main_~x~0_1540} AuxVars[] AssignedVars[] [2021-05-03 00:12:45,840 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:45,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:45,856 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:45,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:45,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:45,900 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:47,282 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:47,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664223059] [2021-05-03 00:12:47,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1664223059] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:47,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:47,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:12:47,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474976582] [2021-05-03 00:12:47,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:12:47,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:12:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:12:47,283 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:51,261 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2021-05-03 00:12:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:12:51,261 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-03 00:12:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:51,262 INFO L225 Difference]: With dead ends: 128 [2021-05-03 00:12:51,262 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:12:51,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 3312.4ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:12:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:12:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-03 00:12:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 114 states have internal predecessors, (117), 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:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2021-05-03 00:12:51,268 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 113 [2021-05-03 00:12:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:51,268 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2021-05-03 00:12:51,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2021-05-03 00:12:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-03 00:12:51,269 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:51,269 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:51,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:12:51,269 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -734530034, now seen corresponding path program 52 times [2021-05-03 00:12:51,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:51,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388981090] [2021-05-03 00:12:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:51,275 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1594 500000) (< v_main_~x~0_1594 999999)) InVars {main_~x~0=v_main_~x~0_1594} OutVars{main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[] [2021-05-03 00:12:51,276 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:51,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:51,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:51,291 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:51,300 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:51,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1596 500000) InVars {main_~x~0=v_main_~x~0_1596} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[] [2021-05-03 00:12:51,304 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:51,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:51,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:51,322 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:51,332 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:51,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:52,635 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:52,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388981090] [2021-05-03 00:12:52,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [388981090] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:52,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:52,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-03 00:12:52,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148766691] [2021-05-03 00:12:52,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-03 00:12:52,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-03 00:12:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:12:52,636 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states 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,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:56,743 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2021-05-03 00:12:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:12:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 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:12:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:56,744 INFO L225 Difference]: With dead ends: 130 [2021-05-03 00:12:56,744 INFO L226 Difference]: Without dead ends: 121 [2021-05-03 00:12:56,745 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 3258.4ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-03 00:12:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-03 00:12:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-03 00:12:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 116 states have internal predecessors, (119), 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2021-05-03 00:12:56,751 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 115 [2021-05-03 00:12:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:56,751 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2021-05-03 00:12:56,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states 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,751 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2021-05-03 00:12:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-03 00:12:56,751 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:56,752 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:56,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-03 00:12:56,752 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -669815125, now seen corresponding path program 53 times [2021-05-03 00:12:56,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:56,752 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314973573] [2021-05-03 00:12:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:56,755 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1651 999999) (< v_main_~x~0_1651 500000)) InVars {main_~x~0=v_main_~x~0_1651} OutVars{main_~x~0=v_main_~x~0_1651} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,757 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:56,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,772 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:56,780 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:56,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1653 500000) InVars {main_~x~0=v_main_~x~0_1653} OutVars{main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,783 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:56,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,798 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:56,807 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:56,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:56,836 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:58,256 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:58,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314973573] [2021-05-03 00:12:58,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [314973573] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:58,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:58,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:12:58,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3641724] [2021-05-03 00:12:58,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:12:58,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:12:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:12:58,258 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 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:13:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:02,528 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2021-05-03 00:13:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:13:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 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 117 [2021-05-03 00:13:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:02,529 INFO L225 Difference]: With dead ends: 132 [2021-05-03 00:13:02,530 INFO L226 Difference]: Without dead ends: 123 [2021-05-03 00:13:02,530 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 3470.6ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:13:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-03 00:13:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-03 00:13:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0254237288135593) internal successors, (121), 118 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2021-05-03 00:13:02,536 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 117 [2021-05-03 00:13:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2021-05-03 00:13:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 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:13:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2021-05-03 00:13:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-03 00:13:02,536 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:02,537 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:02,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-03 00:13:02,537 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1391670280, now seen corresponding path program 54 times [2021-05-03 00:13:02,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:02,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602683188] [2021-05-03 00:13:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:02,541 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1709 500000) (< v_main_~x~0_1709 999999)) InVars {main_~x~0=v_main_~x~0_1709} OutVars{main_~x~0=v_main_~x~0_1709} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,542 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:02,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,558 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:02,567 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1711 500000) InVars {main_~x~0=v_main_~x~0_1711} OutVars{main_~x~0=v_main_~x~0_1711} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,569 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:02,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,590 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:02,599 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,633 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:04,206 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:04,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602683188] [2021-05-03 00:13:04,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1602683188] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:04,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:04,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:13:04,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695376988] [2021-05-03 00:13:04,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:13:04,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:13:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:13:04,207 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:08,663 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2021-05-03 00:13:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:13:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-03 00:13:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:08,664 INFO L225 Difference]: With dead ends: 134 [2021-05-03 00:13:08,664 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:13:08,664 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 3713.1ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:13:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:13:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-03 00:13:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.025) internal successors, (123), 120 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:13:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2021-05-03 00:13:08,670 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 119 [2021-05-03 00:13:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:08,671 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2021-05-03 00:13:08,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2021-05-03 00:13:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-03 00:13:08,671 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:08,671 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:08,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-03 00:13:08,671 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1795746267, now seen corresponding path program 55 times [2021-05-03 00:13:08,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:08,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620488559] [2021-05-03 00:13:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:08,675 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1768 999999) (< v_main_~x~0_1768 500000)) InVars {main_~x~0=v_main_~x~0_1768} OutVars{main_~x~0=v_main_~x~0_1768} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,676 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:08,682 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:08,692 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:08,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:08,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1770 500000) InVars {main_~x~0=v_main_~x~0_1770} OutVars{main_~x~0=v_main_~x~0_1770} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,703 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:08,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,707 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:08,719 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:08,728 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:08,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:08,759 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:10,340 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:10,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620488559] [2021-05-03 00:13:10,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1620488559] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:10,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:10,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:13:10,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074590663] [2021-05-03 00:13:10,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:13:10,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:13:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:13:10,342 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states 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:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:14,933 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2021-05-03 00:13:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:13:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 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 121 [2021-05-03 00:13:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:14,935 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:13:14,935 INFO L226 Difference]: Without dead ends: 127 [2021-05-03 00:13:14,935 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 3762.3ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:13:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-03 00:13:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-03 00:13:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0245901639344261) internal successors, (125), 122 states have internal predecessors, (125), 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:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2021-05-03 00:13:14,941 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 121 [2021-05-03 00:13:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:14,941 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2021-05-03 00:13:14,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states 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:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2021-05-03 00:13:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-03 00:13:14,942 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:14,942 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:14,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-03 00:13:14,942 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1703601410, now seen corresponding path program 56 times [2021-05-03 00:13:14,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:14,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292770977] [2021-05-03 00:13:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:14,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1828 999999) (< v_main_~x~0_1828 500000)) InVars {main_~x~0=v_main_~x~0_1828} OutVars{main_~x~0=v_main_~x~0_1828} AuxVars[] AssignedVars[] [2021-05-03 00:13:14,947 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:14,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:14,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:14,965 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:14,974 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:14,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1830 500000) InVars {main_~x~0=v_main_~x~0_1830} OutVars{main_~x~0=v_main_~x~0_1830} AuxVars[] AssignedVars[] [2021-05-03 00:13:14,976 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:14,984 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:14,988 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:14,994 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:15,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:15,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:15,041 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:16,705 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:16,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292770977] [2021-05-03 00:13:16,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1292770977] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:16,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:16,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:13:16,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132463593] [2021-05-03 00:13:16,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:13:16,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:13:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:13:16,707 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 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:13:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:21,509 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2021-05-03 00:13:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:13:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 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 123 [2021-05-03 00:13:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:21,511 INFO L225 Difference]: With dead ends: 138 [2021-05-03 00:13:21,511 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:13:21,511 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 3961.1ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:13:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:13:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-03 00:13:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2021-05-03 00:13:21,517 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 123 [2021-05-03 00:13:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:21,517 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2021-05-03 00:13:21,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 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:13:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2021-05-03 00:13:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:13:21,518 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:21,518 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:21,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:13:21,518 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1617326239, now seen corresponding path program 57 times [2021-05-03 00:13:21,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:21,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970276307] [2021-05-03 00:13:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:21,523 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1889 999999) (< v_main_~x~0_1889 500000)) InVars {main_~x~0=v_main_~x~0_1889} OutVars{main_~x~0=v_main_~x~0_1889} AuxVars[] AssignedVars[] [2021-05-03 00:13:21,524 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:21,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:21,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:21,540 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:21,549 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:21,553 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1891 500000) InVars {main_~x~0=v_main_~x~0_1891} OutVars{main_~x~0=v_main_~x~0_1891} AuxVars[] AssignedVars[] [2021-05-03 00:13:21,565 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:21,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:21,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:21,582 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:21,591 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:21,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:23,248 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:23,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970276307] [2021-05-03 00:13:23,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1970276307] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:23,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:23,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:13:23,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50108792] [2021-05-03 00:13:23,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:13:23,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:13:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:13:23,249 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:28,195 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2021-05-03 00:13:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:13:28,196 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-03 00:13:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:28,196 INFO L225 Difference]: With dead ends: 140 [2021-05-03 00:13:28,196 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:13:28,197 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 3984.0ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:13:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:13:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:13:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0238095238095237) internal successors, (129), 126 states have internal predecessors, (129), 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:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2021-05-03 00:13:28,203 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 125 [2021-05-03 00:13:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:28,203 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2021-05-03 00:13:28,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2021-05-03 00:13:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-03 00:13:28,204 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:28,204 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:28,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-03 00:13:28,204 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash 311265532, now seen corresponding path program 58 times [2021-05-03 00:13:28,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:28,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851974010] [2021-05-03 00:13:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:28,208 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1951 500000) (< v_main_~x~0_1951 999999)) InVars {main_~x~0=v_main_~x~0_1951} OutVars{main_~x~0=v_main_~x~0_1951} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,209 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:28,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:28,227 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:28,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:28,238 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1953 500000) InVars {main_~x~0=v_main_~x~0_1953} OutVars{main_~x~0=v_main_~x~0_1953} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,239 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:28,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:28,256 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:28,265 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:28,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:28,304 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:30,112 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:30,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851974010] [2021-05-03 00:13:30,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1851974010] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:30,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:30,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:13:30,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290726439] [2021-05-03 00:13:30,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:13:30,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:30,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:13:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:13:30,114 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 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:13:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:35,236 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2021-05-03 00:13:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:13:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 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 127 [2021-05-03 00:13:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:35,237 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:13:35,237 INFO L226 Difference]: Without dead ends: 133 [2021-05-03 00:13:35,238 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 53 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 4247.8ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:13:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-03 00:13:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-03 00:13:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.0234375) internal successors, (131), 128 states have internal predecessors, (131), 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,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2021-05-03 00:13:35,244 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 127 [2021-05-03 00:13:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:35,245 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2021-05-03 00:13:35,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 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:13:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2021-05-03 00:13:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-03 00:13:35,245 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:35,245 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:35,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:13:35,245 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash -682623463, now seen corresponding path program 59 times [2021-05-03 00:13:35,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:35,246 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005149562] [2021-05-03 00:13:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:35,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2014 500000) (< v_main_~x~0_2014 999999)) InVars {main_~x~0=v_main_~x~0_2014} OutVars{main_~x~0=v_main_~x~0_2014} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,255 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:35,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:35,272 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:35,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:35,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2016 500000) InVars {main_~x~0=v_main_~x~0_2016} OutVars{main_~x~0=v_main_~x~0_2016} AuxVars[] AssignedVars[] [2021-05-03 00:13:35,284 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:35,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:35,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:35,300 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:35,310 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:35,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:37,197 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:37,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005149562] [2021-05-03 00:13:37,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005149562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:37,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:37,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:13:37,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679897739] [2021-05-03 00:13:37,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:13:37,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:13:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:13:37,198 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states 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:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:42,563 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2021-05-03 00:13:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:13:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 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 129 [2021-05-03 00:13:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:42,564 INFO L225 Difference]: With dead ends: 144 [2021-05-03 00:13:42,564 INFO L226 Difference]: Without dead ends: 135 [2021-05-03 00:13:42,565 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 55 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 4382.0ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:13:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-03 00:13:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-03 00:13:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.023076923076923) internal successors, (133), 130 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2021-05-03 00:13:42,571 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 129 [2021-05-03 00:13:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:42,571 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2021-05-03 00:13:42,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states 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:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2021-05-03 00:13:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:13:42,572 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:42,572 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:42,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:13:42,572 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1967759350, now seen corresponding path program 60 times [2021-05-03 00:13:42,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:42,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660947397] [2021-05-03 00:13:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:42,577 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2078 999999) (< v_main_~x~0_2078 500000)) InVars {main_~x~0=v_main_~x~0_2078} OutVars{main_~x~0=v_main_~x~0_2078} AuxVars[] AssignedVars[] [2021-05-03 00:13:42,586 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:42,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:42,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:42,603 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:42,618 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:42,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2080 500000) InVars {main_~x~0=v_main_~x~0_2080} OutVars{main_~x~0=v_main_~x~0_2080} AuxVars[] AssignedVars[] [2021-05-03 00:13:42,621 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:42,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:42,631 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:42,637 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:42,646 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:42,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:42,677 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:44,519 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:44,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660947397] [2021-05-03 00:13:44,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [660947397] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:44,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:44,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:13:44,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823211952] [2021-05-03 00:13:44,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:13:44,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:13:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:13:44,520 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:50,087 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-05-03 00:13:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-03 00:13:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:50,088 INFO L225 Difference]: With dead ends: 146 [2021-05-03 00:13:50,088 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:13:50,089 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 4482.5ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:13:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:13:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-03 00:13:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0227272727272727) internal successors, (135), 132 states have internal predecessors, (135), 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:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2021-05-03 00:13:50,095 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 131 [2021-05-03 00:13:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:50,095 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2021-05-03 00:13:50,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2021-05-03 00:13:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-03 00:13:50,096 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:50,096 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:50,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:13:50,096 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2070036115, now seen corresponding path program 61 times [2021-05-03 00:13:50,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:50,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [576165278] [2021-05-03 00:13:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:50,099 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2143 500000) (< v_main_~x~0_2143 999999)) InVars {main_~x~0=v_main_~x~0_2143} OutVars{main_~x~0=v_main_~x~0_2143} AuxVars[] AssignedVars[] [2021-05-03 00:13:50,100 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:50,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:50,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:50,116 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:50,127 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:50,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2145 500000) InVars {main_~x~0=v_main_~x~0_2145} OutVars{main_~x~0=v_main_~x~0_2145} AuxVars[] AssignedVars[] [2021-05-03 00:13:50,129 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:50,130 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:50,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:50,150 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:50,162 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:50,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:50,194 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:52,152 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:52,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [576165278] [2021-05-03 00:13:52,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [576165278] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:52,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:52,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:13:52,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395074258] [2021-05-03 00:13:52,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:13:52,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:13:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:13:52,153 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 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:13:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:57,903 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2021-05-03 00:13:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:13:57,903 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 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 133 [2021-05-03 00:13:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:57,904 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:13:57,904 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:13:57,905 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 4659.8ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:13:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:13:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:13:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0223880597014925) internal successors, (137), 134 states have internal predecessors, (137), 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:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2021-05-03 00:13:57,911 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 133 [2021-05-03 00:13:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:57,911 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2021-05-03 00:13:57,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 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:13:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2021-05-03 00:13:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-03 00:13:57,911 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:57,912 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:57,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-03 00:13:57,912 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1573759472, now seen corresponding path program 62 times [2021-05-03 00:13:57,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:57,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863130473] [2021-05-03 00:13:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:57,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2209 500000) (< v_main_~x~0_2209 999999)) InVars {main_~x~0=v_main_~x~0_2209} OutVars{main_~x~0=v_main_~x~0_2209} AuxVars[] AssignedVars[] [2021-05-03 00:13:57,917 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:57,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:57,922 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:57,934 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:57,944 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:57,945 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2211 500000) InVars {main_~x~0=v_main_~x~0_2211} OutVars{main_~x~0=v_main_~x~0_2211} AuxVars[] AssignedVars[] [2021-05-03 00:13:57,946 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:57,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:57,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:57,980 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:57,991 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:58,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:58,032 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:00,152 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:00,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863130473] [2021-05-03 00:14:00,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863130473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:00,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:00,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-03 00:14:00,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547771589] [2021-05-03 00:14:00,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-03 00:14:00,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-03 00:14:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:14:00,154 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states 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:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:06,110 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-05-03 00:14:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:14:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 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 135 [2021-05-03 00:14:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:06,111 INFO L225 Difference]: With dead ends: 150 [2021-05-03 00:14:06,111 INFO L226 Difference]: Without dead ends: 141 [2021-05-03 00:14:06,112 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 57 SyntacticMatches, 13 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 4903.6ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:14:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-03 00:14:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-03 00:14:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0220588235294117) internal successors, (139), 136 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:14:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2021-05-03 00:14:06,118 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 135 [2021-05-03 00:14:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:06,118 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2021-05-03 00:14:06,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states 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:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2021-05-03 00:14:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:14:06,119 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:06,119 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:06,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:14:06,119 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1393275405, now seen corresponding path program 63 times [2021-05-03 00:14:06,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:06,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408561489] [2021-05-03 00:14:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:06,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2276 999999) (< v_main_~x~0_2276 500000)) InVars {main_~x~0=v_main_~x~0_2276} OutVars{main_~x~0=v_main_~x~0_2276} AuxVars[] AssignedVars[] [2021-05-03 00:14:06,124 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:06,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:06,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:06,141 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:06,151 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:06,152 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2278 500000) InVars {main_~x~0=v_main_~x~0_2278} OutVars{main_~x~0=v_main_~x~0_2278} AuxVars[] AssignedVars[] [2021-05-03 00:14:06,153 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:06,154 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:06,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:06,171 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:06,181 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:06,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:06,212 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:08,254 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:08,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408561489] [2021-05-03 00:14:08,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [408561489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:08,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:08,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:14:08,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119365403] [2021-05-03 00:14:08,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:14:08,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:14:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:14:08,256 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:14,423 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2021-05-03 00:14:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:14:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-03 00:14:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:14,424 INFO L225 Difference]: With dead ends: 152 [2021-05-03 00:14:14,424 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:14:14,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2161 ImplicationChecksByTransitivity, 4920.4ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:14:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:14:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-03 00:14:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 138 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:14:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2021-05-03 00:14:14,432 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 137 [2021-05-03 00:14:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:14,432 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2021-05-03 00:14:14,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2021-05-03 00:14:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-03 00:14:14,432 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:14,433 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:14,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-03 00:14:14,433 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -253221142, now seen corresponding path program 64 times [2021-05-03 00:14:14,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:14,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559757620] [2021-05-03 00:14:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:14,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2344 999999) (< v_main_~x~0_2344 500000)) InVars {main_~x~0=v_main_~x~0_2344} OutVars{main_~x~0=v_main_~x~0_2344} AuxVars[] AssignedVars[] [2021-05-03 00:14:14,449 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:14,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:14,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:14,466 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:14,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:14,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2346 500000) InVars {main_~x~0=v_main_~x~0_2346} OutVars{main_~x~0=v_main_~x~0_2346} AuxVars[] AssignedVars[] [2021-05-03 00:14:14,479 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:14,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:14,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:14,496 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:14,507 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:14,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:14,542 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:16,730 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:16,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559757620] [2021-05-03 00:14:16,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559757620] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:16,730 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:16,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:14:16,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804559650] [2021-05-03 00:14:16,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:14:16,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:14:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:14:16,731 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states 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:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:23,206 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2021-05-03 00:14:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:14:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 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:14:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:23,207 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:14:23,207 INFO L226 Difference]: Without dead ends: 145 [2021-05-03 00:14:23,208 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 5220.3ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:14:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-03 00:14:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-03 00:14:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0214285714285714) internal successors, (143), 140 states have internal predecessors, (143), 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:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2021-05-03 00:14:23,216 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 139 [2021-05-03 00:14:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2021-05-03 00:14:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states 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:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2021-05-03 00:14:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-03 00:14:23,217 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:23,217 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:23,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-03 00:14:23,217 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1988437881, now seen corresponding path program 65 times [2021-05-03 00:14:23,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:23,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2092913071] [2021-05-03 00:14:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:23,224 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2413 500000) (< v_main_~x~0_2413 999999)) InVars {main_~x~0=v_main_~x~0_2413} OutVars{main_~x~0=v_main_~x~0_2413} AuxVars[] AssignedVars[] [2021-05-03 00:14:23,228 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:23,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:23,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:23,247 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:23,258 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:23,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2415 500000) InVars {main_~x~0=v_main_~x~0_2415} OutVars{main_~x~0=v_main_~x~0_2415} AuxVars[] AssignedVars[] [2021-05-03 00:14:23,261 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:23,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:23,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:23,280 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:23,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:23,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:23,329 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:25,574 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:25,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2092913071] [2021-05-03 00:14:25,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2092913071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:25,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:25,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:14:25,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715546571] [2021-05-03 00:14:25,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:14:25,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:14:25,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:14:25,575 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 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:14:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:32,307 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2021-05-03 00:14:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:14:32,308 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 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 141 [2021-05-03 00:14:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:32,309 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:14:32,309 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:14:32,310 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 5395.3ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:14:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:14:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-03 00:14:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0211267605633803) internal successors, (145), 142 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2021-05-03 00:14:32,317 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 141 [2021-05-03 00:14:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2021-05-03 00:14:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 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:14:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2021-05-03 00:14:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:14:32,318 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:32,318 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:32,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:14:32,318 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1210554084, now seen corresponding path program 66 times [2021-05-03 00:14:32,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:32,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691423665] [2021-05-03 00:14:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:32,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2483 999999) (< v_main_~x~0_2483 500000)) InVars {main_~x~0=v_main_~x~0_2483} OutVars{main_~x~0=v_main_~x~0_2483} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,325 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:32,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,344 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:32,354 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:32,356 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2485 500000) InVars {main_~x~0=v_main_~x~0_2485} OutVars{main_~x~0=v_main_~x~0_2485} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,357 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:32,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,375 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:32,386 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:32,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:34,794 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:34,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691423665] [2021-05-03 00:14:34,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1691423665] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:34,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:34,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-03 00:14:34,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401937223] [2021-05-03 00:14:34,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-03 00:14:34,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-03 00:14:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:14:34,795 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:41,899 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2021-05-03 00:14:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-03 00:14:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-03 00:14:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:41,900 INFO L225 Difference]: With dead ends: 158 [2021-05-03 00:14:41,900 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:14:41,901 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 5687.6ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:14:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:14:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:14:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0208333333333333) internal successors, (147), 144 states have internal predecessors, (147), 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:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2021-05-03 00:14:41,908 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 143 [2021-05-03 00:14:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:41,908 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2021-05-03 00:14:41,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2021-05-03 00:14:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-03 00:14:41,909 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:41,909 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:41,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:14:41,909 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash 245248513, now seen corresponding path program 67 times [2021-05-03 00:14:41,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:41,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285819851] [2021-05-03 00:14:41,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:41,913 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2554 500000) (< v_main_~x~0_2554 999999)) InVars {main_~x~0=v_main_~x~0_2554} OutVars{main_~x~0=v_main_~x~0_2554} AuxVars[] AssignedVars[] [2021-05-03 00:14:41,915 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:41,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:41,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:41,934 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:41,949 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:41,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2556 500000) InVars {main_~x~0=v_main_~x~0_2556} OutVars{main_~x~0=v_main_~x~0_2556} AuxVars[] AssignedVars[] [2021-05-03 00:14:41,952 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:41,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:41,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:41,971 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:41,982 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,015 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:44,642 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:44,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285819851] [2021-05-03 00:14:44,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [285819851] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:44,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:44,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:14:44,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882288190] [2021-05-03 00:14:44,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:14:44,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:14:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:14:44,644 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states 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:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:52,094 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-05-03 00:14:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:14:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 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 145 [2021-05-03 00:14:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:52,096 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:14:52,096 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:14:52,097 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 6082.9ms TimeCoverageRelationStatistics Valid=553, Invalid=19187, Unknown=0, NotChecked=0, Total=19740 [2021-05-03 00:14:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:14:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-03 00:14:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0205479452054795) internal successors, (149), 146 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:14:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2021-05-03 00:14:52,103 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 145 [2021-05-03 00:14:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:52,104 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2021-05-03 00:14:52,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states 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:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2021-05-03 00:14:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-03 00:14:52,104 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:52,104 INFO L523 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:52,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-05-03 00:14:52,104 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 299530718, now seen corresponding path program 68 times [2021-05-03 00:14:52,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:52,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718011525] [2021-05-03 00:14:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:52,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2626 999999) (< v_main_~x~0_2626 500000)) InVars {main_~x~0=v_main_~x~0_2626} OutVars{main_~x~0=v_main_~x~0_2626} AuxVars[] AssignedVars[] [2021-05-03 00:14:52,110 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:52,117 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:52,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:52,129 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:52,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:52,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2628 500000) InVars {main_~x~0=v_main_~x~0_2628} OutVars{main_~x~0=v_main_~x~0_2628} AuxVars[] AssignedVars[] [2021-05-03 00:14:52,144 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:52,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:52,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:52,162 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:52,173 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:52,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:52,213 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:54,965 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:54,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718011525] [2021-05-03 00:14:54,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [718011525] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:54,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:54,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-03 00:14:54,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448947357] [2021-05-03 00:14:54,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-03 00:14:54,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-03 00:14:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:14:54,967 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 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:15:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:02,614 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2021-05-03 00:15:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-03 00:15:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 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 147 [2021-05-03 00:15:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:02,615 INFO L225 Difference]: With dead ends: 162 [2021-05-03 00:15:02,615 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:15:02,616 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 6284.3ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:15:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:15:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-03 00:15:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0202702702702702) internal successors, (151), 148 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2021-05-03 00:15:02,623 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 147 [2021-05-03 00:15:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:02,623 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2021-05-03 00:15:02,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 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:15:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2021-05-03 00:15:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:15:02,624 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:02,624 INFO L523 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:02,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:15:02,624 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 925122171, now seen corresponding path program 69 times [2021-05-03 00:15:02,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:02,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364083707] [2021-05-03 00:15:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:02,632 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2699 999999) (< v_main_~x~0_2699 500000)) InVars {main_~x~0=v_main_~x~0_2699} OutVars{main_~x~0=v_main_~x~0_2699} AuxVars[] AssignedVars[] [2021-05-03 00:15:02,633 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:02,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:02,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:02,661 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:02,672 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:02,678 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2701 500000) InVars {main_~x~0=v_main_~x~0_2701} OutVars{main_~x~0=v_main_~x~0_2701} AuxVars[] AssignedVars[] [2021-05-03 00:15:02,679 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:02,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:02,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:02,699 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:02,714 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:02,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:02,751 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:05,564 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:05,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364083707] [2021-05-03 00:15:05,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [364083707] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:05,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:05,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:15:05,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506195451] [2021-05-03 00:15:05,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:15:05,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:15:05,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:15:05,566 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:14,120 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2021-05-03 00:15:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:15:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-03 00:15:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:14,127 INFO L225 Difference]: With dead ends: 164 [2021-05-03 00:15:14,127 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:15:14,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 6749.7ms TimeCoverageRelationStatistics Valid=569, Invalid=20311, Unknown=0, NotChecked=0, Total=20880 [2021-05-03 00:15:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:15:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-03 00:15:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.02) internal successors, (153), 150 states have internal predecessors, (153), 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:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2021-05-03 00:15:14,135 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 149 [2021-05-03 00:15:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:14,135 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2021-05-03 00:15:14,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2021-05-03 00:15:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-03 00:15:14,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:14,136 INFO L523 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:14,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-03 00:15:14,136 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:14,136 INFO L82 PathProgramCache]: Analyzing trace with hash 823087064, now seen corresponding path program 70 times [2021-05-03 00:15:14,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:14,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726777762] [2021-05-03 00:15:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:14,152 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2773 999999) (< v_main_~x~0_2773 500000)) InVars {main_~x~0=v_main_~x~0_2773} OutVars{main_~x~0=v_main_~x~0_2773} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,154 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:14,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,168 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:14,175 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:14,187 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:14,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2775 500000) InVars {main_~x~0=v_main_~x~0_2775} OutVars{main_~x~0=v_main_~x~0_2775} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,204 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:14,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,217 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:14,224 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:14,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:14,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:14,277 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:17,409 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:17,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726777762] [2021-05-03 00:15:17,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1726777762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:17,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:17,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-03 00:15:17,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961524882] [2021-05-03 00:15:17,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-03 00:15:17,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-03 00:15:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2021-05-03 00:15:17,410 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states 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,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:26,070 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2021-05-03 00:15:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-03 00:15:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 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 151 [2021-05-03 00:15:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:26,072 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:15:26,072 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:15:26,073 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 62 SyntacticMatches, 15 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 7139.7ms TimeCoverageRelationStatistics Valid=577, Invalid=20885, Unknown=0, NotChecked=0, Total=21462 [2021-05-03 00:15:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:15:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-03 00:15:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.019736842105263) internal successors, (155), 152 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:15:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2021-05-03 00:15:26,081 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 151 [2021-05-03 00:15:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2021-05-03 00:15:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states 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,081 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2021-05-03 00:15:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-03 00:15:26,082 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:26,082 INFO L523 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:26,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-03 00:15:26,082 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1551597045, now seen corresponding path program 71 times [2021-05-03 00:15:26,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:26,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636818587] [2021-05-03 00:15:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:26,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2848 500000) (< v_main_~x~0_2848 999999)) InVars {main_~x~0=v_main_~x~0_2848} OutVars{main_~x~0=v_main_~x~0_2848} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,089 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:26,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,110 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:26,121 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:26,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2850 500000) InVars {main_~x~0=v_main_~x~0_2850} OutVars{main_~x~0=v_main_~x~0_2850} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,124 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:26,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,153 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:26,164 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:26,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:26,201 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:29,383 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:29,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636818587] [2021-05-03 00:15:29,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1636818587] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:29,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:29,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-03 00:15:29,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403918376] [2021-05-03 00:15:29,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-03 00:15:29,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-03 00:15:29,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:15:29,384 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states 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:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:38,848 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2021-05-03 00:15:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-03 00:15:38,849 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 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 153 [2021-05-03 00:15:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:38,850 INFO L225 Difference]: With dead ends: 168 [2021-05-03 00:15:38,850 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:15:38,851 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 62 SyntacticMatches, 17 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 7573.4ms TimeCoverageRelationStatistics Valid=585, Invalid=21467, Unknown=0, NotChecked=0, Total=22052 [2021-05-03 00:15:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:15:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-03 00:15:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2021-05-03 00:15:38,858 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 153 [2021-05-03 00:15:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:38,858 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2021-05-03 00:15:38,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states 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:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2021-05-03 00:15:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:15:38,859 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:38,859 INFO L523 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:38,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:15:38,859 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1570019538, now seen corresponding path program 72 times [2021-05-03 00:15:38,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:38,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800335811] [2021-05-03 00:15:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:38,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2924 999999) (< v_main_~x~0_2924 500000)) InVars {main_~x~0=v_main_~x~0_2924} OutVars{main_~x~0=v_main_~x~0_2924} AuxVars[] AssignedVars[] [2021-05-03 00:15:38,874 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:38,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:38,888 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:38,895 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:38,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:38,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2926 500000) InVars {main_~x~0=v_main_~x~0_2926} OutVars{main_~x~0=v_main_~x~0_2926} AuxVars[] AssignedVars[] [2021-05-03 00:15:38,911 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:38,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:38,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:38,932 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:38,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:38,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:38,990 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:42,297 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:42,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800335811] [2021-05-03 00:15:42,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [800335811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:42,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:42,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-03 00:15:42,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583884970] [2021-05-03 00:15:42,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-03 00:15:42,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-03 00:15:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:15:42,299 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:52,980 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2021-05-03 00:15:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-03 00:15:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2021-05-03 00:15:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:52,981 INFO L225 Difference]: With dead ends: 170 [2021-05-03 00:15:52,982 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:15:52,983 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 8186.2ms TimeCoverageRelationStatistics Valid=593, Invalid=22057, Unknown=0, NotChecked=0, Total=22650 [2021-05-03 00:15:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:15:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-03 00:15:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0192307692307692) internal successors, (159), 156 states have internal predecessors, (159), 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:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2021-05-03 00:15:52,990 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 155 [2021-05-03 00:15:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:52,991 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2021-05-03 00:15:52,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2021-05-03 00:15:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-05-03 00:15:52,991 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:52,991 INFO L523 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:52,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:15:52,992 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2094166127, now seen corresponding path program 73 times [2021-05-03 00:15:52,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:52,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358655824] [2021-05-03 00:15:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:52,997 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3001 999999) (< v_main_~x~0_3001 500000)) InVars {main_~x~0=v_main_~x~0_3001} OutVars{main_~x~0=v_main_~x~0_3001} AuxVars[] AssignedVars[] [2021-05-03 00:15:52,999 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:53,000 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:53,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:53,025 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:53,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:53,044 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3003 500000) InVars {main_~x~0=v_main_~x~0_3003} OutVars{main_~x~0=v_main_~x~0_3003} AuxVars[] AssignedVars[] [2021-05-03 00:15:53,045 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:53,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:53,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:53,070 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:53,089 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,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:15:56,828 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:56,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358655824] [2021-05-03 00:15:56,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [358655824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:56,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:56,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:15:56,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338632261] [2021-05-03 00:15:56,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:15:56,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:15:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:15:56,829 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states 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:16:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:07,015 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2021-05-03 00:16:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-03 00:16:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 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 157 [2021-05-03 00:16:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:07,017 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:16:07,017 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:16:07,018 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 8413.4ms TimeCoverageRelationStatistics Valid=601, Invalid=22655, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:16:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:16:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-03 00:16:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.018987341772152) internal successors, (161), 158 states have internal predecessors, (161), 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:16:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2021-05-03 00:16:07,027 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 157 [2021-05-03 00:16:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:07,027 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2021-05-03 00:16:07,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states 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:16:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2021-05-03 00:16:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-05-03 00:16:07,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:07,027 INFO L523 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:07,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-05-03 00:16:07,028 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1007102772, now seen corresponding path program 74 times [2021-05-03 00:16:07,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:07,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524347917] [2021-05-03 00:16:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:07,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3079 500000) (< v_main_~x~0_3079 999999)) InVars {main_~x~0=v_main_~x~0_3079} OutVars{main_~x~0=v_main_~x~0_3079} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,035 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:07,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:07,058 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:07,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:07,074 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3081 500000) InVars {main_~x~0=v_main_~x~0_3081} OutVars{main_~x~0=v_main_~x~0_3081} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,075 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:07,085 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,091 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:07,099 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:07,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,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:16:10,897 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:10,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524347917] [2021-05-03 00:16:10,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1524347917] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:10,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:10,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:16:10,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651468114] [2021-05-03 00:16:10,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:16:10,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:16:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:16:10,898 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states 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:16:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:21,920 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2021-05-03 00:16:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:16:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 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 159 [2021-05-03 00:16:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:21,922 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:16:21,922 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:16:21,923 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 8772.3ms TimeCoverageRelationStatistics Valid=609, Invalid=23261, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:16:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:16:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:16:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.01875) internal successors, (163), 160 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2021-05-03 00:16:21,935 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 159 [2021-05-03 00:16:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:21,935 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2021-05-03 00:16:21,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states 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:16:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2021-05-03 00:16:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:16:21,936 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:21,936 INFO L523 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:21,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:16:21,936 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -619211287, now seen corresponding path program 75 times [2021-05-03 00:16:21,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:21,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412600633] [2021-05-03 00:16:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:21,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3158 999999) (< v_main_~x~0_3158 500000)) InVars {main_~x~0=v_main_~x~0_3158} OutVars{main_~x~0=v_main_~x~0_3158} AuxVars[] AssignedVars[] [2021-05-03 00:16:21,942 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:21,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:21,965 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:21,981 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:21,983 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3160 500000) InVars {main_~x~0=v_main_~x~0_3160} OutVars{main_~x~0=v_main_~x~0_3160} AuxVars[] AssignedVars[] [2021-05-03 00:16:21,984 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:21,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:22,008 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:22,021 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,060 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:16:25,799 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:25,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412600633] [2021-05-03 00:16:25,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [412600633] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:25,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:25,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:16:25,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776125534] [2021-05-03 00:16:25,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:16:25,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:16:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:16:25,801 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:36,978 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2021-05-03 00:16:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:16:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2021-05-03 00:16:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:36,980 INFO L225 Difference]: With dead ends: 176 [2021-05-03 00:16:36,980 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:16:36,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 71 SyntacticMatches, 12 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3023 ImplicationChecksByTransitivity, 8821.0ms TimeCoverageRelationStatistics Valid=617, Invalid=23875, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:16:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:16:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:16:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0185185185185186) internal successors, (165), 162 states have internal predecessors, (165), 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:16:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2021-05-03 00:16:36,989 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 161 [2021-05-03 00:16:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:36,989 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2021-05-03 00:16:36,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2021-05-03 00:16:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:16:36,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:36,990 INFO L523 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:36,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-03 00:16:36,990 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:36,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1517648954, now seen corresponding path program 76 times [2021-05-03 00:16:36,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:36,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1146308113] [2021-05-03 00:16:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:36,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3238 999999) (< v_main_~x~0_3238 500000)) InVars {main_~x~0=v_main_~x~0_3238} OutVars{main_~x~0=v_main_~x~0_3238} AuxVars[] AssignedVars[] [2021-05-03 00:16:37,006 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:37,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:37,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:37,030 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:37,043 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:37,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3240 500000) InVars {main_~x~0=v_main_~x~0_3240} OutVars{main_~x~0=v_main_~x~0_3240} AuxVars[] AssignedVars[] [2021-05-03 00:16:37,046 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:37,055 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:37,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:37,069 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:37,082 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:37,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:37,133 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:16:40,741 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:40,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1146308113] [2021-05-03 00:16:40,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1146308113] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:40,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:40,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:16:40,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492097985] [2021-05-03 00:16:40,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:16:40,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:16:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:16:40,743 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states 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:16:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:52,343 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2021-05-03 00:16:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:16:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 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 163 [2021-05-03 00:16:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:52,345 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:16:52,345 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:16:52,346 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 71 SyntacticMatches, 13 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 8953.8ms TimeCoverageRelationStatistics Valid=625, Invalid=24497, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:16:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:16:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:16:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.0182926829268293) internal successors, (167), 164 states have internal predecessors, (167), 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:16:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2021-05-03 00:16:52,353 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 163 [2021-05-03 00:16:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:52,353 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2021-05-03 00:16:52,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states 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:16:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2021-05-03 00:16:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-05-03 00:16:52,354 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:52,354 INFO L523 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:52,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:16:52,354 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:52,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1627820445, now seen corresponding path program 77 times [2021-05-03 00:16:52,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:52,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1659188795] [2021-05-03 00:16:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:52,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3319 500000) (< v_main_~x~0_3319 999999)) InVars {main_~x~0=v_main_~x~0_3319} OutVars{main_~x~0=v_main_~x~0_3319} AuxVars[] AssignedVars[] [2021-05-03 00:16:52,362 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:52,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:52,388 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:52,402 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:52,404 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3321 500000) InVars {main_~x~0=v_main_~x~0_3321} OutVars{main_~x~0=v_main_~x~0_3321} AuxVars[] AssignedVars[] [2021-05-03 00:16:52,405 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:52,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:52,430 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:52,444 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:52,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:52,491 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:16:56,718 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:56,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1659188795] [2021-05-03 00:16:56,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1659188795] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:56,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:56,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:16:56,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153787797] [2021-05-03 00:16:56,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:16:56,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:56,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:16:56,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:16:56,719 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states 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:17:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:10,049 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2021-05-03 00:17:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:17:10,051 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 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 165 [2021-05-03 00:17:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:10,051 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:17:10,051 INFO L226 Difference]: Without dead ends: 171 [2021-05-03 00:17:10,052 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3178 ImplicationChecksByTransitivity, 10203.3ms TimeCoverageRelationStatistics Valid=633, Invalid=25127, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:17:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-03 00:17:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-03 00:17:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0180722891566265) internal successors, (169), 166 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:17:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2021-05-03 00:17:10,060 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 165 [2021-05-03 00:17:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:10,060 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2021-05-03 00:17:10,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states 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:17:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2021-05-03 00:17:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:17:10,061 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:10,061 INFO L523 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:10,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:17:10,061 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:10,061 INFO L82 PathProgramCache]: Analyzing trace with hash -128440896, now seen corresponding path program 78 times [2021-05-03 00:17:10,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:10,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653638864] [2021-05-03 00:17:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:10,066 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3401 999999) (< v_main_~x~0_3401 500000)) InVars {main_~x~0=v_main_~x~0_3401} OutVars{main_~x~0=v_main_~x~0_3401} AuxVars[] AssignedVars[] [2021-05-03 00:17:10,077 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:10,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,085 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:10,103 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:10,118 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:10,121 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3403 500000) InVars {main_~x~0=v_main_~x~0_3403} OutVars{main_~x~0=v_main_~x~0_3403} AuxVars[] AssignedVars[] [2021-05-03 00:17:10,123 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:10,133 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:10,151 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:10,168 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:10,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:10,222 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:17:14,897 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:14,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653638864] [2021-05-03 00:17:14,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1653638864] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:14,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:14,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:17:14,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745090044] [2021-05-03 00:17:14,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:17:14,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:17:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:17:14,899 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:27,698 INFO L93 Difference]: Finished difference Result 182 states and 188 transitions. [2021-05-03 00:17:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:17:27,699 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2021-05-03 00:17:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:27,700 INFO L225 Difference]: With dead ends: 182 [2021-05-03 00:17:27,700 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:17:27,701 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 76 SyntacticMatches, 10 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3256 ImplicationChecksByTransitivity, 10451.7ms TimeCoverageRelationStatistics Valid=641, Invalid=25765, Unknown=0, NotChecked=0, Total=26406 [2021-05-03 00:17:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:17:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-03 00:17:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0178571428571428) internal successors, (171), 168 states have internal predecessors, (171), 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:17:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2021-05-03 00:17:27,708 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 167 [2021-05-03 00:17:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:27,709 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2021-05-03 00:17:27,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2021-05-03 00:17:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:17:27,709 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:27,709 INFO L523 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:27,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:17:27,710 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1961261533, now seen corresponding path program 79 times [2021-05-03 00:17:27,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:27,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1878793999] [2021-05-03 00:17:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:27,715 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3484 999999) (< v_main_~x~0_3484 500000)) InVars {main_~x~0=v_main_~x~0_3484} OutVars{main_~x~0=v_main_~x~0_3484} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,717 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:27,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:27,744 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:27,761 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:27,764 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3486 500000) InVars {main_~x~0=v_main_~x~0_3486} OutVars{main_~x~0=v_main_~x~0_3486} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,765 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:27,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:27,794 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:27,810 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,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:17:32,564 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:32,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1878793999] [2021-05-03 00:17:32,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1878793999] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:32,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:32,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2021-05-03 00:17:32,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900779759] [2021-05-03 00:17:32,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2021-05-03 00:17:32,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-05-03 00:17:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:17:32,566 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 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:17:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:48,606 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2021-05-03 00:17:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-03 00:17:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 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 169 [2021-05-03 00:17:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:48,608 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:17:48,608 INFO L226 Difference]: Without dead ends: 175 [2021-05-03 00:17:48,609 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3345 ImplicationChecksByTransitivity, 11859.2ms TimeCoverageRelationStatistics Valid=649, Invalid=26411, Unknown=0, NotChecked=0, Total=27060 [2021-05-03 00:17:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-05-03 00:17:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-05-03 00:17:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.0176470588235293) internal successors, (173), 170 states have internal predecessors, (173), 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:17:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2021-05-03 00:17:48,618 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 169 [2021-05-03 00:17:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:48,618 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2021-05-03 00:17:48,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 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:17:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2021-05-03 00:17:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-05-03 00:17:48,619 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:48,619 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:48,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-05-03 00:17:48,619 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 120601274, now seen corresponding path program 80 times [2021-05-03 00:17:48,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:48,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290213302] [2021-05-03 00:17:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:48,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3568 500000) (< v_main_~x~0_3568 999999)) InVars {main_~x~0=v_main_~x~0_3568} OutVars{main_~x~0=v_main_~x~0_3568} AuxVars[] AssignedVars[] [2021-05-03 00:17:48,627 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:48,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:48,664 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:48,686 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:48,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3570 500000) InVars {main_~x~0=v_main_~x~0_3570} OutVars{main_~x~0=v_main_~x~0_3570} AuxVars[] AssignedVars[] [2021-05-03 00:17:48,690 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:48,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:48,731 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:48,754 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:48,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:48,810 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:17:54,675 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:54,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290213302] [2021-05-03 00:17:54,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1290213302] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:54,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:54,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:17:54,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225602314] [2021-05-03 00:17:54,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:17:54,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:17:54,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:17:54,677 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 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:18:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:12,767 INFO L93 Difference]: Finished difference Result 186 states and 192 transitions. [2021-05-03 00:18:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-03 00:18:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 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 171 [2021-05-03 00:18:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:12,769 INFO L225 Difference]: With dead ends: 186 [2021-05-03 00:18:12,769 INFO L226 Difference]: Without dead ends: 177 [2021-05-03 00:18:12,771 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 13649.9ms TimeCoverageRelationStatistics Valid=657, Invalid=27065, Unknown=0, NotChecked=0, Total=27722 [2021-05-03 00:18:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-03 00:18:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-05-03 00:18:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2021-05-03 00:18:12,779 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 171 [2021-05-03 00:18:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:12,780 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2021-05-03 00:18:12,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 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:18:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2021-05-03 00:18:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:18:12,780 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:12,780 INFO L523 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:12,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:18:12,781 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 772618327, now seen corresponding path program 81 times [2021-05-03 00:18:12,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:12,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983389546] [2021-05-03 00:18:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:12,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3653 999999) (< v_main_~x~0_3653 500000)) InVars {main_~x~0=v_main_~x~0_3653} OutVars{main_~x~0=v_main_~x~0_3653} AuxVars[] AssignedVars[] [2021-05-03 00:18:12,789 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:18:12,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:12,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:12,822 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:18:12,839 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:12,842 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3655 500000) InVars {main_~x~0=v_main_~x~0_3655} OutVars{main_~x~0=v_main_~x~0_3655} AuxVars[] AssignedVars[] [2021-05-03 00:18:12,843 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:18:12,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:12,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:12,874 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:18:12,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:12,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:12,941 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:18:18,947 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:18,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983389546] [2021-05-03 00:18:18,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [983389546] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:18,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:18,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2021-05-03 00:18:18,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600943212] [2021-05-03 00:18:18,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2021-05-03 00:18:18,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-05-03 00:18:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:18:18,949 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:37,715 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2021-05-03 00:18:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-03 00:18:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2021-05-03 00:18:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:37,717 INFO L225 Difference]: With dead ends: 188 [2021-05-03 00:18:37,717 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:18:37,718 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 72 SyntacticMatches, 17 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3516 ImplicationChecksByTransitivity, 14168.6ms TimeCoverageRelationStatistics Valid=665, Invalid=27727, Unknown=0, NotChecked=0, Total=28392 [2021-05-03 00:18:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:18:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-05-03 00:18:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.0172413793103448) internal successors, (177), 174 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:18:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2021-05-03 00:18:37,726 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 173 [2021-05-03 00:18:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:37,726 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2021-05-03 00:18:37,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2021-05-03 00:18:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-05-03 00:18:37,727 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:37,727 INFO L523 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:37,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-03 00:18:37,727 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash 295781044, now seen corresponding path program 82 times [2021-05-03 00:18:37,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:37,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032156144] [2021-05-03 00:18:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:37,734 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3739 999999) (< v_main_~x~0_3739 500000)) InVars {main_~x~0=v_main_~x~0_3739} OutVars{main_~x~0=v_main_~x~0_3739} AuxVars[] AssignedVars[] [2021-05-03 00:18:37,736 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:18:37,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:37,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:37,770 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:18:37,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:37,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3741 500000) InVars {main_~x~0=v_main_~x~0_3741} OutVars{main_~x~0=v_main_~x~0_3741} AuxVars[] AssignedVars[] [2021-05-03 00:18:37,799 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:18:37,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:37,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:37,836 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:18:37,856 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:37,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:37,914 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:18:45,681 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:45,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032156144] [2021-05-03 00:18:45,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1032156144] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:45,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:45,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-03 00:18:45,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63043374] [2021-05-03 00:18:45,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-03 00:18:45,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-03 00:18:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2021-05-03 00:18:45,684 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states 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:19:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:05,887 INFO L93 Difference]: Finished difference Result 190 states and 196 transitions. [2021-05-03 00:19:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-03 00:19:05,889 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 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 175 [2021-05-03 00:19:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:05,890 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:19:05,890 INFO L226 Difference]: Without dead ends: 181 [2021-05-03 00:19:05,891 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 72 SyntacticMatches, 18 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3602 ImplicationChecksByTransitivity, 16414.9ms TimeCoverageRelationStatistics Valid=673, Invalid=28397, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:19:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-05-03 00:19:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-05-03 00:19:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0170454545454546) internal successors, (179), 176 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:19:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2021-05-03 00:19:05,899 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 175 [2021-05-03 00:19:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:05,900 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2021-05-03 00:19:05,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states 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:19:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2021-05-03 00:19:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-05-03 00:19:05,900 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:05,900 INFO L523 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:05,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-03 00:19:05,901 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1616652753, now seen corresponding path program 83 times [2021-05-03 00:19:05,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:05,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965941920] [2021-05-03 00:19:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:05,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3826 500000) (< v_main_~x~0_3826 999999)) InVars {main_~x~0=v_main_~x~0_3826} OutVars{main_~x~0=v_main_~x~0_3826} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,910 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:19:05,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:05,947 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:19:05,970 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:05,973 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3828 500000) InVars {main_~x~0=v_main_~x~0_3828} OutVars{main_~x~0=v_main_~x~0_3828} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,975 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:19:05,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,998 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:06,011 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:19:06,036 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:06,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:06,103 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:19:14,453 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:14,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [965941920] [2021-05-03 00:19:14,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [965941920] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:14,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:14,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-03 00:19:14,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903522641] [2021-05-03 00:19:14,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-03 00:19:14,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-03 00:19:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:19:14,454 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states 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:19:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:38,938 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2021-05-03 00:19:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-03 00:19:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 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:19:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:38,941 INFO L225 Difference]: With dead ends: 192 [2021-05-03 00:19:38,941 INFO L226 Difference]: Without dead ends: 183 [2021-05-03 00:19:38,942 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 77 SyntacticMatches, 14 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 18527.1ms TimeCoverageRelationStatistics Valid=681, Invalid=29075, Unknown=0, NotChecked=0, Total=29756 [2021-05-03 00:19:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-05-03 00:19:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-05-03 00:19:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.0168539325842696) internal successors, (181), 178 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2021-05-03 00:19:38,951 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 177 [2021-05-03 00:19:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:38,951 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2021-05-03 00:19:38,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states 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:19:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2021-05-03 00:19:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:19:38,952 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:38,952 INFO L523 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:38,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:19:38,952 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash -335954514, now seen corresponding path program 84 times [2021-05-03 00:19:38,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:38,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960512097] [2021-05-03 00:19:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:38,968 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3914 999999) (< v_main_~x~0_3914 500000)) InVars {main_~x~0=v_main_~x~0_3914} OutVars{main_~x~0=v_main_~x~0_3914} AuxVars[] AssignedVars[] [2021-05-03 00:19:38,970 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:19:38,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:39,022 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:19:39,049 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:39,051 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3916 500000) InVars {main_~x~0=v_main_~x~0_3916} OutVars{main_~x~0=v_main_~x~0_3916} AuxVars[] AssignedVars[] [2021-05-03 00:19:39,055 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:19:39,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:39,095 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:19:39,122 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,192 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:19:46,371 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:46,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960512097] [2021-05-03 00:19:46,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [960512097] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:46,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:46,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-03 00:19:46,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119333570] [2021-05-03 00:19:46,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-03 00:19:46,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-03 00:19:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:19:46,373 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:11,095 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions. [2021-05-03 00:20:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-03 00:20:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2021-05-03 00:20:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:11,099 INFO L225 Difference]: With dead ends: 194 [2021-05-03 00:20:11,099 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:20:11,100 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 17918.9ms TimeCoverageRelationStatistics Valid=689, Invalid=29761, Unknown=0, NotChecked=0, Total=30450 [2021-05-03 00:20:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:20:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-05-03 00:20:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.0166666666666666) internal successors, (183), 180 states have internal predecessors, (183), 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:20:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2021-05-03 00:20:11,110 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 179 [2021-05-03 00:20:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:11,110 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2021-05-03 00:20:11,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2021-05-03 00:20:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-05-03 00:20:11,111 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:11,111 INFO L523 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:11,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:20:11,111 INFO L428 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 109170251, now seen corresponding path program 85 times [2021-05-03 00:20:11,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:11,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409598489] [2021-05-03 00:20:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:11,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4003 500000) (< v_main_~x~0_4003 999999)) InVars {main_~x~0=v_main_~x~0_4003} OutVars{main_~x~0=v_main_~x~0_4003} AuxVars[] AssignedVars[] [2021-05-03 00:20:11,125 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:20:11,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:11,187 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:20:11,229 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:11,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4005 500000) InVars {main_~x~0=v_main_~x~0_4005} OutVars{main_~x~0=v_main_~x~0_4005} AuxVars[] AssignedVars[] [2021-05-03 00:20:11,237 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:20:11,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:11,292 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:20:11,320 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:11,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:11,407 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:20:22,021 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:22,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409598489] [2021-05-03 00:20:22,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1409598489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:22,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:22,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2021-05-03 00:20:22,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279610837] [2021-05-03 00:20:22,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2021-05-03 00:20:22,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-05-03 00:20:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:20:22,023 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states 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:20:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:53,088 INFO L93 Difference]: Finished difference Result 196 states and 202 transitions. [2021-05-03 00:20:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-05-03 00:20:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 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 181 [2021-05-03 00:20:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:53,092 INFO L225 Difference]: With dead ends: 196 [2021-05-03 00:20:53,093 INFO L226 Difference]: Without dead ends: 187 [2021-05-03 00:20:53,094 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 80 SyntacticMatches, 13 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 23179.6ms TimeCoverageRelationStatistics Valid=697, Invalid=30455, Unknown=0, NotChecked=0, Total=31152 [2021-05-03 00:20:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-03 00:20:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-05-03 00:20:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.0164835164835164) internal successors, (185), 182 states have internal predecessors, (185), 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:20:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2021-05-03 00:20:53,103 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 181 [2021-05-03 00:20:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:53,103 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2021-05-03 00:20:53,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states 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:20:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2021-05-03 00:20:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-05-03 00:20:53,104 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:53,105 INFO L523 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:53,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-05-03 00:20:53,105 INFO L428 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:53,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1622660184, now seen corresponding path program 86 times [2021-05-03 00:20:53,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:53,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12635898] [2021-05-03 00:20:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:53,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4093 999999) (< v_main_~x~0_4093 500000)) InVars {main_~x~0=v_main_~x~0_4093} OutVars{main_~x~0=v_main_~x~0_4093} AuxVars[] AssignedVars[] [2021-05-03 00:20:53,114 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:20:53,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:53,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:53,159 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:20:53,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:53,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4095 500000) InVars {main_~x~0=v_main_~x~0_4095} OutVars{main_~x~0=v_main_~x~0_4095} AuxVars[] AssignedVars[] [2021-05-03 00:20:53,200 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:20:53,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:53,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:53,260 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:20:53,287 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:53,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:53,355 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:21:03,953 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:03,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12635898] [2021-05-03 00:21:03,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [12635898] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:03,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:03,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-03 00:21:03,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173715108] [2021-05-03 00:21:03,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-03 00:21:03,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-03 00:21:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2021-05-03 00:21:03,955 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 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:21:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:33,053 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2021-05-03 00:21:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-05-03 00:21:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 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 183 [2021-05-03 00:21:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:33,055 INFO L225 Difference]: With dead ends: 198 [2021-05-03 00:21:33,055 INFO L226 Difference]: Without dead ends: 189 [2021-05-03 00:21:33,056 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 84 SyntacticMatches, 10 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3932 ImplicationChecksByTransitivity, 22692.9ms TimeCoverageRelationStatistics Valid=705, Invalid=31157, Unknown=0, NotChecked=0, Total=31862 [2021-05-03 00:21:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-05-03 00:21:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-05-03 00:21:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.016304347826087) internal successors, (187), 184 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:21:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2021-05-03 00:21:33,065 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 183 [2021-05-03 00:21:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:33,065 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2021-05-03 00:21:33,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 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:21:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2021-05-03 00:21:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-05-03 00:21:33,066 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:33,066 INFO L523 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:33,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:21:33,066 INFO L428 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash 535602629, now seen corresponding path program 87 times [2021-05-03 00:21:33,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:33,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001634685] [2021-05-03 00:21:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:33,078 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4184 999999) (< v_main_~x~0_4184 500000)) InVars {main_~x~0=v_main_~x~0_4184} OutVars{main_~x~0=v_main_~x~0_4184} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,086 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:21:33,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,108 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:33,121 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:21:33,141 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:33,144 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4186 500000) InVars {main_~x~0=v_main_~x~0_4186} OutVars{main_~x~0=v_main_~x~0_4186} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,146 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:21:33,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:33,179 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:21:33,199 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:33,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:33,263 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:21:44,719 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:44,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001634685] [2021-05-03 00:21:44,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1001634685] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:44,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:44,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2021-05-03 00:21:44,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835657651] [2021-05-03 00:21:44,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2021-05-03 00:21:44,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:44,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-05-03 00:21:44,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:21:44,721 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states 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:22:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:14,460 INFO L93 Difference]: Finished difference Result 200 states and 206 transitions. [2021-05-03 00:22:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-05-03 00:22:14,462 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 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 185 [2021-05-03 00:22:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:14,463 INFO L225 Difference]: With dead ends: 200 [2021-05-03 00:22:14,463 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:22:14,464 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 81 SyntacticMatches, 14 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4029 ImplicationChecksByTransitivity, 23616.4ms TimeCoverageRelationStatistics Valid=713, Invalid=31867, Unknown=0, NotChecked=0, Total=32580 [2021-05-03 00:22:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:22:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-05-03 00:22:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.0161290322580645) internal successors, (189), 186 states have internal predecessors, (189), 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:22:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2021-05-03 00:22:14,472 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 185 [2021-05-03 00:22:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:14,472 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2021-05-03 00:22:14,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states 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:22:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2021-05-03 00:22:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-05-03 00:22:14,473 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:14,473 INFO L523 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:14,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-03 00:22:14,473 INFO L428 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 156961954, now seen corresponding path program 88 times [2021-05-03 00:22:14,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:14,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285952750] [2021-05-03 00:22:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:14,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4276 500000) (< v_main_~x~0_4276 999999)) InVars {main_~x~0=v_main_~x~0_4276} OutVars{main_~x~0=v_main_~x~0_4276} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,481 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:22:14,497 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:14,520 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:22:14,539 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:14,541 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4278 500000) InVars {main_~x~0=v_main_~x~0_4278} OutVars{main_~x~0=v_main_~x~0_4278} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,542 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:22:14,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:14,578 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:22:14,601 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:14,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:21,559 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:21,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285952750] [2021-05-03 00:22:21,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [285952750] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:21,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:21,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2021-05-03 00:22:21,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266776772] [2021-05-03 00:22:21,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2021-05-03 00:22:21,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-05-03 00:22:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2021-05-03 00:22:21,561 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states 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:22:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:38,555 INFO L93 Difference]: Finished difference Result 202 states and 208 transitions. [2021-05-03 00:22:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-05-03 00:22:38,556 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 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:22:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:38,557 INFO L225 Difference]: With dead ends: 202 [2021-05-03 00:22:38,557 INFO L226 Difference]: Without dead ends: 193 [2021-05-03 00:22:38,558 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 82 SyntacticMatches, 13 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4117 ImplicationChecksByTransitivity, 14061.7ms TimeCoverageRelationStatistics Valid=721, Invalid=32585, Unknown=0, NotChecked=0, Total=33306 [2021-05-03 00:22:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-03 00:22:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-05-03 00:22:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 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:22:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2021-05-03 00:22:38,566 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 187 [2021-05-03 00:22:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:38,566 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2021-05-03 00:22:38,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states 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:22:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2021-05-03 00:22:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-05-03 00:22:38,567 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:38,567 INFO L523 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:38,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-03 00:22:38,567 INFO L428 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1355493439, now seen corresponding path program 89 times [2021-05-03 00:22:38,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:38,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397033420] [2021-05-03 00:22:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:38,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4369 999999) (< v_main_~x~0_4369 500000)) InVars {main_~x~0=v_main_~x~0_4369} OutVars{main_~x~0=v_main_~x~0_4369} AuxVars[] AssignedVars[] [2021-05-03 00:22:38,586 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:22:38,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:38,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:38,623 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:22:38,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:38,650 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4371 500000) InVars {main_~x~0=v_main_~x~0_4371} OutVars{main_~x~0=v_main_~x~0_4371} AuxVars[] AssignedVars[] [2021-05-03 00:22:38,652 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:22:38,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:38,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:38,695 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:22:38,718 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:38,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:38,768 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:22:46,308 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:46,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1397033420] [2021-05-03 00:22:46,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1397033420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:46,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:46,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2021-05-03 00:22:46,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062511606] [2021-05-03 00:22:46,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2021-05-03 00:22:46,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2021-05-03 00:22:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:22:46,310 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 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:23:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:13,357 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2021-05-03 00:23:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-05-03 00:23:13,359 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 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 189 [2021-05-03 00:23:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:13,360 INFO L225 Difference]: With dead ends: 204 [2021-05-03 00:23:13,360 INFO L226 Difference]: Without dead ends: 195 [2021-05-03 00:23:13,361 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 84 SyntacticMatches, 12 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4206 ImplicationChecksByTransitivity, 18777.7ms TimeCoverageRelationStatistics Valid=729, Invalid=33311, Unknown=0, NotChecked=0, Total=34040 [2021-05-03 00:23:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-05-03 00:23:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-05-03 00:23:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.0157894736842106) internal successors, (193), 190 states have internal predecessors, (193), 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:23:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2021-05-03 00:23:13,370 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 189 [2021-05-03 00:23:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:13,370 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2021-05-03 00:23:13,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 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:23:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2021-05-03 00:23:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-05-03 00:23:13,371 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:13,371 INFO L523 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:13,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:23:13,371 INFO L428 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2093015196, now seen corresponding path program 90 times [2021-05-03 00:23:13,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:13,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031033724] [2021-05-03 00:23:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:13,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4463 500000) (< v_main_~x~0_4463 999999)) InVars {main_~x~0=v_main_~x~0_4463} OutVars{main_~x~0=v_main_~x~0_4463} AuxVars[] AssignedVars[] [2021-05-03 00:23:13,381 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:23:13,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:13,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:13,421 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:23:13,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:13,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4465 500000) InVars {main_~x~0=v_main_~x~0_4465} OutVars{main_~x~0=v_main_~x~0_4465} AuxVars[] AssignedVars[] [2021-05-03 00:23:13,450 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:23:13,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:13,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:13,491 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:23:13,517 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:13,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:13,581 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:23:19,628 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:19,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031033724] [2021-05-03 00:23:19,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2031033724] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:19,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:19,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-03 00:23:19,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281378465] [2021-05-03 00:23:19,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-03 00:23:19,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-03 00:23:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2021-05-03 00:23:19,630 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 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:23:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:41,649 INFO L93 Difference]: Finished difference Result 206 states and 212 transitions. [2021-05-03 00:23:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-05-03 00:23:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 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 191 [2021-05-03 00:23:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:41,650 INFO L225 Difference]: With dead ends: 206 [2021-05-03 00:23:41,650 INFO L226 Difference]: Without dead ends: 197 [2021-05-03 00:23:41,652 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 86 SyntacticMatches, 11 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4296 ImplicationChecksByTransitivity, 15398.0ms TimeCoverageRelationStatistics Valid=737, Invalid=34045, Unknown=0, NotChecked=0, Total=34782 [2021-05-03 00:23:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-03 00:23:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-05-03 00:23:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.015625) internal successors, (195), 192 states have internal predecessors, (195), 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:23:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2021-05-03 00:23:41,660 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 191 [2021-05-03 00:23:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:41,660 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2021-05-03 00:23:41,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 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:23:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2021-05-03 00:23:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-05-03 00:23:41,661 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:41,661 INFO L523 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:41,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-03 00:23:41,661 INFO L428 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2113147463, now seen corresponding path program 91 times [2021-05-03 00:23:41,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:41,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155509614] [2021-05-03 00:23:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:41,666 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4558 500000) (< v_main_~x~0_4558 999999)) InVars {main_~x~0=v_main_~x~0_4558} OutVars{main_~x~0=v_main_~x~0_4558} AuxVars[] AssignedVars[] [2021-05-03 00:23:41,668 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:23:41,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:41,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:41,691 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:23:41,707 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:41,709 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4560 500000) InVars {main_~x~0=v_main_~x~0_4560} OutVars{main_~x~0=v_main_~x~0_4560} AuxVars[] AssignedVars[] [2021-05-03 00:23:41,711 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:23:41,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:41,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:41,736 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:23:41,749 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:41,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:41,791 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:23:49,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:49,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155509614] [2021-05-03 00:23:49,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1155509614] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:49,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:49,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2021-05-03 00:23:49,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091377616] [2021-05-03 00:23:49,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2021-05-03 00:23:49,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2021-05-03 00:23:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:23:49,514 INFO L87 Difference]: Start difference. First operand 197 states and 199 transitions. Second operand has 95 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 94 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)