/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:12:13,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:12:13,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:12:13,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:12:13,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:12:13,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:12:13,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:12:13,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:12:13,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:12:13,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:12:13,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:12:13,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:12:13,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:12:13,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:12:13,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:12:13,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:12:13,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:12:13,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:12:13,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:12:13,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:12:13,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:12:13,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:12:13,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:12:13,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:12:13,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:12:13,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:12:13,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:12:13,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:12:13,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:12:13,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:12:13,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:12:13,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:12:13,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:12:13,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:12:13,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:12:13,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:12:13,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:12:13,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:12:13,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:12:13,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:12:13,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:12:13,607 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:12:13,620 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:12:13,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:12:13,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:12:13,622 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:12:13,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:12:13,624 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:12:13,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:12:13,624 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:12:13,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:12:13,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:12:13,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:12:13,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:12:13,625 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:12:13,625 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:12:13,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:12:13,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:12:13,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:12:13,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:12:13,909 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:12:13,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2021-05-03 00:12:13,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71019a65/fb8b6872e7564ebfb39ff36d763d1371/FLAG6d8549ba7 [2021-05-03 00:12:14,293 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:12:14,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2021-05-03 00:12:14,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71019a65/fb8b6872e7564ebfb39ff36d763d1371/FLAG6d8549ba7 [2021-05-03 00:12:14,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71019a65/fb8b6872e7564ebfb39ff36d763d1371 [2021-05-03 00:12:14,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:12:14,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:12:14,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:14,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:12:14,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:12:14,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7951c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14, skipping insertion in model container [2021-05-03 00:12:14,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:12:14,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:12:14,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_8.c[318,331] [2021-05-03 00:12:14,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:14,905 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:12:14,914 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_8.c[318,331] [2021-05-03 00:12:14,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:14,926 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:12:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14 WrapperNode [2021-05-03 00:12:14,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:14,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:12:14,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:12:14,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:12:14,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:14,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (1/1) ... [2021-05-03 00:12:15,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:12:15,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:12:15,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:12:15,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:12:15,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (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:12:15,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:12:15,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:12:15,058 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:12:15,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:12:15,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:12:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:12:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:12:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:12:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:12:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:12:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:12:15,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:12:15,260 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:12:15,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:15 BoogieIcfgContainer [2021-05-03 00:12:15,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:12:15,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:12:15,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:12:15,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:12:15,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:12:14" (1/3) ... [2021-05-03 00:12:15,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6bb84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:15, skipping insertion in model container [2021-05-03 00:12:15,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:14" (2/3) ... [2021-05-03 00:12:15,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6bb84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:15, skipping insertion in model container [2021-05-03 00:12:15,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:15" (3/3) ... [2021-05-03 00:12:15,275 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2021-05-03 00:12:15,279 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:12:15,281 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:12:15,297 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:12:15,309 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:12:15,309 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:12:15,309 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:12:15,309 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:12:15,309 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:12:15,309 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:12:15,309 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:12:15,310 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:12:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:12:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:12:15,321 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:15,322 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:15,322 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2021-05-03 00:12:15,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:15,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153386505] [2021-05-03 00:12:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:15,366 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,482 INFO 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:15,483 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:15,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153386505] [2021-05-03 00:12:15,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1153386505] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:15,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:15,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:12:15,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700094042] [2021-05-03 00:12:15,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:12:15,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:15,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:12:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:15,502 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:15,576 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-05-03 00:12:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:12:15,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:12:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:15,582 INFO L225 Difference]: With dead ends: 33 [2021-05-03 00:12:15,582 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:12:15,584 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:12:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:12:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-03 00:12:15,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-03 00:12:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:15,611 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-03 00:12:15,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-03 00:12:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:12:15,612 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:15,612 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:15,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:12:15,612 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2021-05-03 00:12:15,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:15,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160065883] [2021-05-03 00:12:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:15,616 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,731 INFO 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:15,731 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:15,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160065883] [2021-05-03 00:12:15,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160065883] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:15,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:15,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:12:15,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18202865] [2021-05-03 00:12:15,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:12:15,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:12:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:12:15,733 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. 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:12:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:15,783 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-05-03 00:12:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:12:15,783 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:12:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:15,784 INFO L225 Difference]: With dead ends: 25 [2021-05-03 00:12:15,784 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:12:15,785 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:12:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:12:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-05-03 00:12:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-05-03 00:12:15,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-05-03 00:12:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:15,789 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-05-03 00:12:15,790 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:12:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-05-03 00:12:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:12:15,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:15,790 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:15,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:12:15,790 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2021-05-03 00:12:15,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:15,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854638098] [2021-05-03 00:12:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:15,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_9 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_4 4294967296)))) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] [2021-05-03 00:12:15,822 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:15,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,852 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,885 WARN L205 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:23,924 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:12:27,938 WARN L205 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:12:27,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:27,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:28,008 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:28,050 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:28,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:28,202 INFO 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:28,307 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:28,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854638098] [2021-05-03 00:12:28,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [854638098] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:28,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:28,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:12:28,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765982286] [2021-05-03 00:12:28,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:12:28,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:12:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:12:28,310 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:28,406 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-03 00:12:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:12:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-03 00:12:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:28,407 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:12:28,407 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:12:28,411 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 153.2ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:12:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:12:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-05-03 00:12:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-03 00:12:28,421 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2021-05-03 00:12:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:28,421 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-03 00:12:28,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-03 00:12:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:12:28,422 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:28,422 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:28,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:12:28,423 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2084821988, now seen corresponding path program 2 times [2021-05-03 00:12:28,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:28,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011048986] [2021-05-03 00:12:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:28,433 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_13 4294967296) 5000000) (< (mod (+ v_main_~x~0_13 1) 4294967296) (mod v_main_~y~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_13, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_13, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[] [2021-05-03 00:12:28,443 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:28,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,612 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:28,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:28,917 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:12:28,947 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:29,047 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:29,050 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_15 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_6 4294967296)))) InVars {main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] [2021-05-03 00:12:29,054 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:29,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:29,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:29,311 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:29,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:29,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:29,440 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:29,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:29,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:29,598 INFO 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:29,713 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:29,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011048986] [2021-05-03 00:12:29,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1011048986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:29,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:29,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:12:29,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481617867] [2021-05-03 00:12:29,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:12:29,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:12:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:12:29,715 INFO L87 Difference]: Start difference. First operand 19 states and 20 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:12:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:29,861 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-03 00:12:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:12:29,861 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:12:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:29,863 INFO L225 Difference]: With dead ends: 31 [2021-05-03 00:12:29,863 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:12:29,864 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 215.1ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:12:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:12:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-05-03 00:12:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-05-03 00:12:29,870 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-05-03 00:12:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:29,870 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-05-03 00:12:29,870 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:12:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-05-03 00:12:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-03 00:12:29,871 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:29,871 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:29,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:12:29,872 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1442444596, now seen corresponding path program 3 times [2021-05-03 00:12:29,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:29,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188429004] [2021-05-03 00:12:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:29,881 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_20 1) 4294967296) (mod v_main_~y~0_7 4294967296)) (< (mod v_main_~x~0_20 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] [2021-05-03 00:12:29,890 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:29,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:29,912 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,094 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:12:30,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:30,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:30,170 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:30,309 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:30,315 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:30,321 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_22 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_8 4294967296)))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] [2021-05-03 00:12:30,324 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:30,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:30,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:30,483 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:30,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:30,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:30,610 INFO 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:30,737 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:30,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188429004] [2021-05-03 00:12:30,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1188429004] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:30,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:30,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:12:30,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087550181] [2021-05-03 00:12:30,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:12:30,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:30,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:12:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:12:30,739 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:30,912 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-03 00:12:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:12:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-03 00:12:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:30,913 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:12:30,913 INFO L226 Difference]: Without dead ends: 26 [2021-05-03 00:12:30,913 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 225.2ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:12:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-03 00:12:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-05-03 00:12:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-03 00:12:30,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2021-05-03 00:12:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:30,917 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-03 00:12:30,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-03 00:12:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:12:30,918 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:30,918 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:30,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:12:30,918 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1571384604, now seen corresponding path program 4 times [2021-05-03 00:12:30,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:30,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127456881] [2021-05-03 00:12:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:30,925 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_28 1) 4294967296) (mod v_main_~y~0_9 4294967296)) (< (mod v_main_~x~0_28 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] [2021-05-03 00:12:30,934 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:30,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:30,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:31,064 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:31,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:31,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:31,253 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:12:31,330 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:31,530 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:31,531 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:31,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_30 4294967296))) (and (< .cse0 (mod v_main_~y~0_10 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[] [2021-05-03 00:12:31,535 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:31,547 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:31,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:31,781 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:12:31,800 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:31,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:31,839 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:31,871 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:32,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:32,175 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:32,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127456881] [2021-05-03 00:12:32,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1127456881] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:32,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:32,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:12:32,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115419972] [2021-05-03 00:12:32,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:12:32,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:32,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:12:32,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:12:32,177 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:12:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:32,393 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-05-03 00:12:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:12:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:12:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:32,395 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:12:32,395 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:12:32,395 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 325.8ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:12:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:12:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-03 00:12:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-03 00:12:32,404 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2021-05-03 00:12:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:32,404 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-03 00:12:32,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:12:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-03 00:12:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-03 00:12:32,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:32,406 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:32,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:12:32,406 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1172566988, now seen corresponding path program 5 times [2021-05-03 00:12:32,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:32,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004342110] [2021-05-03 00:12:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:32,413 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_37 1) 4294967296) (mod v_main_~y~0_11 4294967296)) (< (mod v_main_~x~0_37 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[] [2021-05-03 00:12:32,416 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:32,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,977 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:33,067 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:33,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:34,216 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:12:34,554 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:12:34,560 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:34,702 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:34,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:34,711 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_39 4294967296))) (and (< .cse0 (mod v_main_~y~0_12 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[] [2021-05-03 00:12:34,713 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:34,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:34,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:34,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:34,806 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:34,841 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:34,878 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:34,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:34,999 INFO 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:35,195 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:35,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004342110] [2021-05-03 00:12:35,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004342110] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:35,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:35,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:12:35,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958398072] [2021-05-03 00:12:35,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:12:35,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:12:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:12:35,197 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:35,459 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-03 00:12:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:12:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-03 00:12:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:35,460 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:12:35,460 INFO L226 Difference]: Without dead ends: 32 [2021-05-03 00:12:35,460 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 329.7ms TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:12:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-03 00:12:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-05-03 00:12:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-03 00:12:35,465 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2021-05-03 00:12:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:35,465 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-03 00:12:35,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-03 00:12:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:12:35,466 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:35,466 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:35,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-03 00:12:35,466 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 121899492, now seen corresponding path program 6 times [2021-05-03 00:12:35,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:35,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679713785] [2021-05-03 00:12:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:35,471 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_47 1) 4294967296) (mod v_main_~y~0_13 4294967296)) (< (mod v_main_~x~0_47 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_47, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_47, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[] [2021-05-03 00:12:35,473 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:35,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:35,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:35,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:35,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:36,106 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:12:36,157 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:36,263 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:36,265 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:36,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_49 4294967296))) (and (< .cse0 (mod v_main_~y~0_14 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_49, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_49, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:12:36,268 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:36,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,662 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:12:36,678 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:36,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:36,724 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:36,761 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:36,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:36,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:37,057 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:37,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679713785] [2021-05-03 00:12:37,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679713785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:37,057 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:37,057 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:12:37,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775356733] [2021-05-03 00:12:37,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:12:37,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:12:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:12:37,058 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:12:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:37,363 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-05-03 00:12:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:12:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:12:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:37,364 INFO L225 Difference]: With dead ends: 43 [2021-05-03 00:12:37,364 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:12:37,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 374.3ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:12:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:12:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-03 00:12:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-03 00:12:37,368 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2021-05-03 00:12:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:37,368 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-03 00:12:37,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:12:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-03 00:12:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-03 00:12:37,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:37,369 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:37,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:12:37,369 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1408179404, now seen corresponding path program 7 times [2021-05-03 00:12:37,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:37,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180633030] [2021-05-03 00:12:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:37,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_58 1) 4294967296) (mod v_main_~y~0_15 4294967296)) (< (mod v_main_~x~0_58 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_58, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_58, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[] [2021-05-03 00:12:37,376 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:37,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:37,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:37,740 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:38,171 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:38,174 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:38,181 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_60 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_16 4294967296)))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[] [2021-05-03 00:12:38,201 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:38,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:38,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:38,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:38,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:38,462 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:38,510 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:38,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:38,676 INFO 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:38,999 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:38,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180633030] [2021-05-03 00:12:38,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1180633030] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:38,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:38,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:12:38,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542691929] [2021-05-03 00:12:38,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:12:39,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:39,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:12:39,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:12:39,000 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:39,461 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-03 00:12:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:12:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-03 00:12:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:39,463 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:12:39,463 INFO L226 Difference]: Without dead ends: 38 [2021-05-03 00:12:39,463 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 561.1ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:12:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-03 00:12:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-05-03 00:12:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-03 00:12:39,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-05-03 00:12:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:39,469 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-03 00:12:39,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-03 00:12:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:12:39,470 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:39,470 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:39,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-03 00:12:39,470 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1274822884, now seen corresponding path program 8 times [2021-05-03 00:12:39,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:39,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429753539] [2021-05-03 00:12:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:39,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_70 4294967296) 5000000) (< (mod (+ v_main_~x~0_70 1) 4294967296) (mod v_main_~y~0_17 4294967296))) InVars {main_~x~0=v_main_~x~0_70, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_70, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:12:39,479 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:39,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,481 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:39,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:39,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:39,704 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:40,524 WARN L205 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:40,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:40,534 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_72 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_18 4294967296)))) InVars {main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,551 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:40,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:42,573 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:42,630 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:42,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:42,722 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:42,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:43,335 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:43,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429753539] [2021-05-03 00:12:43,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1429753539] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:43,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:43,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:12:43,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683425950] [2021-05-03 00:12:43,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:12:43,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:43,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:12:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:12:43,337 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:12:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:43,789 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-05-03 00:12:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:12:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:12:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:43,790 INFO L225 Difference]: With dead ends: 49 [2021-05-03 00:12:43,790 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:12:43,791 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 604.0ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:12:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:12:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-05-03 00:12:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-05-03 00:12:43,796 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2021-05-03 00:12:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-05-03 00:12:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:12:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-05-03 00:12:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-03 00:12:43,797 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:43,797 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:43,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:12:43,797 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1295484364, now seen corresponding path program 9 times [2021-05-03 00:12:43,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:43,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931090127] [2021-05-03 00:12:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:43,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_83 4294967296) 5000000) (< (mod (+ v_main_~x~0_83 1) 4294967296) (mod v_main_~y~0_19 4294967296))) InVars {main_~x~0=v_main_~x~0_83, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_83, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:12:43,804 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:43,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:43,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:43,940 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:44,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:44,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:44,153 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:44,281 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:44,283 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:44,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_85 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_20 4294967296)))) InVars {main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:12:44,286 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:44,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:44,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:44,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:44,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:44,421 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:44,459 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:44,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:44,557 INFO 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:44,882 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:44,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931090127] [2021-05-03 00:12:44,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [931090127] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:44,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:44,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:12:44,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466038312] [2021-05-03 00:12:44,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:12:44,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:12:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:12:44,884 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:45,375 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-03 00:12:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:12:45,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-05-03 00:12:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:45,376 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:12:45,376 INFO L226 Difference]: Without dead ends: 44 [2021-05-03 00:12:45,376 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 590.3ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:12:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-03 00:12:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-03 00:12:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-03 00:12:45,381 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2021-05-03 00:12:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:45,381 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-03 00:12:45,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-03 00:12:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:12:45,382 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:45,382 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:45,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-03 00:12:45,382 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1653655580, now seen corresponding path program 10 times [2021-05-03 00:12:45,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:45,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879270551] [2021-05-03 00:12:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:45,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_97 1) 4294967296) (mod v_main_~y~0_21 4294967296)) (< (mod v_main_~x~0_97 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_97, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_97, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:12:45,395 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:45,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:45,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:45,694 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:45,844 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:45,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:45,848 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_99 4294967296))) (and (< .cse0 (mod v_main_~y~0_22 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:12:45,850 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:45,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,852 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:45,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:46,010 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:46,039 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:46,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:46,135 INFO 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:46,500 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:46,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879270551] [2021-05-03 00:12:46,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1879270551] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:46,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:46,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:12:46,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48400357] [2021-05-03 00:12:46,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:12:46,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:12:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:12:46,501 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:12:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:47,019 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-03 00:12:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:12:47,019 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:12:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:47,020 INFO L225 Difference]: With dead ends: 55 [2021-05-03 00:12:47,020 INFO L226 Difference]: Without dead ends: 47 [2021-05-03 00:12:47,020 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 660.2ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:12:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-03 00:12:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-03 00:12:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-05-03 00:12:47,026 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2021-05-03 00:12:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:47,026 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-05-03 00:12:47,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:12:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-05-03 00:12:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:12:47,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:47,027 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:47,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:12:47,027 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1630720308, now seen corresponding path program 11 times [2021-05-03 00:12:47,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:47,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207430892] [2021-05-03 00:12:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:47,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_112 4294967296) 5000000) (< (mod (+ v_main_~x~0_112 1) 4294967296) (mod v_main_~y~0_23 4294967296))) InVars {main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_23} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_23} AuxVars[] AssignedVars[] [2021-05-03 00:12:47,034 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:47,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:47,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:47,446 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:12:47,446 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:47,473 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:47,581 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:47,694 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:47,695 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:47,697 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_114 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_24 4294967296)))) InVars {main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_24} OutVars{main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:12:47,698 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:47,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:47,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:47,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:47,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:47,806 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:47,884 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:47,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:47,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:12:48,418 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:48,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207430892] [2021-05-03 00:12:48,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1207430892] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:48,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:48,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:12:48,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573180684] [2021-05-03 00:12:48,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:12:48,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:12:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:12:48,420 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:49,006 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-03 00:12:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:12:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-03 00:12:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:49,007 INFO L225 Difference]: With dead ends: 58 [2021-05-03 00:12:49,007 INFO L226 Difference]: Without dead ends: 50 [2021-05-03 00:12:49,008 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 751.6ms TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:12:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-03 00:12:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-03 00:12:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-03 00:12:49,014 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2021-05-03 00:12:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:49,014 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-03 00:12:49,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-03 00:12:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-03 00:12:49,015 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:49,015 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:49,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-03 00:12:49,015 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1265832220, now seen corresponding path program 12 times [2021-05-03 00:12:49,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:49,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186127170] [2021-05-03 00:12:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:49,020 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_128 4294967296) 5000000) (< (mod (+ v_main_~x~0_128 1) 4294967296) (mod v_main_~y~0_25 4294967296))) InVars {main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_25} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_25} AuxVars[] AssignedVars[] [2021-05-03 00:12:49,021 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:49,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:49,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:49,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:49,250 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:12:49,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:49,404 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:49,513 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:49,515 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:49,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_130 4294967296))) (and (< .cse0 (mod v_main_~y~0_26 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_130, main_~y~0=v_main_~y~0_26} OutVars{main_~x~0=v_main_~x~0_130, main_~y~0=v_main_~y~0_26} AuxVars[] AssignedVars[] [2021-05-03 00:12:49,518 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:49,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:49,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:49,612 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:49,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:49,640 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:49,680 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:49,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:49,746 INFO 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:50,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:50,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186127170] [2021-05-03 00:12:50,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [186127170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:50,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:50,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:12:50,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838829539] [2021-05-03 00:12:50,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:12:50,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:12:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:12:50,203 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 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:12:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:50,846 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-05-03 00:12:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:12:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 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:12:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:50,847 INFO L225 Difference]: With dead ends: 61 [2021-05-03 00:12:50,847 INFO L226 Difference]: Without dead ends: 53 [2021-05-03 00:12:50,848 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 785.7ms TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:12:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-03 00:12:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-05-03 00:12:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-05-03 00:12:50,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2021-05-03 00:12:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:50,854 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-05-03 00:12:50,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 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:12:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-05-03 00:12:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-03 00:12:50,854 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:50,854 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:50,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:12:50,854 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1447028788, now seen corresponding path program 13 times [2021-05-03 00:12:50,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:50,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081054467] [2021-05-03 00:12:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:50,860 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_145 4294967296) 5000000) (< (mod (+ v_main_~x~0_145 1) 4294967296) (mod v_main_~y~0_27 4294967296))) InVars {main_~x~0=v_main_~x~0_145, main_~y~0=v_main_~y~0_27} OutVars{main_~x~0=v_main_~x~0_145, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[] [2021-05-03 00:12:50,862 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:50,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:50,875 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:51,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:51,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:51,176 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:51,302 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:51,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:51,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_147 4294967296))) (and (< .cse0 (mod v_main_~y~0_28 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_28} AuxVars[] AssignedVars[] [2021-05-03 00:12:51,307 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:51,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:51,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:51,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:51,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:51,413 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:51,444 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:51,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:51,512 INFO 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,011 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:52,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081054467] [2021-05-03 00:12:52,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2081054467] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:52,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:52,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:12:52,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732227018] [2021-05-03 00:12:52,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:12:52,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:12:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:12:52,012 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:52,764 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-03 00:12:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:12:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-03 00:12:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:52,765 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:12:52,765 INFO L226 Difference]: Without dead ends: 56 [2021-05-03 00:12:52,766 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 861.7ms TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:12:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-03 00:12:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-05-03 00:12:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-03 00:12:52,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2021-05-03 00:12:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-03 00:12:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-03 00:12:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:12:52,772 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:52,773 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:52,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-03 00:12:52,773 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash -700095004, now seen corresponding path program 14 times [2021-05-03 00:12:52,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:52,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620999948] [2021-05-03 00:12:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:52,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_163 1) 4294967296) (mod v_main_~y~0_29 4294967296)) (< (mod v_main_~x~0_163 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_163, main_~y~0=v_main_~y~0_29} OutVars{main_~x~0=v_main_~x~0_163, main_~y~0=v_main_~y~0_29} AuxVars[] AssignedVars[] [2021-05-03 00:12:52,780 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:52,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,797 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:52,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:53,068 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:53,222 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:53,223 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:53,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_165 4294967296))) (and (< .cse0 (mod v_main_~y~0_30 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_165, main_~y~0=v_main_~y~0_30} OutVars{main_~x~0=v_main_~x~0_165, main_~y~0=v_main_~y~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:12:53,226 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:53,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:53,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:53,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:53,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:53,426 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:53,456 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:53,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:53,525 INFO 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:54,088 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:54,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620999948] [2021-05-03 00:12:54,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1620999948] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:54,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:54,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:12:54,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130256534] [2021-05-03 00:12:54,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:12:54,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:12:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:12:54,090 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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:12:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:54,879 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-05-03 00:12:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:12:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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:12:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:54,880 INFO L225 Difference]: With dead ends: 67 [2021-05-03 00:12:54,880 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:12:54,881 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 961.4ms TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:12:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:12:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-03 00:12:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-05-03 00:12:54,887 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2021-05-03 00:12:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:54,887 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-05-03 00:12:54,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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:12:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-05-03 00:12:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-03 00:12:54,888 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:54,888 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:54,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-03 00:12:54,888 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1021296436, now seen corresponding path program 15 times [2021-05-03 00:12:54,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:54,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329048684] [2021-05-03 00:12:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:54,896 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_182 4294967296) 5000000) (< (mod (+ v_main_~x~0_182 1) 4294967296) (mod v_main_~y~0_31 4294967296))) InVars {main_~x~0=v_main_~x~0_182, main_~y~0=v_main_~y~0_31} OutVars{main_~x~0=v_main_~x~0_182, main_~y~0=v_main_~y~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:12:54,898 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:54,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:54,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:55,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:55,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:55,105 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:55,346 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:55,347 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:55,349 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_184 4294967296))) (and (< .cse0 (mod v_main_~y~0_32 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_184, main_~y~0=v_main_~y~0_32} OutVars{main_~x~0=v_main_~x~0_184, main_~y~0=v_main_~y~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:12:55,350 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:55,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:55,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:55,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:55,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:55,454 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:55,507 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:55,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:12:56,205 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:56,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329048684] [2021-05-03 00:12:56,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1329048684] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:56,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:56,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:12:56,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817078971] [2021-05-03 00:12:56,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:12:56,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:12:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:12:56,207 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:57,060 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-03 00:12:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:12:57,061 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-03 00:12:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:57,061 INFO L225 Difference]: With dead ends: 70 [2021-05-03 00:12:57,061 INFO L226 Difference]: Without dead ends: 62 [2021-05-03 00:12:57,062 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1066.5ms TimeCoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:12:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-03 00:12:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-05-03 00:12:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-03 00:12:57,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2021-05-03 00:12:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:57,068 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-03 00:12:57,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-03 00:12:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:12:57,069 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:57,069 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:57,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-03 00:12:57,069 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -746021660, now seen corresponding path program 16 times [2021-05-03 00:12:57,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:57,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846690230] [2021-05-03 00:12:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:57,074 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_202 1) 4294967296) (mod v_main_~y~0_33 4294967296)) (< (mod v_main_~x~0_202 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_33} OutVars{main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_33} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,076 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:57,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,235 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:12:57,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:57,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:57,427 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:57,543 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:57,544 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:57,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_204 4294967296))) (and (< .cse0 (mod v_main_~y~0_34 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_34} OutVars{main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,547 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:57,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:57,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:57,679 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:57,716 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,817 INFO 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,472 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:58,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846690230] [2021-05-03 00:12:58,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [846690230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:58,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:58,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:12:58,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942596360] [2021-05-03 00:12:58,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:12:58,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:12:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:12:58,473 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:12:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:59,397 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-03 00:12:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:12:59,398 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:12:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:59,398 INFO L225 Difference]: With dead ends: 73 [2021-05-03 00:12:59,398 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:12:59,399 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1153.2ms TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:12:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:12:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-03 00:12:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-03 00:12:59,406 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2021-05-03 00:12:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:59,406 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-03 00:12:59,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:12:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-03 00:12:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-03 00:12:59,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:59,407 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:59,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-03 00:12:59,407 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 872262092, now seen corresponding path program 17 times [2021-05-03 00:12:59,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:59,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304155705] [2021-05-03 00:12:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:59,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_223 1) 4294967296) (mod v_main_~y~0_35 4294967296)) (< (mod v_main_~x~0_223 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_223, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_223, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,413 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:59,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:59,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:00,049 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:13:00,076 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:00,225 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:00,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_225 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_36 4294967296)))) InVars {main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_36} OutVars{main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,230 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:00,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:00,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:00,336 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:00,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:01,164 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:01,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304155705] [2021-05-03 00:13:01,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304155705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:01,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:01,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:13:01,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937768688] [2021-05-03 00:13:01,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:13:01,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:13:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:13:01,166 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:02,175 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-03 00:13:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:13:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-03 00:13:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:02,176 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:13:02,176 INFO L226 Difference]: Without dead ends: 68 [2021-05-03 00:13:02,177 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 35 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1229.7ms TimeCoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:13:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-03 00:13:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-05-03 00:13:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-03 00:13:02,183 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2021-05-03 00:13:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:02,183 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-03 00:13:02,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-03 00:13:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:13:02,184 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:02,184 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:02,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:13:02,184 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash 155620324, now seen corresponding path program 18 times [2021-05-03 00:13:02,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:02,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58689888] [2021-05-03 00:13:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:02,193 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_245 1) 4294967296) (mod v_main_~y~0_37 4294967296)) (< (mod v_main_~x~0_245 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_245, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_245, main_~y~0=v_main_~y~0_37} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,195 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:02,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:02,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:02,421 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:02,738 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:02,739 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,741 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_247 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_38 4294967296)))) InVars {main_~x~0=v_main_~x~0_247, main_~y~0=v_main_~y~0_38} OutVars{main_~x~0=v_main_~x~0_247, main_~y~0=v_main_~y~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,742 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:02,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,756 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:03,281 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:13:03,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:03,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:03,345 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:03,387 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:03,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:03,498 INFO 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,270 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:04,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58689888] [2021-05-03 00:13:04,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [58689888] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:04,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:04,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:13:04,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51515043] [2021-05-03 00:13:04,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:13:04,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:13:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:13:04,272 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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:13:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:05,338 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-05-03 00:13:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:13:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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:13:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:05,339 INFO L225 Difference]: With dead ends: 79 [2021-05-03 00:13:05,339 INFO L226 Difference]: Without dead ends: 71 [2021-05-03 00:13:05,340 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 37 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1313.3ms TimeCoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:13:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-03 00:13:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-03 00:13:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-03 00:13:05,347 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2021-05-03 00:13:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-03 00:13:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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:13:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-03 00:13:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-03 00:13:05,348 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:05,348 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:05,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-03 00:13:05,348 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash 963138252, now seen corresponding path program 19 times [2021-05-03 00:13:05,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:05,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679942871] [2021-05-03 00:13:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:05,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_268 4294967296) 5000000) (< (mod (+ v_main_~x~0_268 1) 4294967296) (mod v_main_~y~0_39 4294967296))) InVars {main_~x~0=v_main_~x~0_268, main_~y~0=v_main_~y~0_39} OutVars{main_~x~0=v_main_~x~0_268, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,355 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:05,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,663 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:05,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:05,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:06,037 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:06,161 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:06,162 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:06,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_270 4294967296))) (and (< .cse0 (mod v_main_~y~0_40 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:13:06,165 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:06,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:06,179 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:06,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:06,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:06,324 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:06,368 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,439 INFO 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:07,300 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:07,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679942871] [2021-05-03 00:13:07,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679942871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:07,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:07,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:13:07,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849791969] [2021-05-03 00:13:07,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:13:07,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:13:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:13:07,302 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:08,490 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-03 00:13:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:13:08,491 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-03 00:13:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:08,491 INFO L225 Difference]: With dead ends: 82 [2021-05-03 00:13:08,491 INFO L226 Difference]: Without dead ends: 74 [2021-05-03 00:13:08,492 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1451.5ms TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:13:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-03 00:13:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-03 00:13:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-03 00:13:08,500 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2021-05-03 00:13:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:08,500 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-03 00:13:08,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-03 00:13:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:13:08,501 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:08,501 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:08,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-03 00:13:08,501 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1617906404, now seen corresponding path program 20 times [2021-05-03 00:13:08,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:08,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125231705] [2021-05-03 00:13:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:08,517 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_292 4294967296) 5000000) (< (mod (+ v_main_~x~0_292 1) 4294967296) (mod v_main_~y~0_41 4294967296))) InVars {main_~x~0=v_main_~x~0_292, main_~y~0=v_main_~y~0_41} OutVars{main_~x~0=v_main_~x~0_292, main_~y~0=v_main_~y~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,518 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:08,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:08,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:08,738 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:08,934 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:08,935 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:08,937 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_294 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_42 4294967296)))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_42} OutVars{main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_42} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,938 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:08,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:09,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:09,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:09,081 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:09,116 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:09,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:09,210 INFO 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,210 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:10,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125231705] [2021-05-03 00:13:10,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1125231705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:10,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:10,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:13:10,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225971085] [2021-05-03 00:13:10,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:13:10,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:10,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:13:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:13:10,211 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:13:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:11,510 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-05-03 00:13:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:13:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:13:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:11,513 INFO L225 Difference]: With dead ends: 85 [2021-05-03 00:13:11,513 INFO L226 Difference]: Without dead ends: 77 [2021-05-03 00:13:11,514 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 41 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1618.2ms TimeCoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:13:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-03 00:13:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-05-03 00:13:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-05-03 00:13:11,521 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2021-05-03 00:13:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:11,521 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-05-03 00:13:11,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:13:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-05-03 00:13:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-03 00:13:11,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:11,522 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:11,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:13:11,522 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 74464204, now seen corresponding path program 21 times [2021-05-03 00:13:11,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:11,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565562242] [2021-05-03 00:13:11,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:11,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_317 1) 4294967296) (mod v_main_~y~0_43 4294967296)) (< (mod v_main_~x~0_317 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_317, main_~y~0=v_main_~y~0_43} OutVars{main_~x~0=v_main_~x~0_317, main_~y~0=v_main_~y~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:13:11,528 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:11,541 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,543 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:11,631 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:11,678 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:11,755 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:11,756 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_319 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_44 4294967296)))) InVars {main_~x~0=v_main_~x~0_319, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_319, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[] [2021-05-03 00:13:11,757 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:11,768 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:11,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:11,873 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:11,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:12,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:12,065 INFO 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:13,043 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:13,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565562242] [2021-05-03 00:13:13,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [565562242] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:13,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:13,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:13:13,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870263652] [2021-05-03 00:13:13,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:13:13,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:13:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:13:13,044 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:14,391 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-03 00:13:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:13:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-03 00:13:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:14,392 INFO L225 Difference]: With dead ends: 88 [2021-05-03 00:13:14,392 INFO L226 Difference]: Without dead ends: 80 [2021-05-03 00:13:14,392 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1671.1ms TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:13:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-03 00:13:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-03 00:13:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-03 00:13:14,401 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2021-05-03 00:13:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:14,401 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-03 00:13:14,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-03 00:13:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:13:14,401 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:14,401 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:14,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-03 00:13:14,402 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1307754980, now seen corresponding path program 22 times [2021-05-03 00:13:14,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:14,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1174433387] [2021-05-03 00:13:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:14,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_343 4294967296) 5000000) (< (mod (+ v_main_~x~0_343 1) 4294967296) (mod v_main_~y~0_45 4294967296))) InVars {main_~x~0=v_main_~x~0_343, main_~y~0=v_main_~y~0_45} OutVars{main_~x~0=v_main_~x~0_343, main_~y~0=v_main_~y~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:13:14,413 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:14,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:14,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:15,324 WARN L205 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:15,501 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:15,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:15,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:15,653 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:15,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:15,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_345 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_46 4294967296)))) InVars {main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_46} OutVars{main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:13:15,744 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:15,745 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:15,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:15,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:15,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:15,893 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:15,935 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:16,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:16,038 INFO 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:17,067 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:17,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1174433387] [2021-05-03 00:13:17,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1174433387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:17,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:17,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:13:17,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740077043] [2021-05-03 00:13:17,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:13:17,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:13:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:13:17,068 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 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:13:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:18,530 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-03 00:13:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:13:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 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:13:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:18,531 INFO L225 Difference]: With dead ends: 91 [2021-05-03 00:13:18,531 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:13:18,532 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 45 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1742.4ms TimeCoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:13:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:13:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-05-03 00:13:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-03 00:13:18,542 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2021-05-03 00:13:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:18,543 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-03 00:13:18,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 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:13:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-03 00:13:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-03 00:13:18,543 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:18,543 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:18,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:13:18,543 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1171954484, now seen corresponding path program 23 times [2021-05-03 00:13:18,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:18,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250642362] [2021-05-03 00:13:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:18,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_370 4294967296) 5000000) (< (mod (+ v_main_~x~0_370 1) 4294967296) (mod v_main_~y~0_47 4294967296))) InVars {main_~x~0=v_main_~x~0_370, main_~y~0=v_main_~y~0_47} OutVars{main_~x~0=v_main_~x~0_370, main_~y~0=v_main_~y~0_47} AuxVars[] AssignedVars[] [2021-05-03 00:13:18,550 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:18,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:18,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:18,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:18,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:18,740 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:18,868 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:18,869 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:18,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_372 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_48 4294967296)))) InVars {main_~x~0=v_main_~x~0_372, main_~y~0=v_main_~y~0_48} OutVars{main_~x~0=v_main_~x~0_372, main_~y~0=v_main_~y~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:13:18,872 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:18,873 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:18,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:19,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:19,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:19,075 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:19,116 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:19,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:19,202 INFO 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:20,412 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:20,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250642362] [2021-05-03 00:13:20,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [250642362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:20,412 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:20,412 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:13:20,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578013900] [2021-05-03 00:13:20,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:13:20,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:13:20,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:13:20,414 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:22,039 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-03 00:13:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:13:22,040 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-03 00:13:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:22,041 INFO L225 Difference]: With dead ends: 94 [2021-05-03 00:13:22,041 INFO L226 Difference]: Without dead ends: 86 [2021-05-03 00:13:22,041 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1995.3ms TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:13:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-03 00:13:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-03 00:13:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-03 00:13:22,051 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2021-05-03 00:13:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:22,051 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-03 00:13:22,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-03 00:13:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-03 00:13:22,052 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:22,052 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:22,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-03 00:13:22,052 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash -759105308, now seen corresponding path program 24 times [2021-05-03 00:13:22,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:22,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98300592] [2021-05-03 00:13:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:22,057 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_398 1) 4294967296) (mod v_main_~y~0_49 4294967296)) (< (mod v_main_~x~0_398 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_398, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_398, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:13:22,058 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:22,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:22,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:22,384 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:22,488 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:22,489 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:22,490 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_400 4294967296))) (and (< .cse0 (mod v_main_~y~0_50 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_50} OutVars{main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:13:22,492 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:22,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:22,614 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:22,644 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:22,693 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:22,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:24,084 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:24,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98300592] [2021-05-03 00:13:24,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [98300592] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:24,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:24,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:13:24,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599237146] [2021-05-03 00:13:24,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:13:24,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:13:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:13:24,086 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:13:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:25,828 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-05-03 00:13:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:13:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:13:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:25,830 INFO L225 Difference]: With dead ends: 97 [2021-05-03 00:13:25,830 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:13:25,830 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2129.8ms TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:13:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:13:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-05-03 00:13:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-05-03 00:13:25,840 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2021-05-03 00:13:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:25,840 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-05-03 00:13:25,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:13:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-05-03 00:13:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-03 00:13:25,841 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:25,841 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:25,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:13:25,841 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1939328460, now seen corresponding path program 25 times [2021-05-03 00:13:25,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:25,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916110838] [2021-05-03 00:13:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:25,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_427 1) 4294967296) (mod v_main_~y~0_51 4294967296)) (< (mod v_main_~x~0_427 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_427, main_~y~0=v_main_~y~0_51} OutVars{main_~x~0=v_main_~x~0_427, main_~y~0=v_main_~y~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:13:25,855 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:25,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:25,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:26,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:26,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:26,107 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:26,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:26,186 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_429 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_52 4294967296)))) InVars {main_~x~0=v_main_~x~0_429, main_~y~0=v_main_~y~0_52} OutVars{main_~x~0=v_main_~x~0_429, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[] [2021-05-03 00:13:26,188 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:26,200 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:26,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:26,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:26,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:26,282 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:26,322 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:26,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:27,735 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:27,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916110838] [2021-05-03 00:13:27,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1916110838] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:27,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:27,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:13:27,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111783903] [2021-05-03 00:13:27,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:13:27,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:13:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:13:27,737 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:29,538 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-03 00:13:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:13:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-05-03 00:13:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:29,539 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:13:29,539 INFO L226 Difference]: Without dead ends: 92 [2021-05-03 00:13:29,540 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2119.8ms TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:13:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-03 00:13:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-05-03 00:13:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-03 00:13:29,550 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2021-05-03 00:13:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:29,550 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-03 00:13:29,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-03 00:13:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:13:29,550 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:29,551 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:29,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-03 00:13:29,551 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2076831716, now seen corresponding path program 26 times [2021-05-03 00:13:29,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:29,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630361489] [2021-05-03 00:13:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:29,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_457 1) 4294967296) (mod v_main_~y~0_53 4294967296)) (< (mod v_main_~x~0_457 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_457, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_457, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[] [2021-05-03 00:13:29,564 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:29,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:29,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:29,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:29,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:29,817 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:29,920 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:29,921 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:29,923 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_459 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_54 4294967296)))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_54} AuxVars[] AssignedVars[] [2021-05-03 00:13:29,924 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:29,925 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:29,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:29,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:29,987 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:30,036 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:30,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:30,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:30,210 INFO 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:31,701 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:31,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630361489] [2021-05-03 00:13:31,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1630361489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:31,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:31,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:13:31,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178154756] [2021-05-03 00:13:31,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:13:31,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:13:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:13:31,702 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:13:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:33,668 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-05-03 00:13:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:13:33,669 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:13:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:33,670 INFO L225 Difference]: With dead ends: 103 [2021-05-03 00:13:33,670 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:13:33,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 6 SyntacticMatches, 53 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2432.3ms TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:13:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:13:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-03 00:13:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-03 00:13:33,681 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2021-05-03 00:13:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:33,681 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-03 00:13:33,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:13:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-03 00:13:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-03 00:13:33,682 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:33,682 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:33,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:13:33,682 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1037530828, now seen corresponding path program 27 times [2021-05-03 00:13:33,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:33,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976160231] [2021-05-03 00:13:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:33,687 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_488 1) 4294967296) (mod v_main_~y~0_55 4294967296)) (< (mod v_main_~x~0_488 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_488, main_~y~0=v_main_~y~0_55} OutVars{main_~x~0=v_main_~x~0_488, main_~y~0=v_main_~y~0_55} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,689 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:33,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:33,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:33,934 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:33,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:33,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_490 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_56 4294967296)))) InVars {main_~x~0=v_main_~x~0_490, main_~y~0=v_main_~y~0_56} OutVars{main_~x~0=v_main_~x~0_490, main_~y~0=v_main_~y~0_56} AuxVars[] AssignedVars[] [2021-05-03 00:13:34,001 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:34,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:34,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:34,591 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:34,617 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:34,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:34,654 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:34,686 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:34,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:34,798 INFO 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:36,431 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:36,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976160231] [2021-05-03 00:13:36,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1976160231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:36,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:36,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:13:36,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110124540] [2021-05-03 00:13:36,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:13:36,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:13:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:13:36,432 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:38,574 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-03 00:13:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:13:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2021-05-03 00:13:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:38,575 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:13:38,575 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:13:38,576 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 6 SyntacticMatches, 55 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2625.0ms TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:13:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:13:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-05-03 00:13:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-03 00:13:38,589 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2021-05-03 00:13:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:38,589 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-03 00:13:38,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-03 00:13:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:13:38,590 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:38,590 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:38,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-03 00:13:38,590 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1644013284, now seen corresponding path program 28 times [2021-05-03 00:13:38,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:38,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [200728750] [2021-05-03 00:13:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:38,596 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_520 1) 4294967296) (mod v_main_~y~0_57 4294967296)) (< (mod v_main_~x~0_520 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_520, main_~y~0=v_main_~y~0_57} OutVars{main_~x~0=v_main_~x~0_520, main_~y~0=v_main_~y~0_57} AuxVars[] AssignedVars[] [2021-05-03 00:13:38,597 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:38,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:38,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:38,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:38,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:38,855 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:39,019 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:39,020 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:39,022 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_522 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_58 4294967296)))) InVars {main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[] [2021-05-03 00:13:39,023 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:39,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,026 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:39,102 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:39,191 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:39,234 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:39,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:41,044 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:41,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [200728750] [2021-05-03 00:13:41,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [200728750] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:41,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:41,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:13:41,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081707560] [2021-05-03 00:13:41,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:13:41,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:13:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:13:41,046 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:13:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:43,320 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-05-03 00:13:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:13:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:13:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:43,321 INFO L225 Difference]: With dead ends: 109 [2021-05-03 00:13:43,321 INFO L226 Difference]: Without dead ends: 101 [2021-05-03 00:13:43,322 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 57 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2777.1ms TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:13:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-03 00:13:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-05-03 00:13:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-05-03 00:13:43,333 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2021-05-03 00:13:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:43,333 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-05-03 00:13:43,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:13:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-05-03 00:13:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-03 00:13:43,334 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:43,334 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:43,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:13:43,334 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash 435445708, now seen corresponding path program 29 times [2021-05-03 00:13:43,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:43,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070331589] [2021-05-03 00:13:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:43,339 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_553 1) 4294967296) (mod v_main_~y~0_59 4294967296)) (< (mod v_main_~x~0_553 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_553, main_~y~0=v_main_~y~0_59} OutVars{main_~x~0=v_main_~x~0_553, main_~y~0=v_main_~y~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:13:43,341 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:43,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:43,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:43,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:43,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:43,589 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:43,735 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:43,750 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:43,752 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_555 4294967296))) (and (< .cse0 (mod v_main_~y~0_60 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_555, main_~y~0=v_main_~y~0_60} OutVars{main_~x~0=v_main_~x~0_555, main_~y~0=v_main_~y~0_60} AuxVars[] AssignedVars[] [2021-05-03 00:13:43,754 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:43,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:43,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:43,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:43,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:43,866 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:43,903 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:43,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:13:45,800 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:45,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070331589] [2021-05-03 00:13:45,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070331589] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:45,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:45,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:13:45,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531704171] [2021-05-03 00:13:45,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:13:45,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:13:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:13:45,802 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:48,341 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-03 00:13:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:13:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-03 00:13:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:48,342 INFO L225 Difference]: With dead ends: 112 [2021-05-03 00:13:48,342 INFO L226 Difference]: Without dead ends: 104 [2021-05-03 00:13:48,343 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 6 SyntacticMatches, 59 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2958.1ms TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:13:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-03 00:13:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-05-03 00:13:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-03 00:13:48,358 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2021-05-03 00:13:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:48,358 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-03 00:13:48,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-03 00:13:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-03 00:13:48,358 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:48,358 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:48,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-03 00:13:48,359 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 709631460, now seen corresponding path program 30 times [2021-05-03 00:13:48,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:48,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372844740] [2021-05-03 00:13:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:48,365 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_587 1) 4294967296) (mod v_main_~y~0_61 4294967296)) (< (mod v_main_~x~0_587 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_587, main_~y~0=v_main_~y~0_61} OutVars{main_~x~0=v_main_~x~0_587, main_~y~0=v_main_~y~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,366 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:48,390 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,395 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:48,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:48,693 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:48,801 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:48,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:48,804 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_589 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_62 4294967296)))) InVars {main_~x~0=v_main_~x~0_589, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_589, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,806 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:48,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:48,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:48,942 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:48,978 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:49,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:49,064 INFO 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:51,032 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:51,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372844740] [2021-05-03 00:13:51,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1372844740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:51,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:51,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:13:51,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969563478] [2021-05-03 00:13:51,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:13:51,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:13:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:13:51,033 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:13:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:53,678 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2021-05-03 00:13:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:13:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:13:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:53,680 INFO L225 Difference]: With dead ends: 115 [2021-05-03 00:13:53,680 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:13:53,680 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 6 SyntacticMatches, 61 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 3134.7ms TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:13:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:13:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-05-03 00:13:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-05-03 00:13:53,693 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2021-05-03 00:13:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:53,693 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-05-03 00:13:53,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:13:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-05-03 00:13:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-03 00:13:53,693 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:53,693 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:53,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-03 00:13:53,693 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash -50427700, now seen corresponding path program 31 times [2021-05-03 00:13:53,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:53,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493878698] [2021-05-03 00:13:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:53,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_622 4294967296) 5000000) (< (mod (+ v_main_~x~0_622 1) 4294967296) (mod v_main_~y~0_63 4294967296))) InVars {main_~x~0=v_main_~x~0_622, main_~y~0=v_main_~y~0_63} OutVars{main_~x~0=v_main_~x~0_622, main_~y~0=v_main_~y~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:13:53,701 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:53,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:55,492 WARN L205 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:13:55,651 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:13:55,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:55,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:55,755 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:55,839 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:55,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_624 4294967296))) (and (< .cse0 (mod v_main_~y~0_64 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_624, main_~y~0=v_main_~y~0_64} OutVars{main_~x~0=v_main_~x~0_624, main_~y~0=v_main_~y~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:13:55,842 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:55,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:55,859 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:55,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:56,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:56,031 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:56,099 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:56,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:56,208 INFO 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:58,140 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:58,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493878698] [2021-05-03 00:13:58,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [493878698] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:58,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:58,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:13:58,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816213243] [2021-05-03 00:13:58,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:13:58,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:58,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:13:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:13:58,142 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:00,817 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-03 00:14:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:14:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-03 00:14:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:00,819 INFO L225 Difference]: With dead ends: 118 [2021-05-03 00:14:00,819 INFO L226 Difference]: Without dead ends: 110 [2021-05-03 00:14:00,819 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3100.9ms TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:14:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-05-03 00:14:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-05-03 00:14:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-03 00:14:00,832 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2021-05-03 00:14:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:00,832 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-03 00:14:00,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-03 00:14:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:14:00,833 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:00,833 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:00,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-05-03 00:14:00,833 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 94721252, now seen corresponding path program 32 times [2021-05-03 00:14:00,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:00,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1388943710] [2021-05-03 00:14:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:00,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_658 1) 4294967296) (mod v_main_~y~0_65 4294967296)) (< (mod v_main_~x~0_658 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_658, main_~y~0=v_main_~y~0_65} OutVars{main_~x~0=v_main_~x~0_658, main_~y~0=v_main_~y~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:14:00,840 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:00,856 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:00,858 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:00,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:01,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:03,116 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:14:03,140 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:03,457 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:03,459 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:03,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_660 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_66 4294967296)))) InVars {main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_66} OutVars{main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[] [2021-05-03 00:14:03,462 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:03,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:03,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:03,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:03,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:03,643 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:03,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:03,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:03,771 INFO 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:06,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:06,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1388943710] [2021-05-03 00:14:06,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1388943710] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:06,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:06,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:14:06,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95307300] [2021-05-03 00:14:06,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:14:06,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:06,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:14:06,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:14:06,031 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:14:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:09,064 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-05-03 00:14:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:14:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:14:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:09,065 INFO L225 Difference]: With dead ends: 121 [2021-05-03 00:14:09,065 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:14:09,066 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 65 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3597.3ms TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:14:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:14:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-05-03 00:14:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2021-05-03 00:14:09,079 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2021-05-03 00:14:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:09,080 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2021-05-03 00:14:09,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:14:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2021-05-03 00:14:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-03 00:14:09,080 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:09,080 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:09,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-03 00:14:09,080 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:09,081 INFO L82 PathProgramCache]: Analyzing trace with hash -804916788, now seen corresponding path program 33 times [2021-05-03 00:14:09,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:09,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771902786] [2021-05-03 00:14:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:09,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_695 4294967296) 5000000) (< (mod (+ v_main_~x~0_695 1) 4294967296) (mod v_main_~y~0_67 4294967296))) InVars {main_~x~0=v_main_~x~0_695, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_695, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,091 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:09,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:09,306 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:09,428 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:09,541 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:09,542 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:09,544 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_697 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_68 4294967296)))) InVars {main_~x~0=v_main_~x~0_697, main_~y~0=v_main_~y~0_68} OutVars{main_~x~0=v_main_~x~0_697, main_~y~0=v_main_~y~0_68} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,545 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:09,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:09,694 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:09,747 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:09,799 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,945 INFO 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:12,295 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:12,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771902786] [2021-05-03 00:14:12,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1771902786] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:12,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:12,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:14:12,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767348035] [2021-05-03 00:14:12,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:14:12,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:12,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:14:12,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:14:12,296 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:15,376 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-03 00:14:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:14:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-03 00:14:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:15,377 INFO L225 Difference]: With dead ends: 124 [2021-05-03 00:14:15,377 INFO L226 Difference]: Without dead ends: 116 [2021-05-03 00:14:15,378 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 6 SyntacticMatches, 67 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3683.7ms TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:14:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-03 00:14:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-05-03 00:14:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-03 00:14:15,392 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2021-05-03 00:14:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:15,392 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-03 00:14:15,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-03 00:14:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:14:15,392 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:15,392 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:15,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-05-03 00:14:15,392 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1325839388, now seen corresponding path program 34 times [2021-05-03 00:14:15,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:15,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496930544] [2021-05-03 00:14:15,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:15,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_733 4294967296) 5000000) (< (mod (+ v_main_~x~0_733 1) 4294967296) (mod v_main_~y~0_69 4294967296))) InVars {main_~x~0=v_main_~x~0_733, main_~y~0=v_main_~y~0_69} OutVars{main_~x~0=v_main_~x~0_733, main_~y~0=v_main_~y~0_69} AuxVars[] AssignedVars[] [2021-05-03 00:14:15,406 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:15,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:15,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:15,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:15,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:15,694 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:15,823 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:15,825 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:15,826 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_735 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_70 4294967296)))) InVars {main_~x~0=v_main_~x~0_735, main_~y~0=v_main_~y~0_70} OutVars{main_~x~0=v_main_~x~0_735, main_~y~0=v_main_~y~0_70} AuxVars[] AssignedVars[] [2021-05-03 00:14:15,828 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:15,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:15,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:15,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:15,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:15,969 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:16,013 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:16,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:18,642 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:18,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496930544] [2021-05-03 00:14:18,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [496930544] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:18,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:18,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:14:18,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238378407] [2021-05-03 00:14:18,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:14:18,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:14:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:14:18,643 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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:14:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:22,044 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2021-05-03 00:14:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:14:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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:14:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:22,045 INFO L225 Difference]: With dead ends: 127 [2021-05-03 00:14:22,045 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:14:22,046 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 69 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 4047.9ms TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:14:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:14:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2021-05-03 00:14:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2021-05-03 00:14:22,061 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2021-05-03 00:14:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:22,061 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2021-05-03 00:14:22,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 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:14:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2021-05-03 00:14:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-03 00:14:22,062 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:22,062 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:22,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-03 00:14:22,062 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1880791756, now seen corresponding path program 35 times [2021-05-03 00:14:22,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:22,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729092037] [2021-05-03 00:14:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:22,069 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_772 1) 4294967296) (mod v_main_~y~0_71 4294967296)) (< (mod v_main_~x~0_772 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_772, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_772, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[] [2021-05-03 00:14:22,070 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:22,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,401 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:14:22,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:22,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:22,533 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:22,803 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:22,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:22,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_774 4294967296))) (and (< .cse0 (mod v_main_~y~0_72 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_72} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:14:22,807 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:22,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,809 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:22,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:22,958 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:23,004 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:23,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:23,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:14:25,728 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:25,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729092037] [2021-05-03 00:14:25,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [729092037] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:25,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:25,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:14:25,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601668487] [2021-05-03 00:14:25,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:14:25,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:25,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:14:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:14:25,730 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:29,267 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-03 00:14:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:14:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2021-05-03 00:14:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:29,268 INFO L225 Difference]: With dead ends: 130 [2021-05-03 00:14:29,269 INFO L226 Difference]: Without dead ends: 122 [2021-05-03 00:14:29,269 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 6 SyntacticMatches, 71 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 4190.0ms TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:14:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-03 00:14:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-05-03 00:14:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-03 00:14:29,284 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2021-05-03 00:14:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:29,285 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-03 00:14:29,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-03 00:14:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-03 00:14:29,285 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:29,285 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:29,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-05-03 00:14:29,285 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:29,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1966605028, now seen corresponding path program 36 times [2021-05-03 00:14:29,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:29,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396237544] [2021-05-03 00:14:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:29,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_812 4294967296) 5000000) (< (mod (+ v_main_~x~0_812 1) 4294967296) (mod v_main_~y~0_73 4294967296))) InVars {main_~x~0=v_main_~x~0_812, main_~y~0=v_main_~y~0_73} OutVars{main_~x~0=v_main_~x~0_812, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[] [2021-05-03 00:14:29,293 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:29,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:29,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:29,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:29,424 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:29,578 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:29,795 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:29,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:29,798 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_814 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_74 4294967296)))) InVars {main_~x~0=v_main_~x~0_814, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_814, main_~y~0=v_main_~y~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:14:29,800 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:29,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:29,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:33,824 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:14:37,848 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:14:41,874 WARN L205 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:14:41,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:41,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:41,950 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:41,994 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,117 INFO 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:45,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:45,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396237544] [2021-05-03 00:14:45,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396237544] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:45,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:45,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:14:45,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845283297] [2021-05-03 00:14:45,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:14:45,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:14:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:14:45,031 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 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:14:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:49,061 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2021-05-03 00:14:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:14:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 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:14:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:49,063 INFO L225 Difference]: With dead ends: 133 [2021-05-03 00:14:49,063 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:14:49,064 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 6 SyntacticMatches, 73 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 4682.5ms TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:14:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:14:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-05-03 00:14:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2021-05-03 00:14:49,081 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2021-05-03 00:14:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:49,082 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2021-05-03 00:14:49,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 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:14:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2021-05-03 00:14:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-03 00:14:49,082 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:49,082 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:49,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-03 00:14:49,083 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1370717236, now seen corresponding path program 37 times [2021-05-03 00:14:49,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:49,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12622539] [2021-05-03 00:14:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:49,091 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_853 1) 4294967296) (mod v_main_~y~0_75 4294967296)) (< (mod v_main_~x~0_853 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_853, main_~y~0=v_main_~y~0_75} OutVars{main_~x~0=v_main_~x~0_853, main_~y~0=v_main_~y~0_75} AuxVars[] AssignedVars[] [2021-05-03 00:14:49,092 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:49,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:49,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:49,287 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:14:49,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:49,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:49,480 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:49,604 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:49,606 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:49,611 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_855 4294967296))) (and (< .cse0 (mod v_main_~y~0_76 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_855, main_~y~0=v_main_~y~0_76} OutVars{main_~x~0=v_main_~x~0_855, main_~y~0=v_main_~y~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:14:49,612 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:49,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:49,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:49,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:49,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:49,741 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:49,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:49,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:49,861 INFO 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:53,018 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:53,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12622539] [2021-05-03 00:14:53,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [12622539] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:53,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:53,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:14:53,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601644702] [2021-05-03 00:14:53,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:14:53,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:14:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:14:53,020 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:57,501 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-03 00:14:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:14:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-03 00:14:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:57,503 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:14:57,503 INFO L226 Difference]: Without dead ends: 128 [2021-05-03 00:14:57,503 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 75 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 5034.9ms TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:14:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-05-03 00:14:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-05-03 00:14:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-03 00:14:57,521 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2021-05-03 00:14:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-03 00:14:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-03 00:14:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:14:57,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:57,522 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:57,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-05-03 00:14:57,522 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 659651044, now seen corresponding path program 38 times [2021-05-03 00:14:57,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:57,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1582926428] [2021-05-03 00:14:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:57,530 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_895 4294967296) 5000000) (< (mod (+ v_main_~x~0_895 1) 4294967296) (mod v_main_~y~0_77 4294967296))) InVars {main_~x~0=v_main_~x~0_895, main_~y~0=v_main_~y~0_77} OutVars{main_~x~0=v_main_~x~0_895, main_~y~0=v_main_~y~0_77} AuxVars[] AssignedVars[] [2021-05-03 00:14:57,531 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:57,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:57,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:57,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:57,890 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:14:57,910 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:58,046 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:58,247 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:58,249 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:58,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_897 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_78 4294967296)))) InVars {main_~x~0=v_main_~x~0_897, main_~y~0=v_main_~y~0_78} OutVars{main_~x~0=v_main_~x~0_897, main_~y~0=v_main_~y~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:14:58,252 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:58,267 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:58,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:58,378 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:58,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:58,425 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:58,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:58,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:58,602 INFO 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:02,188 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:02,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1582926428] [2021-05-03 00:15:02,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1582926428] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:02,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:02,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:15:02,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292319018] [2021-05-03 00:15:02,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:15:02,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:15:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:15:02,190 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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:15:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:07,198 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-05-03 00:15:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:15:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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:15:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:07,200 INFO L225 Difference]: With dead ends: 139 [2021-05-03 00:15:07,200 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:15:07,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 6 SyntacticMatches, 77 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 5613.4ms TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:15:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:15:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2021-05-03 00:15:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2021-05-03 00:15:07,221 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 125 [2021-05-03 00:15:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:07,222 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2021-05-03 00:15:07,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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:15:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2021-05-03 00:15:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-03 00:15:07,222 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:07,222 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:07,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-03 00:15:07,223 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:07,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1336650956, now seen corresponding path program 39 times [2021-05-03 00:15:07,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:07,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679170464] [2021-05-03 00:15:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:07,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_938 1) 4294967296) (mod v_main_~y~0_79 4294967296)) (< (mod v_main_~x~0_938 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_938, main_~y~0=v_main_~y~0_79} OutVars{main_~x~0=v_main_~x~0_938, main_~y~0=v_main_~y~0_79} AuxVars[] AssignedVars[] [2021-05-03 00:15:07,233 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:15:07,254 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:07,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:07,576 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:15:07,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:15:07,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:15:07,818 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:15:08,016 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:15:08,017 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:08,019 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_940 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_80 4294967296)))) InVars {main_~x~0=v_main_~x~0_940, main_~y~0=v_main_~y~0_80} OutVars{main_~x~0=v_main_~x~0_940, main_~y~0=v_main_~y~0_80} AuxVars[] AssignedVars[] [2021-05-03 00:15:08,021 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:15:08,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:08,038 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:10,079 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:15:10,206 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:15:10,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:15:10,276 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:15:10,344 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:10,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:10,439 INFO 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:15,130 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:15,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679170464] [2021-05-03 00:15:15,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679170464] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:15,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:15,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:15:15,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253994114] [2021-05-03 00:15:15,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:15:15,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:15:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:15:15,132 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:21,259 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-03 00:15:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:15:21,260 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-03 00:15:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:21,261 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:15:21,261 INFO L226 Difference]: Without dead ends: 134 [2021-05-03 00:15:21,262 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 6 SyntacticMatches, 79 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 7134.8ms TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:15:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-03 00:15:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-05-03 00:15:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-03 00:15:21,280 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2021-05-03 00:15:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:21,280 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-03 00:15:21,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-03 00:15:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:15:21,281 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:21,281 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:21,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-05-03 00:15:21,281 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash 674607332, now seen corresponding path program 40 times [2021-05-03 00:15:21,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:21,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [424597660] [2021-05-03 00:15:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:21,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_982 4294967296) 5000000) (< (mod (+ v_main_~x~0_982 1) 4294967296) (mod v_main_~y~0_81 4294967296))) InVars {main_~x~0=v_main_~x~0_982, main_~y~0=v_main_~y~0_81} OutVars{main_~x~0=v_main_~x~0_982, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[] [2021-05-03 00:15:21,304 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:15:21,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:21,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:21,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:15:21,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:15:21,677 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:15:21,862 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:15:21,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:21,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_984 4294967296))) (and (< .cse0 (mod v_main_~y~0_82 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_984, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_984, main_~y~0=v_main_~y~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:15:21,868 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:15:21,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:21,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:22,220 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:15:22,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:15:22,298 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:15:22,352 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:15:22,414 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:22,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:22,569 INFO 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:27,207 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:27,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [424597660] [2021-05-03 00:15:27,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [424597660] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:27,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:27,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:15:27,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136828478] [2021-05-03 00:15:27,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:15:27,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:27,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:15:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:15:27,209 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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:15:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:33,546 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-05-03 00:15:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:15:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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:15:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:33,549 INFO L225 Difference]: With dead ends: 145 [2021-05-03 00:15:33,549 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:15:33,557 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 81 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 7229.5ms TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:15:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:15:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2021-05-03 00:15:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-05-03 00:15:33,576 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 131 [2021-05-03 00:15:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:33,577 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-05-03 00:15:33,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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:15:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-05-03 00:15:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-05-03 00:15:33,577 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:33,577 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:33,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-03 00:15:33,577 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash 222827980, now seen corresponding path program 41 times [2021-05-03 00:15:33,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:33,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663019443] [2021-05-03 00:15:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:33,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1027 4294967296) 5000000) (< (mod (+ v_main_~x~0_1027 1) 4294967296) (mod v_main_~y~0_83 4294967296))) InVars {main_~x~0=v_main_~x~0_1027, main_~y~0=v_main_~y~0_83} OutVars{main_~x~0=v_main_~x~0_1027, main_~y~0=v_main_~y~0_83} AuxVars[] AssignedVars[] [2021-05-03 00:15:33,590 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:15:33,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:33,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:33,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:15:33,735 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:15:33,898 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:15:33,996 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:33,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1029 4294967296))) (and (< .cse0 (mod v_main_~y~0_84 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1029, main_~y~0=v_main_~y~0_84} OutVars{main_~x~0=v_main_~x~0_1029, main_~y~0=v_main_~y~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:15:34,006 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:15:34,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,341 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:15:34,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:15:34,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:15:34,493 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:15:34,554 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:39,586 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:39,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663019443] [2021-05-03 00:15:39,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [663019443] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:39,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:39,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:15:39,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805734877] [2021-05-03 00:15:39,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:15:39,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:39,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:15:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:15:39,588 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:46,028 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-03 00:15:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:15:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2021-05-03 00:15:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:46,030 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:15:46,030 INFO L226 Difference]: Without dead ends: 140 [2021-05-03 00:15:46,031 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 6 SyntacticMatches, 83 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 7467.1ms TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:15:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-05-03 00:15:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-05-03 00:15:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-03 00:15:46,056 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2021-05-03 00:15:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:46,057 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-03 00:15:46,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-03 00:15:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:15:46,058 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:46,058 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:46,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-05-03 00:15:46,058 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1691658212, now seen corresponding path program 42 times [2021-05-03 00:15:46,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:46,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446268856] [2021-05-03 00:15:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:46,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1073 4294967296) 5000000) (< (mod (+ v_main_~x~0_1073 1) 4294967296) (mod v_main_~y~0_85 4294967296))) InVars {main_~x~0=v_main_~x~0_1073, main_~y~0=v_main_~y~0_85} OutVars{main_~x~0=v_main_~x~0_1073, main_~y~0=v_main_~y~0_85} AuxVars[] AssignedVars[] [2021-05-03 00:15:46,069 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:15:46,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:46,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:46,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:15:46,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:15:46,403 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:15:46,554 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:15:46,557 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:46,559 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1075 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_86 4294967296)))) InVars {main_~x~0=v_main_~x~0_1075, main_~y~0=v_main_~y~0_86} OutVars{main_~x~0=v_main_~x~0_1075, main_~y~0=v_main_~y~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:15:46,560 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:15:46,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:46,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:46,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:15:46,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:15:46,754 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:15:46,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:46,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:46,955 INFO 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:53,044 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:53,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446268856] [2021-05-03 00:15:53,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1446268856] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:53,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:53,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:15:53,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869681720] [2021-05-03 00:15:53,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:15:53,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:53,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:15:53,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:15:53,045 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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:16:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:03,740 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2021-05-03 00:16:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:16:03,743 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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:16:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:03,744 INFO L225 Difference]: With dead ends: 151 [2021-05-03 00:16:03,744 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:16:03,744 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 6 SyntacticMatches, 85 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 10044.1ms TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:16:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:16:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-05-03 00:16:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2021-05-03 00:16:03,765 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2021-05-03 00:16:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:03,765 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2021-05-03 00:16:03,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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:16:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2021-05-03 00:16:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-05-03 00:16:03,766 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:03,766 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:03,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:16:03,766 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1808679220, now seen corresponding path program 43 times [2021-05-03 00:16:03,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:03,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410935681] [2021-05-03 00:16:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:03,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1120 1) 4294967296) (mod v_main_~y~0_87 4294967296)) (< (mod v_main_~x~0_1120 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1120, main_~y~0=v_main_~y~0_87} OutVars{main_~x~0=v_main_~x~0_1120, main_~y~0=v_main_~y~0_87} AuxVars[] AssignedVars[] [2021-05-03 00:16:03,782 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:16:03,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:16:04,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:16:04,258 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:16:04,503 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:16:04,517 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:04,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1122 4294967296))) (and (< .cse0 (mod v_main_~y~0_88 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_88} OutVars{main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:16:04,522 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:16:04,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:16:04,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:16:04,766 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:16:04,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:05,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:05,075 INFO 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:11,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:11,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410935681] [2021-05-03 00:16:11,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [410935681] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:11,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:11,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-03 00:16:11,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141087984] [2021-05-03 00:16:11,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-03 00:16:11,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-03 00:16:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:16:11,744 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:20,403 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-03 00:16:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:16:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2021-05-03 00:16:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:20,405 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:16:20,405 INFO L226 Difference]: Without dead ends: 146 [2021-05-03 00:16:20,405 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 87 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 9996.6ms TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:16:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-05-03 00:16:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-05-03 00:16:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-03 00:16:20,429 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2021-05-03 00:16:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:20,429 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-03 00:16:20,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-03 00:16:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:16:20,430 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:20,430 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:20,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-05-03 00:16:20,430 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1444830948, now seen corresponding path program 44 times [2021-05-03 00:16:20,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:20,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106262127] [2021-05-03 00:16:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:20,443 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1168 4294967296) 5000000) (< (mod (+ v_main_~x~0_1168 1) 4294967296) (mod v_main_~y~0_89 4294967296))) InVars {main_~x~0=v_main_~x~0_1168, main_~y~0=v_main_~y~0_89} OutVars{main_~x~0=v_main_~x~0_1168, main_~y~0=v_main_~y~0_89} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,445 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:16:20,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:16:20,795 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-05-03 00:16:20,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:16:20,951 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:16:21,069 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:16:21,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:21,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1170 4294967296))) (and (< .cse0 (mod v_main_~y~0_90 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1170, main_~y~0=v_main_~y~0_90} OutVars{main_~x~0=v_main_~x~0_1170, main_~y~0=v_main_~y~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:16:21,076 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:16:21,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,080 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,917 WARN L205 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:16:21,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:16:21,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:16:22,060 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:16:22,126 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:29,049 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:29,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106262127] [2021-05-03 00:16:29,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2106262127] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:29,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:29,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:16:29,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249178208] [2021-05-03 00:16:29,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:16:29,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:16:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-03 00:16:29,050 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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:16:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:39,068 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2021-05-03 00:16:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:16:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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:16:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:39,070 INFO L225 Difference]: With dead ends: 157 [2021-05-03 00:16:39,070 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:16:39,071 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 6 SyntacticMatches, 89 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 10466.7ms TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:16:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:16:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-05-03 00:16:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.013986013986014) internal successors, (145), 143 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2021-05-03 00:16:39,093 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2021-05-03 00:16:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:39,093 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2021-05-03 00:16:39,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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:16:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2021-05-03 00:16:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-05-03 00:16:39,094 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:39,094 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:39,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-03 00:16:39,096 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:39,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2055690292, now seen corresponding path program 45 times [2021-05-03 00:16:39,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:39,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288617313] [2021-05-03 00:16:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:39,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1217 4294967296) 5000000) (< (mod (+ v_main_~x~0_1217 1) 4294967296) (mod v_main_~y~0_91 4294967296))) InVars {main_~x~0=v_main_~x~0_1217, main_~y~0=v_main_~y~0_91} OutVars{main_~x~0=v_main_~x~0_1217, main_~y~0=v_main_~y~0_91} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,114 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:16:39,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,306 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:16:39,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:16:39,560 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:16:39,561 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:16:39,805 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:16:39,808 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:39,811 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1219 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_92 4294967296)))) InVars {main_~x~0=v_main_~x~0_1219, main_~y~0=v_main_~y~0_92} OutVars{main_~x~0=v_main_~x~0_1219, main_~y~0=v_main_~y~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,812 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:16:39,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:16:39,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:16:39,985 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:16:40,060 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,207 INFO 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:49,124 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:49,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288617313] [2021-05-03 00:16:49,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1288617313] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:49,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:49,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:16:49,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111022801] [2021-05-03 00:16:49,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:16:49,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:49,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:16:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:16:49,125 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:02,226 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-03 00:17:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:17:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2021-05-03 00:17:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:02,230 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:17:02,230 INFO L226 Difference]: Without dead ends: 152 [2021-05-03 00:17:02,231 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 6 SyntacticMatches, 91 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 13617.4ms TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:17:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-03 00:17:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-05-03 00:17:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-03 00:17:02,254 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2021-05-03 00:17:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:02,254 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-03 00:17:02,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-03 00:17:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:17:02,255 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:02,255 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:02,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-05-03 00:17:02,255 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 16963044, now seen corresponding path program 46 times [2021-05-03 00:17:02,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:02,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782712196] [2021-05-03 00:17:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:02,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1267 4294967296) 5000000) (< (mod (+ v_main_~x~0_1267 1) 4294967296) (mod v_main_~y~0_93 4294967296))) InVars {main_~x~0=v_main_~x~0_1267, main_~y~0=v_main_~y~0_93} OutVars{main_~x~0=v_main_~x~0_1267, main_~y~0=v_main_~y~0_93} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,269 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:17:02,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,274 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,590 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:17:02,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:17:02,949 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:17:02,990 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:17:03,226 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:17:03,230 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:03,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1269 4294967296))) (and (< .cse0 (mod v_main_~y~0_94 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1269, main_~y~0=v_main_~y~0_94} OutVars{main_~x~0=v_main_~x~0_1269, main_~y~0=v_main_~y~0_94} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,236 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:17:03,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:17:03,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:17:03,542 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:17:03,650 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:17:03,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:03,935 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 17 [2021-05-03 00:17:03,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:04,131 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2021-05-03 00:17:14,889 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:14,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782712196] [2021-05-03 00:17:14,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [782712196] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:14,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:14,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:17:14,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755723035] [2021-05-03 00:17:14,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:17:14,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:17:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:17:14,891 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 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:17:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:28,604 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2021-05-03 00:17:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:17:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 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:17:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:28,608 INFO L225 Difference]: With dead ends: 163 [2021-05-03 00:17:28,608 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:17:28,609 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 93 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 15658.2ms TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:17:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:17:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2021-05-03 00:17:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0134228187919463) internal successors, (151), 149 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2021-05-03 00:17:28,635 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2021-05-03 00:17:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2021-05-03 00:17:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 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:17:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2021-05-03 00:17:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-05-03 00:17:28,635 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:28,635 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:28,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-05-03 00:17:28,636 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1982648524, now seen corresponding path program 47 times [2021-05-03 00:17:28,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:28,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798168761] [2021-05-03 00:17:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:28,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1318 4294967296) 5000000) (< (mod (+ v_main_~x~0_1318 1) 4294967296) (mod v_main_~y~0_95 4294967296))) InVars {main_~x~0=v_main_~x~0_1318, main_~y~0=v_main_~y~0_95} OutVars{main_~x~0=v_main_~x~0_1318, main_~y~0=v_main_~y~0_95} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,649 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:17:28,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:17:29,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:17:29,245 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:17:29,631 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:17:29,633 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:29,636 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1320 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_96 4294967296)))) InVars {main_~x~0=v_main_~x~0_1320, main_~y~0=v_main_~y~0_96} OutVars{main_~x~0=v_main_~x~0_1320, main_~y~0=v_main_~y~0_96} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,638 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:17:29,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:30,377 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:17:30,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:17:30,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:17:30,538 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:17:30,647 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:17:30,652 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,906 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2021-05-03 00:17:30,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,977 INFO 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:31,141 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:17:43,471 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:43,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798168761] [2021-05-03 00:17:43,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1798168761] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:43,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:43,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:17:43,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834007026] [2021-05-03 00:17:43,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:17:43,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:17:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:17:43,473 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:02,224 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-03 00:18:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:18:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2021-05-03 00:18:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:02,228 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:18:02,228 INFO L226 Difference]: Without dead ends: 158 [2021-05-03 00:18:02,229 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 6 SyntacticMatches, 95 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 19041.7ms TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:18:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-03 00:18:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-05-03 00:18:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-03 00:18:02,253 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2021-05-03 00:18:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-03 00:18:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-03 00:18:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:18:02,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:02,254 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:02,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-05-03 00:18:02,254 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:02,254 INFO L82 PathProgramCache]: Analyzing trace with hash -160297756, now seen corresponding path program 48 times [2021-05-03 00:18:02,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:02,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893520816] [2021-05-03 00:18:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:02,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1370 1) 4294967296) (mod v_main_~y~0_97 4294967296)) (< (mod v_main_~x~0_1370 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1370, main_~y~0=v_main_~y~0_97} OutVars{main_~x~0=v_main_~x~0_1370, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[] [2021-05-03 00:18:02,269 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:18:02,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:18:02,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:18:02,728 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:18:02,903 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:18:02,906 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:02,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1372 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_98 4294967296)))) InVars {main_~x~0=v_main_~x~0_1372, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_1372, main_~y~0=v_main_~y~0_98} AuxVars[] AssignedVars[] [2021-05-03 00:18:02,912 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:18:02,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:03,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:18:03,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:18:03,192 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:18:03,306 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:18:03,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:03,568 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2021-05-03 00:18:03,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:03,618 INFO 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:03,742 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:18:16,386 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:16,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893520816] [2021-05-03 00:18:16,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [893520816] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:16,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:16,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:18:16,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668434112] [2021-05-03 00:18:16,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:18:16,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:18:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:18:16,388 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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:18:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:35,865 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2021-05-03 00:18:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:18:35,868 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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:18:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:35,868 INFO L225 Difference]: With dead ends: 169 [2021-05-03 00:18:35,869 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:18:35,869 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 6 SyntacticMatches, 97 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 19516.5ms TimeCoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2021-05-03 00:18:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:18:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2021-05-03 00:18:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.0129032258064516) internal successors, (157), 155 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2021-05-03 00:18:35,893 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 155 [2021-05-03 00:18:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:35,893 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2021-05-03 00:18:35,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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:18:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2021-05-03 00:18:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-03 00:18:35,894 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:35,894 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:35,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-05-03 00:18:35,894 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash -279037492, now seen corresponding path program 49 times [2021-05-03 00:18:35,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:35,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485293455] [2021-05-03 00:18:35,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:35,906 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1423 4294967296) 5000000) (< (mod (+ v_main_~x~0_1423 1) 4294967296) (mod v_main_~y~0_99 4294967296))) InVars {main_~x~0=v_main_~x~0_1423, main_~y~0=v_main_~y~0_99} OutVars{main_~x~0=v_main_~x~0_1423, main_~y~0=v_main_~y~0_99} AuxVars[] AssignedVars[] [2021-05-03 00:18:35,908 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:18:35,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:36,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:18:36,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:18:36,554 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:18:36,826 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:18:36,829 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:36,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1425 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_100 4294967296)))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_100} OutVars{main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_100} AuxVars[] AssignedVars[] [2021-05-03 00:18:36,835 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:18:36,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:36,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:37,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:18:37,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:18:37,181 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:18:37,283 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:18:37,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:37,495 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2021-05-03 00:18:37,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:37,548 INFO 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:37,669 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:18:53,056 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:53,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485293455] [2021-05-03 00:18:53,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [485293455] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:53,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:53,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:18:53,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886915181] [2021-05-03 00:18:53,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:18:53,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:18:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:18:53,058 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:18,285 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-03 00:19:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:19:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2021-05-03 00:19:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:18,292 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:19:18,292 INFO L226 Difference]: Without dead ends: 164 [2021-05-03 00:19:18,293 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 99 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 23904.5ms TimeCoverageRelationStatistics Valid=410, Invalid=10510, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:19:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-05-03 00:19:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-05-03 00:19:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-03 00:19:18,318 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2021-05-03 00:19:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:18,318 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-03 00:19:18,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-03 00:19:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:19:18,319 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:18,319 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:18,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-05-03 00:19:18,319 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1398539236, now seen corresponding path program 50 times [2021-05-03 00:19:18,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:18,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241446686] [2021-05-03 00:19:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:18,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1477 1) 4294967296) (mod v_main_~y~0_101 4294967296)) (< (mod v_main_~x~0_1477 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1477, main_~y~0=v_main_~y~0_101} OutVars{main_~x~0=v_main_~x~0_1477, main_~y~0=v_main_~y~0_101} AuxVars[] AssignedVars[] [2021-05-03 00:19:18,348 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:19:18,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:19,037 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:19:19,176 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:19:19,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:19:19,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:19:19,731 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:19:20,084 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:19:20,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:20,091 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1479 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_102 4294967296)))) InVars {main_~x~0=v_main_~x~0_1479, main_~y~0=v_main_~y~0_102} OutVars{main_~x~0=v_main_~x~0_1479, main_~y~0=v_main_~y~0_102} AuxVars[] AssignedVars[] [2021-05-03 00:19:20,094 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:19:20,128 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:20,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,743 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:19:21,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:19:21,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:19:21,890 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:19:22,019 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:19:22,023 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:22,382 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2021-05-03 00:19:22,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:22,464 INFO 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:22,628 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2021-05-03 00:19:37,595 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:37,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241446686] [2021-05-03 00:19:37,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [241446686] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:37,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:37,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:19:37,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015648982] [2021-05-03 00:19:37,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:19:37,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:19:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:19:37,596 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:20:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:07,480 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2021-05-03 00:20:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:20:07,487 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:20:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:07,488 INFO L225 Difference]: With dead ends: 175 [2021-05-03 00:20:07,488 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:20:07,489 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 6 SyntacticMatches, 101 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 24870.1ms TimeCoverageRelationStatistics Valid=418, Invalid=10924, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:20:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:20:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2021-05-03 00:20:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.0124223602484472) internal successors, (163), 161 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2021-05-03 00:20:07,515 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 161 [2021-05-03 00:20:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:07,515 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2021-05-03 00:20:07,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:20:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2021-05-03 00:20:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-05-03 00:20:07,516 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:07,516 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:07,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-05-03 00:20:07,516 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1847386828, now seen corresponding path program 51 times [2021-05-03 00:20:07,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:07,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28760519] [2021-05-03 00:20:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:07,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1532 1) 4294967296) (mod v_main_~y~0_103 4294967296)) (< (mod v_main_~x~0_1532 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1532, main_~y~0=v_main_~y~0_103} OutVars{main_~x~0=v_main_~x~0_1532, main_~y~0=v_main_~y~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,536 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:20:07,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:20:07,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:20:08,198 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:20:08,642 WARN L205 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:20:08,648 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:08,654 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1534 4294967296))) (and (< .cse0 (mod v_main_~y~0_104 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1534, main_~y~0=v_main_~y~0_104} OutVars{main_~x~0=v_main_~x~0_1534, main_~y~0=v_main_~y~0_104} AuxVars[] AssignedVars[] [2021-05-03 00:20:08,657 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:20:08,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,910 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:20:08,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:20:09,107 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:20:09,318 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:20:09,325 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:09,460 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2021-05-03 00:20:09,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:09,644 INFO 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:09,832 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:20:25,480 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:25,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28760519] [2021-05-03 00:20:25,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [28760519] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:25,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:25,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-03 00:20:25,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985580829] [2021-05-03 00:20:25,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-03 00:20:25,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-03 00:20:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:20:25,482 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:49,428 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:20:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:20:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2021-05-03 00:20:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:49,433 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:20:49,433 INFO L226 Difference]: Without dead ends: 170 [2021-05-03 00:20:49,434 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 6 SyntacticMatches, 103 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 23873.6ms TimeCoverageRelationStatistics Valid=426, Invalid=11346, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:20:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-05-03 00:20:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2021-05-03 00:20:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.0121951219512195) internal successors, (166), 164 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:20:49,459 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2021-05-03 00:20:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:49,460 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:20:49,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:20:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:20:49,460 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:49,460 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:49,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-05-03 00:20:49,461 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1062159644, now seen corresponding path program 52 times [2021-05-03 00:20:49,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:49,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609030181] [2021-05-03 00:20:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:49,488 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1588 4294967296) 5000000) (< (mod (+ v_main_~x~0_1588 1) 4294967296) (mod v_main_~y~0_105 4294967296))) InVars {main_~x~0=v_main_~x~0_1588, main_~y~0=v_main_~y~0_105} OutVars{main_~x~0=v_main_~x~0_1588, main_~y~0=v_main_~y~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:20:49,491 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:20:49,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:49,497 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:49,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:20:49,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:20:50,123 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:20:50,360 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:20:50,866 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:20:50,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:50,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1590 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_106 4294967296)))) InVars {main_~x~0=v_main_~x~0_1590, main_~y~0=v_main_~y~0_106} OutVars{main_~x~0=v_main_~x~0_1590, main_~y~0=v_main_~y~0_106} AuxVars[] AssignedVars[] [2021-05-03 00:20:50,877 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:20:50,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,020 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:20:51,416 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:20:51,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:20:51,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:20:51,608 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:20:51,769 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:20:51,774 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:52,007 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 18 [2021-05-03 00:20:52,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:52,088 INFO 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:52,322 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2021-05-03 00:21:10,319 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:10,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1609030181] [2021-05-03 00:21:10,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1609030181] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:10,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:10,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:21:10,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734906420] [2021-05-03 00:21:10,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:21:10,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:21:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:21:10,320 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:21:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:37,302 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2021-05-03 00:21:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:21:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:21:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:37,309 INFO L225 Difference]: With dead ends: 181 [2021-05-03 00:21:37,309 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:21:37,310 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 6 SyntacticMatches, 105 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 26620.4ms TimeCoverageRelationStatistics Valid=434, Invalid=11776, Unknown=0, NotChecked=0, Total=12210 [2021-05-03 00:21:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:21:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2021-05-03 00:21:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2021-05-03 00:21:37,338 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2021-05-03 00:21:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:37,338 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2021-05-03 00:21:37,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:21:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2021-05-03 00:21:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-05-03 00:21:37,339 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:37,339 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:37,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-03 00:21:37,339 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1668860876, now seen corresponding path program 53 times [2021-05-03 00:21:37,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:37,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812301633] [2021-05-03 00:21:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:37,367 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1645 4294967296) 5000000) (< (mod (+ v_main_~x~0_1645 1) 4294967296) (mod v_main_~y~0_107 4294967296))) InVars {main_~x~0=v_main_~x~0_1645, main_~y~0=v_main_~y~0_107} OutVars{main_~x~0=v_main_~x~0_1645, main_~y~0=v_main_~y~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:21:37,373 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:21:37,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:37,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:37,664 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:21:37,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:21:37,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:21:38,488 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:21:38,600 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:21:38,690 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:21:39,179 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:21:39,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:39,192 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1647 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_108 4294967296)))) InVars {main_~x~0=v_main_~x~0_1647, main_~y~0=v_main_~y~0_108} OutVars{main_~x~0=v_main_~x~0_1647, main_~y~0=v_main_~y~0_108} AuxVars[] AssignedVars[] [2021-05-03 00:21:39,195 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:21:39,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:39,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:39,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:21:39,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:21:39,714 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:21:39,973 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:21:39,980 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:40,165 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2021-05-03 00:21:40,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:40,392 INFO 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:40,632 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:21:57,844 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:57,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812301633] [2021-05-03 00:21:57,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [812301633] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:57,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:57,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:21:57,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118373757] [2021-05-03 00:21:57,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:21:57,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:21:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:21:57,846 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:23,426 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-03 00:22:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:22:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 170 [2021-05-03 00:22:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:23,432 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:22:23,432 INFO L226 Difference]: Without dead ends: 176 [2021-05-03 00:22:23,433 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 6 SyntacticMatches, 107 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 25966.7ms TimeCoverageRelationStatistics Valid=442, Invalid=12214, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:22:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-05-03 00:22:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2021-05-03 00:22:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.011764705882353) internal successors, (172), 170 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-03 00:22:23,461 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2021-05-03 00:22:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:23,461 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-03 00:22:23,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-03 00:22:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:22:23,462 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:23,462 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:23,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-05-03 00:22:23,462 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:23,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1935684068, now seen corresponding path program 54 times [2021-05-03 00:22:23,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:23,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1878367267] [2021-05-03 00:22:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:23,481 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1703 4294967296) 5000000) (< (mod (+ v_main_~x~0_1703 1) 4294967296) (mod v_main_~y~0_109 4294967296))) InVars {main_~x~0=v_main_~x~0_1703, main_~y~0=v_main_~y~0_109} OutVars{main_~x~0=v_main_~x~0_1703, main_~y~0=v_main_~y~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:22:23,484 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:22:23,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:23,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:23,873 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:22:23,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:22:24,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:22:24,245 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:22:24,582 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:22:24,587 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:24,591 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1705 4294967296))) (and (< .cse0 (mod v_main_~y~0_110 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1705, main_~y~0=v_main_~y~0_110} OutVars{main_~x~0=v_main_~x~0_1705, main_~y~0=v_main_~y~0_110} AuxVars[] AssignedVars[] [2021-05-03 00:22:24,594 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:22:24,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:24,599 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:24,977 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:22:25,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:22:25,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:22:25,236 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:22:25,388 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:22:25,393 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:25,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:25,641 INFO 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:25,802 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:22:44,090 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:44,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1878367267] [2021-05-03 00:22:44,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1878367267] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:44,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:44,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:22:44,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59634922] [2021-05-03 00:22:44,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:22:44,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:22:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:22:44,092 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:23:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:14,866 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2021-05-03 00:23:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:23:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:23:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:14,871 INFO L225 Difference]: With dead ends: 187 [2021-05-03 00:23:14,871 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:23:14,872 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 6 SyntacticMatches, 109 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 28455.9ms TimeCoverageRelationStatistics Valid=450, Invalid=12660, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:23:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:23:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2021-05-03 00:23:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.0115606936416186) internal successors, (175), 173 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:23:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2021-05-03 00:23:14,900 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 173 [2021-05-03 00:23:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:14,900 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2021-05-03 00:23:14,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:23:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2021-05-03 00:23:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-05-03 00:23:14,901 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:14,901 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:14,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-05-03 00:23:14,901 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:14,902 INFO L82 PathProgramCache]: Analyzing trace with hash 880932044, now seen corresponding path program 55 times [2021-05-03 00:23:14,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:14,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491818640] [2021-05-03 00:23:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:14,917 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1762 4294967296) 5000000) (< (mod (+ v_main_~x~0_1762 1) 4294967296) (mod v_main_~y~0_111 4294967296))) InVars {main_~x~0=v_main_~x~0_1762, main_~y~0=v_main_~y~0_111} OutVars{main_~x~0=v_main_~x~0_1762, main_~y~0=v_main_~y~0_111} AuxVars[] AssignedVars[] [2021-05-03 00:23:14,920 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:23:14,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:23:15,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:23:15,538 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:23:15,800 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:23:15,805 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:15,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1764 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_112 4294967296)))) InVars {main_~x~0=v_main_~x~0_1764, main_~y~0=v_main_~y~0_112} OutVars{main_~x~0=v_main_~x~0_1764, main_~y~0=v_main_~y~0_112} AuxVars[] AssignedVars[] [2021-05-03 00:23:15,813 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:23:15,856 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,860 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:16,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:23:16,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:23:16,266 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:23:16,421 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:23:16,426 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:16,572 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2021-05-03 00:23:16,750 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2021-05-03 00:23:16,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:16,825 INFO 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:17,014 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:23:39,094 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:39,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491818640] [2021-05-03 00:23:39,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1491818640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:39,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:39,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:23:39,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213170778] [2021-05-03 00:23:39,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:23:39,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:23:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:23:39,096 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:23:50,386 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:51,219 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:52,011 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:52,840 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:53,670 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:55,223 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:56,101 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:56,962 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:23:57,793 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:04,696 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:05,535 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:06,406 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:08,019 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:09,573 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:10,351 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:11,153 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:11,948 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:18,246 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-03 00:24:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:24:18,251 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2021-05-03 00:24:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:18,252 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:24:18,252 INFO L226 Difference]: Without dead ends: 182 [2021-05-03 00:24:18,253 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 6 SyntacticMatches, 111 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 35027.1ms TimeCoverageRelationStatistics Valid=458, Invalid=13114, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:24:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-03 00:24:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2021-05-03 00:24:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-03 00:24:18,282 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2021-05-03 00:24:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:18,282 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-03 00:24:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-03 00:24:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:24:18,283 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:18,283 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:18,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-05-03 00:24:18,283 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash 744122596, now seen corresponding path program 56 times [2021-05-03 00:24:18,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:18,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703463364] [2021-05-03 00:24:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:18,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1822 1) 4294967296) (mod v_main_~y~0_113 4294967296)) (< (mod v_main_~x~0_1822 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1822, main_~y~0=v_main_~y~0_113} OutVars{main_~x~0=v_main_~x~0_1822, main_~y~0=v_main_~y~0_113} AuxVars[] AssignedVars[] [2021-05-03 00:24:18,305 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:24:18,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:24:18,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:24:19,080 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:24:19,753 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:24:19,761 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:19,769 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1824 4294967296))) (and (< .cse0 (mod v_main_~y~0_114 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1824, main_~y~0=v_main_~y~0_114} OutVars{main_~x~0=v_main_~x~0_1824, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[] [2021-05-03 00:24:19,773 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:24:19,843 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:19,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:20,810 WARN L205 SmtUtils]: Spent 911.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:24:20,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:24:21,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:24:21,143 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:24:21,461 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:24:21,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:21,602 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2021-05-03 00:24:21,842 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2021-05-03 00:24:21,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:21,946 INFO 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:24:22,222 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:24:48,839 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:48,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703463364] [2021-05-03 00:24:48,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1703463364] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:48,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:48,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:24:48,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9745823] [2021-05-03 00:24:48,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:24:48,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:24:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:24:48,840 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:24:49,579 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-03 00:24:50,408 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:51,313 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:52,208 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:24:53,088 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:10,258 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:11,958 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:12,927 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:13,842 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:14,747 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:15,667 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:16,597 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:18,272 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:19,093 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:19,985 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:20,797 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:23,147 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:23,957 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:24,764 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:25,592 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:26,426 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:27,257 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:28,090 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:28,949 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:29,829 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:25:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:34,011 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2021-05-03 00:25:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:25:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:25:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:34,020 INFO L225 Difference]: With dead ends: 193 [2021-05-03 00:25:34,020 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:25:34,021 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 6 SyntacticMatches, 113 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 40935.4ms TimeCoverageRelationStatistics Valid=466, Invalid=13576, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:25:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:25:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2021-05-03 00:25:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.011173184357542) internal successors, (181), 179 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:25:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2021-05-03 00:25:34,059 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 179 [2021-05-03 00:25:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:34,059 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2021-05-03 00:25:34,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:25:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2021-05-03 00:25:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-05-03 00:25:34,060 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:34,060 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:34,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-05-03 00:25:34,060 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash 977821132, now seen corresponding path program 57 times [2021-05-03 00:25:34,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:34,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91059377] [2021-05-03 00:25:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:34,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1883 1) 4294967296) (mod v_main_~y~0_115 4294967296)) (< (mod v_main_~x~0_1883 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1883, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_1883, main_~y~0=v_main_~y~0_115} AuxVars[] AssignedVars[] [2021-05-03 00:25:34,084 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:25:34,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,173 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,484 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:25:34,725 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-05-03 00:25:34,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:25:35,052 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:25:35,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:25:35,305 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:25:35,722 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:25:35,812 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:25:36,186 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:25:36,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:25:36,201 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1885 4294967296))) (and (< .cse0 (mod v_main_~y~0_116 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1885, main_~y~0=v_main_~y~0_116} OutVars{main_~x~0=v_main_~x~0_1885, main_~y~0=v_main_~y~0_116} AuxVars[] AssignedVars[] [2021-05-03 00:25:36,205 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:25:36,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:36,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:36,446 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:25:36,617 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:25:36,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:25:36,899 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:25:37,345 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:25:37,352 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:25:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:37,505 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2021-05-03 00:25:37,654 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2021-05-03 00:25:37,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:37,789 INFO 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:25:38,107 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:25:38,263 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 22