/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:06:04,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:06:04,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:06:04,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:06:04,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:06:04,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:06:04,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:06:04,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:06:04,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:06:04,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:06:04,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:06:04,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:06:04,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:06:04,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:06:04,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:06:04,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:06:04,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:06:04,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:06:04,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:06:04,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:06:04,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:06:04,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:06:04,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:06:04,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:06:04,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:06:04,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:06:04,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:06:04,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:06:04,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:06:04,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:06:04,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:06:04,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:06:04,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:06:04,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:06:04,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:06:04,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:06:04,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:06:04,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:06:04,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:06:04,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:06:04,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:06:04,521 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:06:04,535 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:06:04,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:06:04,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:06:04,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:06:04,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:06:04,538 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:06:04,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:06:04,538 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:06:04,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:06:04,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:06:04,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:06:04,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:06:04,540 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:06:04,540 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:06:04,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:06:04,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:06:04,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:06:04,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:06:04,904 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:06:04,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2021-05-03 00:06:04,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3af60/585c59fa76094a3ebfd496fe257c3db7/FLAG582e2491e [2021-05-03 00:06:05,302 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:06:05,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2021-05-03 00:06:05,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3af60/585c59fa76094a3ebfd496fe257c3db7/FLAG582e2491e [2021-05-03 00:06:05,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3af60/585c59fa76094a3ebfd496fe257c3db7 [2021-05-03 00:06:05,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:06:05,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:06:05,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:06:05,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:06:05,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:06:05,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759e2373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05, skipping insertion in model container [2021-05-03 00:06:05,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:06:05,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:06:05,883 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_11.c[319,332] [2021-05-03 00:06:05,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:06:05,903 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:06:05,919 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_11.c[319,332] [2021-05-03 00:06:05,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:06:05,935 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:06:05,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05 WrapperNode [2021-05-03 00:06:05,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:06:05,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:06:05,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:06:05,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:06:05,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (1/1) ... [2021-05-03 00:06:05,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:06:05,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:06:05,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:06:05,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:06:05,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (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:06:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:06:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:06:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:06:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:06:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:06:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:06:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:06:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:06:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:06:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:06:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:06:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:06:06,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:06:06,323 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:06:06,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:06:06 BoogieIcfgContainer [2021-05-03 00:06:06,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:06:06,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:06:06,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:06:06,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:06:06,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:06:05" (1/3) ... [2021-05-03 00:06:06,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd08241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:06:06, skipping insertion in model container [2021-05-03 00:06:06,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:06:05" (2/3) ... [2021-05-03 00:06:06,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd08241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:06:06, skipping insertion in model container [2021-05-03 00:06:06,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:06:06" (3/3) ... [2021-05-03 00:06:06,335 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2021-05-03 00:06:06,339 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:06:06,342 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:06:06,375 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:06:06,401 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:06:06,401 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:06:06,401 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:06:06,401 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:06:06,401 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:06:06,401 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:06:06,401 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:06:06,401 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:06:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:06:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:06:06,427 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:06,428 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:06,428 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2021-05-03 00:06:06,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:06,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756583637] [2021-05-03 00:06:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:06,483 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:06:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:06,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:06,619 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:06,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756583637] [2021-05-03 00:06:06,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1756583637] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:06,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:06,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:06:06,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989863675] [2021-05-03 00:06:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:06:06,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:06:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:06:06,643 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:06,703 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-03 00:06:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:06:06,705 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:06:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:06,710 INFO L225 Difference]: With dead ends: 32 [2021-05-03 00:06:06,710 INFO L226 Difference]: Without dead ends: 13 [2021-05-03 00:06:06,713 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:06:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-03 00:06:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-03 00:06:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-03 00:06:06,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-03 00:06:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:06,757 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-03 00:06:06,757 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:06:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-03 00:06:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:06:06,758 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:06,759 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:06,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:06:06,761 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2021-05-03 00:06:06,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:06,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2005350567] [2021-05-03 00:06:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:06,773 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:06:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:06,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:06,931 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:06,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2005350567] [2021-05-03 00:06:06,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2005350567] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:06,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:06,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:06:06,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290780919] [2021-05-03 00:06:06,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:06:06,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:06,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:06:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:06:06,936 INFO L87 Difference]: Start difference. First operand 13 states and 14 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:06:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:07,044 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-03 00:06:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:06:07,046 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:06:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:07,047 INFO L225 Difference]: With dead ends: 22 [2021-05-03 00:06:07,047 INFO L226 Difference]: Without dead ends: 15 [2021-05-03 00:06:07,049 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:06:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-03 00:06:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-03 00:06:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-03 00:06:07,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-03 00:06:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:07,055 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-03 00:06:07,055 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:06:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-03 00:06:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-03 00:06:07,056 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:07,056 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:07,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:06:07,070 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2021-05-03 00:06:07,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:07,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357071179] [2021-05-03 00:06:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:07,111 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_11 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-03 00:06:07,132 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:07,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:07,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:07,236 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:07,265 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:07,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:07,463 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:07,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357071179] [2021-05-03 00:06:07,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [357071179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:07,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:07,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:06:07,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807293650] [2021-05-03 00:06:07,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:06:07,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:06:07,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:06:07,466 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:07,575 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-03 00:06:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:06:07,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-03 00:06:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:07,577 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:06:07,577 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:06:07,578 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 127.3ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:06:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:06:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-03 00:06:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-03 00:06:07,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-03 00:06:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:07,589 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-03 00:06:07,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-03 00:06:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:06:07,590 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:07,590 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:07,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:06:07,591 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1002491197, now seen corresponding path program 2 times [2021-05-03 00:06:07,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:07,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1542368243] [2021-05-03 00:06:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:07,603 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_15 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-03 00:06:07,610 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:07,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:07,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:07,678 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:07,704 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:07,710 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_17 1) 4294967296) 100000000) (< (mod v_main_~x~0_17 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:06:07,718 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:07,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:07,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:11,792 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:15,802 WARN L205 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:06:19,823 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:06:19,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:19,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:20,036 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:20,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:20,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:20,309 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:20,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1542368243] [2021-05-03 00:06:20,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1542368243] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:20,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:20,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:06:20,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799099309] [2021-05-03 00:06:20,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:06:20,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:06:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:06:20,313 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:20,461 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-03 00:06:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:06:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-03 00:06:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:20,464 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:06:20,464 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:06:20,465 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 171.9ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:06:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:06:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-03 00:06:20,472 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:06:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-03 00:06:20,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-03 00:06:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:20,473 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-03 00:06:20,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-03 00:06:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:06:20,475 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:20,475 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:20,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:06:20,476 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1927821798, now seen corresponding path program 3 times [2021-05-03 00:06:20,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:20,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223826520] [2021-05-03 00:06:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:20,483 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_22 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:06:20,493 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:20,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:20,544 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:20,574 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:20,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_24 4294967296) 10000000) (< (mod (+ v_main_~x~0_24 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:06:20,584 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:20,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:20,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:20,755 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:20,778 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:20,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:20,960 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:20,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223826520] [2021-05-03 00:06:20,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1223826520] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:20,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:20,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:06:20,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183574862] [2021-05-03 00:06:20,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:06:20,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:06:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:06:20,961 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:06:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:21,151 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-03 00:06:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:06:21,152 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:06:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:21,152 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:06:21,153 INFO L226 Difference]: Without dead ends: 21 [2021-05-03 00:06:21,153 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 247.3ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:06:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-03 00:06:21,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-03 00:06:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-03 00:06:21,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-03 00:06:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-03 00:06:21,164 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:06:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-03 00:06:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:06:21,165 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:21,165 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:21,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:06:21,166 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -460063817, now seen corresponding path program 4 times [2021-05-03 00:06:21,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:21,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268630383] [2021-05-03 00:06:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:21,173 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_30 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:06:21,177 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:21,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:21,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:21,228 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:21,257 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:21,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_32 1) 4294967296) 100000000) (< (mod v_main_~x~0_32 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:06:21,266 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:21,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:21,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:21,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:21,480 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:06:21,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:21,514 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:21,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:21,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:21,714 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:21,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268630383] [2021-05-03 00:06:21,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1268630383] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:21,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:21,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:06:21,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550156413] [2021-05-03 00:06:21,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:06:21,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:06:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:06:21,717 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:21,922 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-03 00:06:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:06:21,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-03 00:06:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:21,924 INFO L225 Difference]: With dead ends: 30 [2021-05-03 00:06:21,924 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:06:21,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 233.9ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:06:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:06:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-03 00:06:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-03 00:06:21,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-03 00:06:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:21,929 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-03 00:06:21,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-03 00:06:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:06:21,930 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:21,930 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:21,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:06:21,930 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1306082836, now seen corresponding path program 5 times [2021-05-03 00:06:21,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:21,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666542496] [2021-05-03 00:06:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:21,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_39 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:06:21,940 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:21,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:21,965 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:21,991 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:22,041 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:22,044 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_41 1) 4294967296) 100000000) (< (mod v_main_~x~0_41 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:06:22,046 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:22,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:22,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:22,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:22,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:22,226 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:22,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:22,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:22,527 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:22,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666542496] [2021-05-03 00:06:22,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [666542496] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:22,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:22,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:06:22,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458997960] [2021-05-03 00:06:22,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:06:22,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:06:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:06:22,529 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:22,885 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-05-03 00:06:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:06:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-03 00:06:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:22,888 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:06:22,888 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:06:22,889 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 449.1ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:06:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:06:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-05-03 00:06:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-05-03 00:06:22,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2021-05-03 00:06:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-05-03 00:06:22,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-05-03 00:06:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:06:22,915 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:22,915 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:22,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:06:22,915 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1623861518, now seen corresponding path program 6 times [2021-05-03 00:06:22,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:22,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [832861170] [2021-05-03 00:06:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:22,922 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_49 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:06:22,924 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:22,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:22,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:22,979 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:23,002 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:23,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_51 4294967296) 10000000) (< (mod (+ v_main_~x~0_51 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:06:23,007 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:23,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:23,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:23,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:23,210 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:23,264 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:23,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:23,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:23,555 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:23,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [832861170] [2021-05-03 00:06:23,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [832861170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:23,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:23,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:06:23,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443999332] [2021-05-03 00:06:23,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:06:23,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:06:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:06:23,559 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:23,937 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-05-03 00:06:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:06:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-03 00:06:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:23,939 INFO L225 Difference]: With dead ends: 36 [2021-05-03 00:06:23,939 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:06:23,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 423.9ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:06:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:06:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-03 00:06:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-03 00:06:23,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-03 00:06:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:23,948 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-03 00:06:23,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-03 00:06:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:06:23,949 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:23,949 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:23,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:06:23,949 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1791397461, now seen corresponding path program 7 times [2021-05-03 00:06:23,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:23,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625588550] [2021-05-03 00:06:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:23,955 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_61 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_61} OutVars{main_~x~0=v_main_~x~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:06:23,959 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:23,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:23,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:24,006 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:24,031 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:24,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_63 1) 4294967296) 100000000) (< (mod v_main_~x~0_63 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_63} OutVars{main_~x~0=v_main_~x~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:06:24,035 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:24,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:24,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:24,749 WARN L205 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:24,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:24,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:24,845 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:24,872 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:24,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:24,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:06:25,157 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:25,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625588550] [2021-05-03 00:06:25,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1625588550] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:25,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:25,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:06:25,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726697003] [2021-05-03 00:06:25,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:06:25,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:06:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:06:25,159 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:25,562 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-03 00:06:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:06:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-03 00:06:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:25,565 INFO L225 Difference]: With dead ends: 38 [2021-05-03 00:06:25,565 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:06:25,565 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 441.5ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:06:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:06:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-03 00:06:25,577 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:06:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-03 00:06:25,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-03 00:06:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:25,579 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-03 00:06:25,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-03 00:06:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:06:25,581 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:25,582 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:25,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:06:25,582 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1794705160, now seen corresponding path program 8 times [2021-05-03 00:06:25,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:25,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76736605] [2021-05-03 00:06:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:25,594 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_74 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,595 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:25,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:25,640 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:25,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:25,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_76 4294967296) 10000000) (< (mod (+ v_main_~x~0_76 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,671 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:25,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,775 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:25,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:25,820 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:25,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:25,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:26,145 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:26,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76736605] [2021-05-03 00:06:26,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [76736605] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:26,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:26,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:06:26,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058851134] [2021-05-03 00:06:26,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:06:26,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:06:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:06:26,147 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:26,566 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-03 00:06:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:06:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-03 00:06:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:26,567 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:06:26,567 INFO L226 Difference]: Without dead ends: 33 [2021-05-03 00:06:26,567 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 481.6ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:06:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-03 00:06:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-03 00:06:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-03 00:06:26,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-03 00:06:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-03 00:06:26,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-03 00:06:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:06:26,574 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:26,574 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:26,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:06:26,574 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash -819414747, now seen corresponding path program 9 times [2021-05-03 00:06:26,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:26,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [23929391] [2021-05-03 00:06:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:26,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_88 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_88} OutVars{main_~x~0=v_main_~x~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:06:26,582 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:26,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:26,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:26,624 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:26,646 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:26,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_90 1) 4294967296) 100000000) (< (mod v_main_~x~0_90 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_90} OutVars{main_~x~0=v_main_~x~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:06:26,650 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:26,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:26,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:26,818 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:06:26,868 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:27,005 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:06:27,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:27,042 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:27,060 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:27,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:27,362 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:27,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [23929391] [2021-05-03 00:06:27,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [23929391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:27,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:27,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:06:27,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969478707] [2021-05-03 00:06:27,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:06:27,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:27,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:06:27,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:06:27,364 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:27,819 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-03 00:06:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:06:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-03 00:06:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:27,820 INFO L225 Difference]: With dead ends: 42 [2021-05-03 00:06:27,820 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:06:27,821 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 489.5ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:06:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:06:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:06:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-03 00:06:27,826 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-03 00:06:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:27,826 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-03 00:06:27,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-03 00:06:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-03 00:06:27,827 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:27,827 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:27,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:06:27,827 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -432777214, now seen corresponding path program 10 times [2021-05-03 00:06:27,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:27,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515142523] [2021-05-03 00:06:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:27,835 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_103 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:06:27,836 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:27,845 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:27,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:27,874 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:27,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:27,896 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_105 1) 4294967296) 100000000) (< (mod v_main_~x~0_105 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:06:27,900 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:27,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:27,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:27,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:28,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:28,065 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:28,097 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:28,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:28,417 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:28,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515142523] [2021-05-03 00:06:28,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [515142523] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:28,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:28,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:06:28,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685780530] [2021-05-03 00:06:28,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:06:28,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:06:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:06:28,424 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:28,929 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-03 00:06:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:06:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-03 00:06:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:28,930 INFO L225 Difference]: With dead ends: 44 [2021-05-03 00:06:28,930 INFO L226 Difference]: Without dead ends: 37 [2021-05-03 00:06:28,930 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 557.1ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:06:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-03 00:06:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-03 00:06:28,937 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:06:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-03 00:06:28,937 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-03 00:06:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:28,938 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-03 00:06:28,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-03 00:06:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:06:28,938 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:28,939 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:28,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:06:28,939 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1758704543, now seen corresponding path program 11 times [2021-05-03 00:06:28,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:28,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [930266820] [2021-05-03 00:06:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:28,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_119 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_119} OutVars{main_~x~0=v_main_~x~0_119} AuxVars[] AssignedVars[] [2021-05-03 00:06:28,947 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:28,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:28,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:28,992 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:29,015 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:29,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_121 1) 4294967296) 100000000) (< (mod v_main_~x~0_121 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_121} OutVars{main_~x~0=v_main_~x~0_121} AuxVars[] AssignedVars[] [2021-05-03 00:06:29,021 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:29,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:29,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:29,075 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:29,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:29,121 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:29,143 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:29,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:29,555 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:29,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [930266820] [2021-05-03 00:06:29,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [930266820] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:29,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:29,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:06:29,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36542977] [2021-05-03 00:06:29,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:06:29,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:06:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:06:29,557 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:30,078 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-03 00:06:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:06:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-03 00:06:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:30,079 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:06:30,079 INFO L226 Difference]: Without dead ends: 39 [2021-05-03 00:06:30,080 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 642.5ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:06:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-03 00:06:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-03 00:06:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-03 00:06:30,085 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-03 00:06:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:30,086 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-03 00:06:30,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-03 00:06:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:06:30,087 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:30,087 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:30,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-03 00:06:30,087 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1056269316, now seen corresponding path program 12 times [2021-05-03 00:06:30,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:30,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984303654] [2021-05-03 00:06:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:30,094 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_136 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_136} OutVars{main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[] [2021-05-03 00:06:30,096 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:30,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:30,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:30,142 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:30,165 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:30,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_138 1) 4294967296) 100000000) (< (mod v_main_~x~0_138 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_138} OutVars{main_~x~0=v_main_~x~0_138} AuxVars[] AssignedVars[] [2021-05-03 00:06:30,168 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:30,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:30,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:30,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:30,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:30,420 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:30,440 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:30,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:30,846 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:30,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984303654] [2021-05-03 00:06:30,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [984303654] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:30,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:30,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:06:30,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346562426] [2021-05-03 00:06:30,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:06:30,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:30,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:06:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:06:30,848 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:31,434 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-03 00:06:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:06:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-03 00:06:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:31,439 INFO L225 Difference]: With dead ends: 48 [2021-05-03 00:06:31,439 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:06:31,440 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 693.0ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:06:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:06:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-03 00:06:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-03 00:06:31,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-03 00:06:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:31,445 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-03 00:06:31,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-03 00:06:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:06:31,446 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:31,446 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:31,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:06:31,446 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -416751335, now seen corresponding path program 13 times [2021-05-03 00:06:31,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:31,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982158637] [2021-05-03 00:06:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:31,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_154 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_154} OutVars{main_~x~0=v_main_~x~0_154} AuxVars[] AssignedVars[] [2021-05-03 00:06:31,453 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:31,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:31,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:31,553 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:31,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:31,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_156 1) 4294967296) 100000000) (< (mod v_main_~x~0_156 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_156} OutVars{main_~x~0=v_main_~x~0_156} AuxVars[] AssignedVars[] [2021-05-03 00:06:31,574 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:31,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:31,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:31,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:31,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:31,723 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:31,765 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:31,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:32,159 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:32,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982158637] [2021-05-03 00:06:32,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [982158637] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:32,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:32,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:06:32,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020657694] [2021-05-03 00:06:32,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:06:32,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:06:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:06:32,160 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:32,864 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-03 00:06:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:06:32,864 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-03 00:06:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:32,865 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:06:32,865 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:06:32,866 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 727.4ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:06:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:06:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-03 00:06:32,872 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:06:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-03 00:06:32,872 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-03 00:06:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:32,873 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-03 00:06:32,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-03 00:06:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:06:32,873 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:32,873 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:32,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:06:32,874 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -20294922, now seen corresponding path program 14 times [2021-05-03 00:06:32,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:32,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260508349] [2021-05-03 00:06:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:32,882 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_173 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_173} OutVars{main_~x~0=v_main_~x~0_173} AuxVars[] AssignedVars[] [2021-05-03 00:06:32,884 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:32,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:32,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:32,923 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:32,940 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:32,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_175 1) 4294967296) 100000000) (< (mod v_main_~x~0_175 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_175} OutVars{main_~x~0=v_main_~x~0_175} AuxVars[] AssignedVars[] [2021-05-03 00:06:32,944 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:32,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:32,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:34,970 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:06:35,110 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:35,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:35,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:35,218 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:35,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:35,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:35,740 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:35,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260508349] [2021-05-03 00:06:35,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [260508349] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:35,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:35,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:06:35,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432283294] [2021-05-03 00:06:35,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:06:35,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:06:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:06:35,743 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:36,468 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-03 00:06:36,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:06:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-03 00:06:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:36,469 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:06:36,469 INFO L226 Difference]: Without dead ends: 45 [2021-05-03 00:06:36,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 851.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:06:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-03 00:06:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-03 00:06:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-03 00:06:36,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-03 00:06:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:36,476 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-03 00:06:36,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-03 00:06:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:06:36,477 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:36,477 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:36,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-03 00:06:36,477 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1277771373, now seen corresponding path program 15 times [2021-05-03 00:06:36,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:36,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1745188725] [2021-05-03 00:06:36,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:36,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_193 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_193} OutVars{main_~x~0=v_main_~x~0_193} AuxVars[] AssignedVars[] [2021-05-03 00:06:36,484 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:36,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:36,525 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:36,544 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:36,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_195 4294967296) 10000000) (< (mod (+ v_main_~x~0_195 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_195} OutVars{main_~x~0=v_main_~x~0_195} AuxVars[] AssignedVars[] [2021-05-03 00:06:36,547 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:36,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,698 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:36,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:36,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:36,782 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:36,802 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:36,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:37,279 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:37,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1745188725] [2021-05-03 00:06:37,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1745188725] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:37,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:37,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:06:37,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737500390] [2021-05-03 00:06:37,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:06:37,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:06:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:06:37,280 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:38,093 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-03 00:06:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:06:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-03 00:06:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:38,095 INFO L225 Difference]: With dead ends: 54 [2021-05-03 00:06:38,095 INFO L226 Difference]: Without dead ends: 47 [2021-05-03 00:06:38,096 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 842.2ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:06:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-03 00:06:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-03 00:06:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-03 00:06:38,114 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-03 00:06:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:38,114 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-03 00:06:38,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-03 00:06:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-03 00:06:38,115 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:38,115 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:38,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:06:38,115 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1468136688, now seen corresponding path program 16 times [2021-05-03 00:06:38,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:38,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679242588] [2021-05-03 00:06:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:38,125 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_214 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_214} OutVars{main_~x~0=v_main_~x~0_214} AuxVars[] AssignedVars[] [2021-05-03 00:06:38,128 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:38,129 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:38,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:38,176 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:38,199 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:38,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_216 1) 4294967296) 100000000) (< (mod v_main_~x~0_216 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_216} OutVars{main_~x~0=v_main_~x~0_216} AuxVars[] AssignedVars[] [2021-05-03 00:06:38,203 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:38,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:38,221 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:38,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:38,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:38,468 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:38,491 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:39,088 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:39,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679242588] [2021-05-03 00:06:39,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679242588] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:39,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:39,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:06:39,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095504722] [2021-05-03 00:06:39,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:06:39,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:06:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:06:39,090 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:40,075 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2021-05-03 00:06:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:06:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-03 00:06:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:40,076 INFO L225 Difference]: With dead ends: 61 [2021-05-03 00:06:40,076 INFO L226 Difference]: Without dead ends: 51 [2021-05-03 00:06:40,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1080.4ms TimeCoverageRelationStatistics Valid=203, Invalid=1959, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:06:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-03 00:06:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-05-03 00:06:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-05-03 00:06:40,082 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2021-05-03 00:06:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:40,082 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-05-03 00:06:40,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-05-03 00:06:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:06:40,083 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:40,083 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:40,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:06:40,083 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash -671082006, now seen corresponding path program 17 times [2021-05-03 00:06:40,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:40,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [9015879] [2021-05-03 00:06:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:40,092 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_236 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_236} OutVars{main_~x~0=v_main_~x~0_236} AuxVars[] AssignedVars[] [2021-05-03 00:06:40,094 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:40,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:40,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:40,135 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:40,156 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:40,157 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_238 4294967296) 10000000) (< (mod (+ v_main_~x~0_238 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_238} OutVars{main_~x~0=v_main_~x~0_238} AuxVars[] AssignedVars[] [2021-05-03 00:06:40,159 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:40,170 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:40,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:40,500 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:40,544 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:40,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:40,604 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:40,628 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:40,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:41,334 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:41,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [9015879] [2021-05-03 00:06:41,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [9015879] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:41,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:41,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:06:41,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73980773] [2021-05-03 00:06:41,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:06:41,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:06:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:06:41,335 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:42,381 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-05-03 00:06:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:06:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-03 00:06:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:42,382 INFO L225 Difference]: With dead ends: 65 [2021-05-03 00:06:42,382 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:06:42,383 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1197.1ms TimeCoverageRelationStatistics Valid=222, Invalid=2328, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:06:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:06:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-05-03 00:06:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-05-03 00:06:42,390 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2021-05-03 00:06:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:42,390 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-05-03 00:06:42,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-05-03 00:06:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:06:42,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:42,391 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:42,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-03 00:06:42,391 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2116867612, now seen corresponding path program 18 times [2021-05-03 00:06:42,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:42,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209289588] [2021-05-03 00:06:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:42,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_260 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_260} OutVars{main_~x~0=v_main_~x~0_260} AuxVars[] AssignedVars[] [2021-05-03 00:06:42,400 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:42,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:42,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:42,440 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:42,460 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:42,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_262 1) 4294967296) 100000000) (< (mod v_main_~x~0_262 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_262} AuxVars[] AssignedVars[] [2021-05-03 00:06:42,463 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:42,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:42,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:43,207 WARN L205 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:06:43,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:43,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:43,253 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:43,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:43,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:43,920 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:43,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209289588] [2021-05-03 00:06:43,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [209289588] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:43,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:43,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:06:43,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539264110] [2021-05-03 00:06:43,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:06:43,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:06:43,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:06:43,921 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:44,982 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2021-05-03 00:06:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:06:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-03 00:06:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:44,983 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:06:44,983 INFO L226 Difference]: Without dead ends: 57 [2021-05-03 00:06:44,983 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1181.4ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:06:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-03 00:06:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-03 00:06:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-03 00:06:44,993 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-03 00:06:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:44,993 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-03 00:06:44,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-03 00:06:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:06:44,994 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:44,994 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:44,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:06:44,994 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1744464639, now seen corresponding path program 19 times [2021-05-03 00:06:44,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:44,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101238928] [2021-05-03 00:06:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:44,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_286 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_286} OutVars{main_~x~0=v_main_~x~0_286} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,001 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:45,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:45,033 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:45,054 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:45,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_288 4294967296) 10000000) (< (mod (+ v_main_~x~0_288 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_288} OutVars{main_~x~0=v_main_~x~0_288} AuxVars[] AssignedVars[] [2021-05-03 00:06:45,057 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:45,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,077 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:45,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:45,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:45,186 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:45,204 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:45,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:45,895 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:45,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101238928] [2021-05-03 00:06:45,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1101238928] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:45,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:45,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:06:45,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418530465] [2021-05-03 00:06:45,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:06:45,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:06:45,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:06:45,897 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:47,046 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-03 00:06:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:06:47,047 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-05-03 00:06:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:47,047 INFO L225 Difference]: With dead ends: 66 [2021-05-03 00:06:47,047 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:06:47,048 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1249.7ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:06:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:06:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-03 00:06:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-03 00:06:47,060 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-03 00:06:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:47,060 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-03 00:06:47,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-03 00:06:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-03 00:06:47,061 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:47,061 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:47,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:06:47,062 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -347493154, now seen corresponding path program 20 times [2021-05-03 00:06:47,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:47,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963120760] [2021-05-03 00:06:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:47,068 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_313 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_313} OutVars{main_~x~0=v_main_~x~0_313} AuxVars[] AssignedVars[] [2021-05-03 00:06:47,069 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:47,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:47,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:47,109 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:47,134 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:47,139 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_315 4294967296) 10000000) (< (mod (+ v_main_~x~0_315 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_315} OutVars{main_~x~0=v_main_~x~0_315} AuxVars[] AssignedVars[] [2021-05-03 00:06:47,141 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:47,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:47,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:47,195 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:47,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:47,257 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:47,281 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:47,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:48,141 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:48,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963120760] [2021-05-03 00:06:48,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [963120760] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:48,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:48,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:06:48,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314991079] [2021-05-03 00:06:48,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:06:48,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:48,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:06:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:06:48,143 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:49,361 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2021-05-03 00:06:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:06:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-03 00:06:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:49,363 INFO L225 Difference]: With dead ends: 73 [2021-05-03 00:06:49,363 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:06:49,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 23 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1509.3ms TimeCoverageRelationStatistics Valid=260, Invalid=3162, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:06:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:06:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-05-03 00:06:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-05-03 00:06:49,370 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2021-05-03 00:06:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:49,370 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-05-03 00:06:49,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-05-03 00:06:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:06:49,371 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:49,371 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:49,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-03 00:06:49,371 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -546168104, now seen corresponding path program 21 times [2021-05-03 00:06:49,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:49,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628507584] [2021-05-03 00:06:49,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:49,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_341 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_341} OutVars{main_~x~0=v_main_~x~0_341} AuxVars[] AssignedVars[] [2021-05-03 00:06:49,379 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:49,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:49,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:49,413 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:49,432 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:49,434 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_343 4294967296) 10000000) (< (mod (+ v_main_~x~0_343 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_343} OutVars{main_~x~0=v_main_~x~0_343} AuxVars[] AssignedVars[] [2021-05-03 00:06:49,436 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:49,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:49,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:50,267 WARN L205 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:50,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:50,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:50,315 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:50,337 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:50,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:51,203 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:51,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628507584] [2021-05-03 00:06:51,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1628507584] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:51,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:51,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:06:51,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356994280] [2021-05-03 00:06:51,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:06:51,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:06:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:06:51,204 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:52,605 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2021-05-03 00:06:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:06:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-03 00:06:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:52,606 INFO L225 Difference]: With dead ends: 72 [2021-05-03 00:06:52,606 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:06:52,607 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1558.2ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:06:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:06:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-03 00:06:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-03 00:06:52,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-03 00:06:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:52,613 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-03 00:06:52,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-03 00:06:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-03 00:06:52,614 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:52,614 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:52,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-03 00:06:52,615 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 164241653, now seen corresponding path program 22 times [2021-05-03 00:06:52,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:52,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774048170] [2021-05-03 00:06:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:52,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_371 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_371} OutVars{main_~x~0=v_main_~x~0_371} AuxVars[] AssignedVars[] [2021-05-03 00:06:52,620 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:52,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:52,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:52,657 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:52,677 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:52,679 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_373 1) 4294967296) 100000000) (< (mod v_main_~x~0_373 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_373} OutVars{main_~x~0=v_main_~x~0_373} AuxVars[] AssignedVars[] [2021-05-03 00:06:52,681 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:52,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:52,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:52,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:52,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:52,768 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:52,789 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:52,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:53,727 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:53,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774048170] [2021-05-03 00:06:53,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1774048170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:53,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:53,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:06:53,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334847483] [2021-05-03 00:06:53,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:06:53,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:06:53,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:06:53,728 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:55,169 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-03 00:06:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:06:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-03 00:06:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:55,170 INFO L225 Difference]: With dead ends: 74 [2021-05-03 00:06:55,170 INFO L226 Difference]: Without dead ends: 67 [2021-05-03 00:06:55,171 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1646.8ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:06:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-03 00:06:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-03 00:06:55,176 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:06:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-03 00:06:55,177 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-03 00:06:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:55,177 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-03 00:06:55,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-03 00:06:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:06:55,177 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:55,178 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:55,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:06:55,178 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:55,178 INFO L82 PathProgramCache]: Analyzing trace with hash -31781934, now seen corresponding path program 23 times [2021-05-03 00:06:55,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:55,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016274625] [2021-05-03 00:06:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:55,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_402 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-03 00:06:55,185 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:55,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:55,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:55,221 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:55,241 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:55,244 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_404 4294967296) 10000000) (< (mod (+ v_main_~x~0_404 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_404} OutVars{main_~x~0=v_main_~x~0_404} AuxVars[] AssignedVars[] [2021-05-03 00:06:55,246 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:55,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:55,261 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:56,023 WARN L205 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:56,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:56,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:56,109 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:56,129 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:56,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:57,115 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:57,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016274625] [2021-05-03 00:06:57,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016274625] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:57,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:57,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:06:57,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153649422] [2021-05-03 00:06:57,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:06:57,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:57,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:06:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:06:57,116 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:58,677 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-03 00:06:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:06:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-03 00:06:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:58,678 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:06:58,678 INFO L226 Difference]: Without dead ends: 69 [2021-05-03 00:06:58,679 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1745.9ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:06:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-03 00:06:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-03 00:06:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-03 00:06:58,686 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-03 00:06:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:58,686 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-03 00:06:58,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-03 00:06:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:06:58,687 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:58,687 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:58,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-03 00:06:58,687 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash 568111983, now seen corresponding path program 24 times [2021-05-03 00:06:58,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:58,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129929096] [2021-05-03 00:06:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:58,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_434 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_434} OutVars{main_~x~0=v_main_~x~0_434} AuxVars[] AssignedVars[] [2021-05-03 00:06:58,694 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:06:58,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:58,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:06:58,725 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:06:58,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:58,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_436 4294967296) 10000000) (< (mod (+ v_main_~x~0_436 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_436} OutVars{main_~x~0=v_main_~x~0_436} AuxVars[] AssignedVars[] [2021-05-03 00:06:58,759 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:06:58,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:58,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:58,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:06:58,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:06:58,935 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:06:58,953 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:59,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:59,986 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:59,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129929096] [2021-05-03 00:06:59,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1129929096] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:59,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:59,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:06:59,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263886409] [2021-05-03 00:06:59,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:06:59,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:06:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:06:59,987 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:01,762 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-03 00:07:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:07:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-03 00:07:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:01,763 INFO L225 Difference]: With dead ends: 78 [2021-05-03 00:07:01,763 INFO L226 Difference]: Without dead ends: 71 [2021-05-03 00:07:01,764 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1923.4ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:07:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-03 00:07:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-03 00:07:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-03 00:07:01,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-03 00:07:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:01,770 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-03 00:07:01,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-03 00:07:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-03 00:07:01,771 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:01,771 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:01,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-03 00:07:01,771 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1540548556, now seen corresponding path program 25 times [2021-05-03 00:07:01,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:01,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1386665978] [2021-05-03 00:07:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:01,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_467 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_467} OutVars{main_~x~0=v_main_~x~0_467} AuxVars[] AssignedVars[] [2021-05-03 00:07:01,780 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:01,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:01,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:01,817 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:01,836 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:01,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_469 1) 4294967296) 100000000) (< (mod v_main_~x~0_469 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_469} OutVars{main_~x~0=v_main_~x~0_469} AuxVars[] AssignedVars[] [2021-05-03 00:07:01,838 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:01,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:01,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:02,347 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:02,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:02,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:02,424 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:02,448 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:02,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:03,460 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:03,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1386665978] [2021-05-03 00:07:03,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1386665978] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:03,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:03,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:07:03,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573583704] [2021-05-03 00:07:03,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:07:03,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:03,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:07:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:07:03,462 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:05,197 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-03 00:07:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:07:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-03 00:07:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:05,198 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:07:05,198 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:07:05,199 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1865.1ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:07:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:07:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-03 00:07:05,205 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:07:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-03 00:07:05,206 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-03 00:07:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:05,206 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-03 00:07:05,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-03 00:07:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:07:05,207 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:05,207 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:05,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:07:05,207 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash -250775319, now seen corresponding path program 26 times [2021-05-03 00:07:05,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:05,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547314813] [2021-05-03 00:07:05,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:05,213 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_501 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_501} OutVars{main_~x~0=v_main_~x~0_501} AuxVars[] AssignedVars[] [2021-05-03 00:07:05,214 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:05,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:05,255 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:05,279 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:05,280 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_503 1) 4294967296) 100000000) (< (mod v_main_~x~0_503 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_503} OutVars{main_~x~0=v_main_~x~0_503} AuxVars[] AssignedVars[] [2021-05-03 00:07:05,281 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:05,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,659 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:05,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:05,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:05,740 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:05,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:05,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:06,968 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:06,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547314813] [2021-05-03 00:07:06,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1547314813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:06,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:06,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:07:06,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679132554] [2021-05-03 00:07:06,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:07:06,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:07:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:07:06,970 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 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:07:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:08,809 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-03 00:07:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:07:08,810 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 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:07:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:08,810 INFO L225 Difference]: With dead ends: 82 [2021-05-03 00:07:08,810 INFO L226 Difference]: Without dead ends: 75 [2021-05-03 00:07:08,812 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 4 SyntacticMatches, 30 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 2025.2ms TimeCoverageRelationStatistics Valid=297, Invalid=4533, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:07:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-03 00:07:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-03 00:07:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-03 00:07:08,818 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-03 00:07:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:08,819 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-03 00:07:08,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 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:07:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-03 00:07:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:07:08,819 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:08,820 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:08,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-03 00:07:08,820 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 568866502, now seen corresponding path program 27 times [2021-05-03 00:07:08,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:08,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544535486] [2021-05-03 00:07:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:08,826 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_536 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_536} OutVars{main_~x~0=v_main_~x~0_536} AuxVars[] AssignedVars[] [2021-05-03 00:07:08,829 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:08,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:08,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:08,876 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:08,902 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:08,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_538 1) 4294967296) 100000000) (< (mod v_main_~x~0_538 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_538} OutVars{main_~x~0=v_main_~x~0_538} AuxVars[] AssignedVars[] [2021-05-03 00:07:08,906 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:08,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:08,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:09,585 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:09,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:09,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:09,613 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:09,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:09,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:10,770 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:10,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544535486] [2021-05-03 00:07:10,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [544535486] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:10,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:10,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:07:10,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160253241] [2021-05-03 00:07:10,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:07:10,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:07:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:07:10,772 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:12,790 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-03 00:07:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:07:12,791 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-03 00:07:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:12,792 INFO L225 Difference]: With dead ends: 84 [2021-05-03 00:07:12,792 INFO L226 Difference]: Without dead ends: 77 [2021-05-03 00:07:12,792 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2156.7ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:07:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-03 00:07:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-03 00:07:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-03 00:07:12,801 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-03 00:07:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:12,801 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-03 00:07:12,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-03 00:07:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-03 00:07:12,801 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:12,801 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:12,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-03 00:07:12,802 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2029325981, now seen corresponding path program 28 times [2021-05-03 00:07:12,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:12,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586734557] [2021-05-03 00:07:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:12,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_572 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_572} OutVars{main_~x~0=v_main_~x~0_572} AuxVars[] AssignedVars[] [2021-05-03 00:07:12,807 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:12,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,820 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:12,843 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:12,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:12,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_574 1) 4294967296) 100000000) (< (mod v_main_~x~0_574 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_574} OutVars{main_~x~0=v_main_~x~0_574} AuxVars[] AssignedVars[] [2021-05-03 00:07:12,868 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:12,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:12,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:13,038 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:13,070 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:13,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:14,272 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:14,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586734557] [2021-05-03 00:07:14,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586734557] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:14,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:14,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:07:14,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291850774] [2021-05-03 00:07:14,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:07:14,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:14,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:07:14,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:07:14,274 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:16,293 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-03 00:07:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:07:16,294 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-05-03 00:07:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:16,295 INFO L225 Difference]: With dead ends: 86 [2021-05-03 00:07:16,295 INFO L226 Difference]: Without dead ends: 79 [2021-05-03 00:07:16,296 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2195.6ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:07:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-03 00:07:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-03 00:07:16,308 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:07:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-03 00:07:16,308 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-03 00:07:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:16,308 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-03 00:07:16,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-03 00:07:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:07:16,309 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:16,309 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:16,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:07:16,309 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 778664128, now seen corresponding path program 29 times [2021-05-03 00:07:16,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:16,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806229707] [2021-05-03 00:07:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:16,316 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_609 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_609} OutVars{main_~x~0=v_main_~x~0_609} AuxVars[] AssignedVars[] [2021-05-03 00:07:16,317 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:16,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:16,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:16,352 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:16,369 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:16,370 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_611 1) 4294967296) 100000000) (< (mod v_main_~x~0_611 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_611} OutVars{main_~x~0=v_main_~x~0_611} AuxVars[] AssignedVars[] [2021-05-03 00:07:16,371 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:16,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:16,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:16,691 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:16,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:16,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:16,759 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:16,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:16,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:18,155 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:18,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806229707] [2021-05-03 00:07:18,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1806229707] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:18,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:18,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:07:18,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285306449] [2021-05-03 00:07:18,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:07:18,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:07:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:07:18,157 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 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:07:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:20,365 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2021-05-03 00:07:20,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:07:20,365 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 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:07:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:20,366 INFO L225 Difference]: With dead ends: 93 [2021-05-03 00:07:20,366 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:07:20,367 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 33 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 2398.0ms TimeCoverageRelationStatistics Valid=355, Invalid=5807, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:07:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:07:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-05-03 00:07:20,373 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:07:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-03 00:07:20,374 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2021-05-03 00:07:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:20,374 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-03 00:07:20,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 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:07:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-03 00:07:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-03 00:07:20,375 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:20,375 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:20,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:07:20,375 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1272631878, now seen corresponding path program 30 times [2021-05-03 00:07:20,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:20,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512092757] [2021-05-03 00:07:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:20,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_647 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_647} AuxVars[] AssignedVars[] [2021-05-03 00:07:20,385 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:20,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:20,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:22,516 WARN L205 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-03 00:07:22,522 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:22,540 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:22,542 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_649 4294967296) 10000000) (< (mod (+ v_main_~x~0_649 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_649} OutVars{main_~x~0=v_main_~x~0_649} AuxVars[] AssignedVars[] [2021-05-03 00:07:22,544 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:22,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:22,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:24,579 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:07:24,817 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:07:24,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:24,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:24,874 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:24,893 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:24,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:26,360 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:26,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512092757] [2021-05-03 00:07:26,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [512092757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:26,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:26,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:07:26,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721288743] [2021-05-03 00:07:26,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:07:26,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:07:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:07:26,362 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:28,733 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2021-05-03 00:07:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:07:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-03 00:07:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:28,734 INFO L225 Difference]: With dead ends: 92 [2021-05-03 00:07:28,734 INFO L226 Difference]: Without dead ends: 85 [2021-05-03 00:07:28,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 7 SyntacticMatches, 36 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 2599.4ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:07:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-03 00:07:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-03 00:07:28,743 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:07:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-03 00:07:28,743 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-03 00:07:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:28,743 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-03 00:07:28,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-03 00:07:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-03 00:07:28,744 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:28,744 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:28,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:07:28,744 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2112224087, now seen corresponding path program 31 times [2021-05-03 00:07:28,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:28,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1358419854] [2021-05-03 00:07:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:28,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_687 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_687} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[] [2021-05-03 00:07:28,750 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:28,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:28,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:28,784 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:28,802 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:28,803 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_689 1) 4294967296) 100000000) (< (mod v_main_~x~0_689 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_689} OutVars{main_~x~0=v_main_~x~0_689} AuxVars[] AssignedVars[] [2021-05-03 00:07:28,804 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:28,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:28,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:28,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:28,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:28,900 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:28,918 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:28,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:30,429 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:30,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1358419854] [2021-05-03 00:07:30,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1358419854] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:30,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:30,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:07:30,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775614291] [2021-05-03 00:07:30,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:07:30,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:07:30,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:07:30,431 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:32,992 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-03 00:07:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:07:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-03 00:07:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:32,993 INFO L225 Difference]: With dead ends: 94 [2021-05-03 00:07:32,993 INFO L226 Difference]: Without dead ends: 87 [2021-05-03 00:07:32,993 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2766.4ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:07:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-03 00:07:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-03 00:07:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-03 00:07:33,002 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-03 00:07:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:33,002 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-03 00:07:33,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-03 00:07:33,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-03 00:07:33,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:33,003 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:33,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:07:33,003 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:33,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:33,004 INFO L82 PathProgramCache]: Analyzing trace with hash -626403916, now seen corresponding path program 32 times [2021-05-03 00:07:33,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:33,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262747517] [2021-05-03 00:07:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:33,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_728 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_728} OutVars{main_~x~0=v_main_~x~0_728} AuxVars[] AssignedVars[] [2021-05-03 00:07:33,011 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:33,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:33,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:33,052 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:33,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:33,073 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_730 4294967296) 10000000) (< (mod (+ v_main_~x~0_730 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_730} AuxVars[] AssignedVars[] [2021-05-03 00:07:33,075 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:33,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:33,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:33,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:33,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:33,266 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:33,294 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:33,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:35,022 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:35,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262747517] [2021-05-03 00:07:35,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [262747517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:35,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:35,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:07:35,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527697526] [2021-05-03 00:07:35,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:07:35,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:07:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:07:35,024 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:37,622 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-03 00:07:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:07:37,623 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-05-03 00:07:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:37,624 INFO L225 Difference]: With dead ends: 96 [2021-05-03 00:07:37,624 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:07:37,624 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2970.7ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:07:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:07:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-03 00:07:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-03 00:07:37,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-03 00:07:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:37,638 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-03 00:07:37,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-03 00:07:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:07:37,639 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:37,639 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:37,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-03 00:07:37,639 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash 367037649, now seen corresponding path program 33 times [2021-05-03 00:07:37,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:37,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334861930] [2021-05-03 00:07:37,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:37,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_770 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_770} OutVars{main_~x~0=v_main_~x~0_770} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,649 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:37,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:37,733 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:37,751 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:37,753 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_772 4294967296) 10000000) (< (mod (+ v_main_~x~0_772 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_772} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,754 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:37,766 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,768 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,279 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:07:38,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:38,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:38,397 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:38,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:38,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:40,066 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:40,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334861930] [2021-05-03 00:07:40,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [334861930] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:40,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:40,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:07:40,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626216907] [2021-05-03 00:07:40,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:07:40,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:07:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:07:40,067 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:42,841 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-03 00:07:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:07:42,842 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-03 00:07:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:42,842 INFO L225 Difference]: With dead ends: 98 [2021-05-03 00:07:42,843 INFO L226 Difference]: Without dead ends: 91 [2021-05-03 00:07:42,843 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 7 SyntacticMatches, 39 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 2970.1ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:07:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-03 00:07:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-03 00:07:42,852 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:07:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-03 00:07:42,853 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-03 00:07:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:42,853 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-03 00:07:42,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-03 00:07:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:07:42,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:42,854 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:42,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:07:42,854 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1581641902, now seen corresponding path program 34 times [2021-05-03 00:07:42,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:42,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167358144] [2021-05-03 00:07:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:42,860 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_813 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_813} OutVars{main_~x~0=v_main_~x~0_813} AuxVars[] AssignedVars[] [2021-05-03 00:07:42,861 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:42,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:42,878 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:42,892 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:42,913 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:42,914 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_815 1) 4294967296) 100000000) (< (mod v_main_~x~0_815 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_815} OutVars{main_~x~0=v_main_~x~0_815} AuxVars[] AssignedVars[] [2021-05-03 00:07:42,915 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:42,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:42,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:45,023 WARN L205 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:45,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:45,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:45,095 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:45,117 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:45,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:46,826 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:46,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167358144] [2021-05-03 00:07:46,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [167358144] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:46,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:46,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:07:46,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427971452] [2021-05-03 00:07:46,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:07:46,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:07:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:07:46,827 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:49,681 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-03 00:07:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:07:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-03 00:07:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:49,682 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:07:49,683 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:07:49,683 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 7 SyntacticMatches, 40 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3079.7ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:07:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:07:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-03 00:07:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-03 00:07:49,690 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-03 00:07:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:49,690 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-03 00:07:49,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-03 00:07:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:07:49,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:49,691 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:49,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:07:49,691 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 585224523, now seen corresponding path program 35 times [2021-05-03 00:07:49,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:49,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644399781] [2021-05-03 00:07:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:49,695 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_857 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,696 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:49,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:49,733 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:49,752 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:49,755 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_859 1) 4294967296) 100000000) (< (mod v_main_~x~0_859 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_859} OutVars{main_~x~0=v_main_~x~0_859} AuxVars[] AssignedVars[] [2021-05-03 00:07:49,756 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:49,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:49,938 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:07:49,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:49,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:49,998 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:50,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:50,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:51,897 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:51,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644399781] [2021-05-03 00:07:51,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1644399781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:51,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:51,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:07:51,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36520498] [2021-05-03 00:07:51,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:07:51,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:07:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:07:51,899 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:54,879 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-03 00:07:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:07:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-03 00:07:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:54,880 INFO L225 Difference]: With dead ends: 102 [2021-05-03 00:07:54,880 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:07:54,880 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 6 SyntacticMatches, 42 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 3290.6ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:07:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:07:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-03 00:07:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-03 00:07:54,890 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-03 00:07:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:54,891 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-03 00:07:54,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-03 00:07:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-03 00:07:54,891 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:54,891 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:54,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-03 00:07:54,891 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 805830312, now seen corresponding path program 36 times [2021-05-03 00:07:54,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:54,892 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [875291255] [2021-05-03 00:07:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:54,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_902 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_902} OutVars{main_~x~0=v_main_~x~0_902} AuxVars[] AssignedVars[] [2021-05-03 00:07:54,898 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:07:54,906 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:54,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:07:54,930 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:07:54,949 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:54,950 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_904 1) 4294967296) 100000000) (< (mod v_main_~x~0_904 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_904} OutVars{main_~x~0=v_main_~x~0_904} AuxVars[] AssignedVars[] [2021-05-03 00:07:54,951 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:07:54,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:54,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:55,003 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:07:55,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:07:55,045 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:07:55,063 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:55,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:57,020 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:57,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [875291255] [2021-05-03 00:07:57,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [875291255] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:57,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:57,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:07:57,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520985082] [2021-05-03 00:07:57,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:07:57,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:07:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:07:57,022 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:00,158 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-03 00:08:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:08:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-03 00:08:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:00,159 INFO L225 Difference]: With dead ends: 104 [2021-05-03 00:08:00,159 INFO L226 Difference]: Without dead ends: 97 [2021-05-03 00:08:00,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 3464.7ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:08:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-03 00:08:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-03 00:08:00,168 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:08:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-03 00:08:00,169 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-03 00:08:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:00,169 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-03 00:08:00,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-03 00:08:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:08:00,170 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:00,170 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:00,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:08:00,170 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1940371259, now seen corresponding path program 37 times [2021-05-03 00:08:00,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:00,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351369840] [2021-05-03 00:08:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:00,176 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_948 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_948} OutVars{main_~x~0=v_main_~x~0_948} AuxVars[] AssignedVars[] [2021-05-03 00:08:00,178 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:00,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:00,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:00,220 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:00,238 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:00,239 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_950 1) 4294967296) 100000000) (< (mod v_main_~x~0_950 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_950} OutVars{main_~x~0=v_main_~x~0_950} AuxVars[] AssignedVars[] [2021-05-03 00:08:00,241 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:00,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:00,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:04,271 WARN L205 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:08:04,377 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:08:04,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:04,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:04,439 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:04,460 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:04,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:06,375 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:06,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351369840] [2021-05-03 00:08:06,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1351369840] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:06,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:06,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:08:06,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844315782] [2021-05-03 00:08:06,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:08:06,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:08:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:08:06,376 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:09,619 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-03 00:08:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:08:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-03 00:08:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:09,620 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:08:09,620 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:08:09,621 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 7 SyntacticMatches, 43 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 3475.0ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:08:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:08:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-03 00:08:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-03 00:08:09,630 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-03 00:08:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:09,630 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-03 00:08:09,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-03 00:08:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:08:09,631 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:09,631 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:09,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:08:09,631 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash 364806050, now seen corresponding path program 38 times [2021-05-03 00:08:09,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:09,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515136530] [2021-05-03 00:08:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:09,637 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_995 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_995} OutVars{main_~x~0=v_main_~x~0_995} AuxVars[] AssignedVars[] [2021-05-03 00:08:09,638 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:09,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:09,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:09,680 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:09,702 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:09,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_997 1) 4294967296) 100000000) (< (mod v_main_~x~0_997 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_997} OutVars{main_~x~0=v_main_~x~0_997} AuxVars[] AssignedVars[] [2021-05-03 00:08:09,705 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:09,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:09,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:09,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:09,755 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:09,790 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:09,816 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:09,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:11,863 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:11,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515136530] [2021-05-03 00:08:11,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1515136530] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:11,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:11,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:08:11,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154240935] [2021-05-03 00:08:11,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:08:11,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:08:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2481, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:08:11,865 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:15,203 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-05-03 00:08:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:08:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-03 00:08:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:15,204 INFO L225 Difference]: With dead ends: 113 [2021-05-03 00:08:15,204 INFO L226 Difference]: Without dead ends: 103 [2021-05-03 00:08:15,205 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 4 SyntacticMatches, 43 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 3579.6ms TimeCoverageRelationStatistics Valid=450, Invalid=9252, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:08:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-03 00:08:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2021-05-03 00:08:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2021-05-03 00:08:15,215 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2021-05-03 00:08:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2021-05-03 00:08:15,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2021-05-03 00:08:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-03 00:08:15,216 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:15,216 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:15,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:08:15,216 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1240986524, now seen corresponding path program 39 times [2021-05-03 00:08:15,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:15,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [532307841] [2021-05-03 00:08:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:15,222 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1043 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1043} OutVars{main_~x~0=v_main_~x~0_1043} AuxVars[] AssignedVars[] [2021-05-03 00:08:15,224 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:15,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:15,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:15,260 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:15,279 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:15,280 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1045 1) 4294967296) 100000000) (< (mod v_main_~x~0_1045 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1045} OutVars{main_~x~0=v_main_~x~0_1045} AuxVars[] AssignedVars[] [2021-05-03 00:08:15,282 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:15,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:15,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:15,310 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:15,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:15,370 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:15,390 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:15,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:17,620 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:17,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [532307841] [2021-05-03 00:08:17,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [532307841] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:17,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:17,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:08:17,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886835312] [2021-05-03 00:08:17,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:08:17,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:17,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:08:17,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:08:17,622 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:21,281 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2021-05-03 00:08:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:08:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-03 00:08:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:21,282 INFO L225 Difference]: With dead ends: 112 [2021-05-03 00:08:21,282 INFO L226 Difference]: Without dead ends: 105 [2021-05-03 00:08:21,283 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 7 SyntacticMatches, 46 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 3964.0ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:08:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-03 00:08:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-03 00:08:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-03 00:08:21,291 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-03 00:08:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:21,291 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-03 00:08:21,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-03 00:08:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-03 00:08:21,292 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:21,292 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:21,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:08:21,292 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -367079239, now seen corresponding path program 40 times [2021-05-03 00:08:21,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:21,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633077102] [2021-05-03 00:08:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:21,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1093 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1093} OutVars{main_~x~0=v_main_~x~0_1093} AuxVars[] AssignedVars[] [2021-05-03 00:08:21,302 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:21,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:21,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:21,352 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:21,376 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:21,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1095 4294967296) 10000000) (< (mod (+ v_main_~x~0_1095 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1095} OutVars{main_~x~0=v_main_~x~0_1095} AuxVars[] AssignedVars[] [2021-05-03 00:08:21,378 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:21,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:21,401 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:21,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:21,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:21,513 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:21,539 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:21,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:23,857 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:23,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633077102] [2021-05-03 00:08:23,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [633077102] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:23,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:23,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:08:23,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133259485] [2021-05-03 00:08:23,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:08:23,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:08:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:08:23,858 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:27,707 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-03 00:08:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:08:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-03 00:08:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:27,708 INFO L225 Difference]: With dead ends: 114 [2021-05-03 00:08:27,708 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:08:27,712 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 6 SyntacticMatches, 48 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 4116.5ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:08:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:08:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-03 00:08:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-03 00:08:27,721 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-03 00:08:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:27,721 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-03 00:08:27,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-03 00:08:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-03 00:08:27,722 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:27,722 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:27,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:08:27,722 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 469949078, now seen corresponding path program 41 times [2021-05-03 00:08:27,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:27,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014180231] [2021-05-03 00:08:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:27,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1144 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1144} OutVars{main_~x~0=v_main_~x~0_1144} AuxVars[] AssignedVars[] [2021-05-03 00:08:27,737 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:27,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:27,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:27,778 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:27,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:27,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1146 4294967296) 10000000) (< (mod (+ v_main_~x~0_1146 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1146} OutVars{main_~x~0=v_main_~x~0_1146} AuxVars[] AssignedVars[] [2021-05-03 00:08:27,804 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:27,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:27,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:27,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:27,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:27,919 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:27,938 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:27,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:27,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:08:30,364 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:30,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014180231] [2021-05-03 00:08:30,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014180231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:30,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:30,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:08:30,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198834988] [2021-05-03 00:08:30,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:08:30,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:30,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:08:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:08:30,365 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:34,362 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-03 00:08:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:08:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2021-05-03 00:08:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:34,363 INFO L225 Difference]: With dead ends: 116 [2021-05-03 00:08:34,363 INFO L226 Difference]: Without dead ends: 109 [2021-05-03 00:08:34,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 4285.3ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:08:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-03 00:08:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-03 00:08:34,375 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:08:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-03 00:08:34,376 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-03 00:08:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:34,376 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-03 00:08:34,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-03 00:08:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:08:34,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:34,377 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:34,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-03 00:08:34,377 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1695277363, now seen corresponding path program 42 times [2021-05-03 00:08:34,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:34,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414856895] [2021-05-03 00:08:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:34,383 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1196 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1196} OutVars{main_~x~0=v_main_~x~0_1196} AuxVars[] AssignedVars[] [2021-05-03 00:08:34,384 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:34,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:34,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:34,426 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:34,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:34,446 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1198 1) 4294967296) 100000000) (< (mod v_main_~x~0_1198 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1198} OutVars{main_~x~0=v_main_~x~0_1198} AuxVars[] AssignedVars[] [2021-05-03 00:08:34,447 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:34,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:34,450 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:36,819 WARN L205 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:08:36,843 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:36,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:36,878 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:36,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:37,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:39,413 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:39,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414856895] [2021-05-03 00:08:39,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [414856895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:39,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:39,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:08:39,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471460906] [2021-05-03 00:08:39,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:08:39,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:08:39,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3003, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:08:39,415 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 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:08:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:42,936 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-03 00:08:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:08:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 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:08:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:42,937 INFO L225 Difference]: With dead ends: 118 [2021-05-03 00:08:42,937 INFO L226 Difference]: Without dead ends: 111 [2021-05-03 00:08:42,938 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 4 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2670 ImplicationChecksByTransitivity, 4196.3ms TimeCoverageRelationStatistics Valid=459, Invalid=10671, Unknown=0, NotChecked=0, Total=11130 [2021-05-03 00:08:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-03 00:08:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-03 00:08:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-03 00:08:42,949 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-03 00:08:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:42,950 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-03 00:08:42,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 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:08:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-03 00:08:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-03 00:08:42,950 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:42,950 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:42,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:08:42,951 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1880247152, now seen corresponding path program 43 times [2021-05-03 00:08:42,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:42,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826037372] [2021-05-03 00:08:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:42,957 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1249 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1249} OutVars{main_~x~0=v_main_~x~0_1249} AuxVars[] AssignedVars[] [2021-05-03 00:08:42,958 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:42,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:42,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:42,991 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:43,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:43,013 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1251 4294967296) 10000000) (< (mod (+ v_main_~x~0_1251 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1251} OutVars{main_~x~0=v_main_~x~0_1251} AuxVars[] AssignedVars[] [2021-05-03 00:08:43,014 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:43,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:43,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:43,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:43,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:43,159 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:43,178 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:43,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:45,748 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:45,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826037372] [2021-05-03 00:08:45,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [826037372] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:45,748 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:45,748 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:08:45,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247008771] [2021-05-03 00:08:45,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:08:45,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:45,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:08:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:08:45,749 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:50,227 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-03 00:08:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:08:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2021-05-03 00:08:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:50,228 INFO L225 Difference]: With dead ends: 120 [2021-05-03 00:08:50,228 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:08:50,229 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 4669.7ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:08:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:08:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-03 00:08:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-03 00:08:50,241 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-03 00:08:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:50,241 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-03 00:08:50,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-03 00:08:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-03 00:08:50,242 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:50,242 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:50,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:08:50,242 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1985469267, now seen corresponding path program 44 times [2021-05-03 00:08:50,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:50,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570286641] [2021-05-03 00:08:50,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:50,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1303 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1303} OutVars{main_~x~0=v_main_~x~0_1303} AuxVars[] AssignedVars[] [2021-05-03 00:08:50,257 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:50,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:50,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:50,311 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:50,339 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:50,340 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1305 1) 4294967296) 100000000) (< (mod v_main_~x~0_1305 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1305} OutVars{main_~x~0=v_main_~x~0_1305} AuxVars[] AssignedVars[] [2021-05-03 00:08:50,342 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:50,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:50,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:50,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:50,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:50,489 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:50,517 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:50,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:53,236 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:53,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570286641] [2021-05-03 00:08:53,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1570286641] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:53,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:53,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:08:53,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900196741] [2021-05-03 00:08:53,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:08:53,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:08:53,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:08:53,238 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:57,712 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-03 00:08:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:08:57,713 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-05-03 00:08:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:57,713 INFO L225 Difference]: With dead ends: 122 [2021-05-03 00:08:57,713 INFO L226 Difference]: Without dead ends: 115 [2021-05-03 00:08:57,714 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 4809.6ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:08:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-03 00:08:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-03 00:08:57,723 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:08:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-03 00:08:57,724 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-03 00:08:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:57,724 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-03 00:08:57,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-03 00:08:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:08:57,725 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:57,725 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:57,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-03 00:08:57,725 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash -24706678, now seen corresponding path program 45 times [2021-05-03 00:08:57,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:57,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351881067] [2021-05-03 00:08:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:57,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1358 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1358} OutVars{main_~x~0=v_main_~x~0_1358} AuxVars[] AssignedVars[] [2021-05-03 00:08:57,731 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:08:57,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:57,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:08:57,767 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:08:57,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:57,795 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1360 1) 4294967296) 100000000) (< (mod v_main_~x~0_1360 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1360} OutVars{main_~x~0=v_main_~x~0_1360} AuxVars[] AssignedVars[] [2021-05-03 00:08:57,797 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:08:57,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:57,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:57,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:08:57,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:08:57,929 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:08:57,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:57,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:57,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:09:00,691 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:00,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351881067] [2021-05-03 00:09:00,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1351881067] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:00,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:00,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:09:00,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726014458] [2021-05-03 00:09:00,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:09:00,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:09:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:09:00,692 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:05,341 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-03 00:09:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:09:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-03 00:09:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:05,342 INFO L225 Difference]: With dead ends: 124 [2021-05-03 00:09:05,343 INFO L226 Difference]: Without dead ends: 117 [2021-05-03 00:09:05,343 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 7 SyntacticMatches, 52 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 4917.2ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:09:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-03 00:09:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-03 00:09:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-03 00:09:05,356 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-03 00:09:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-03 00:09:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-03 00:09:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-03 00:09:05,357 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:05,357 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:05,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-03 00:09:05,357 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1222501593, now seen corresponding path program 46 times [2021-05-03 00:09:05,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:05,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140651992] [2021-05-03 00:09:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:05,364 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1414 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1414} OutVars{main_~x~0=v_main_~x~0_1414} AuxVars[] AssignedVars[] [2021-05-03 00:09:05,365 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:05,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:05,393 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:05,412 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:05,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:05,450 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1416 1) 4294967296) 100000000) (< (mod v_main_~x~0_1416 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1416} OutVars{main_~x~0=v_main_~x~0_1416} AuxVars[] AssignedVars[] [2021-05-03 00:09:05,452 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:05,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:05,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:05,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:05,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:05,579 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:05,601 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:05,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:08,664 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:08,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140651992] [2021-05-03 00:09:08,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2140651992] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:08,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:08,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-03 00:09:08,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899833139] [2021-05-03 00:09:08,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-03 00:09:08,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-03 00:09:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:09:08,666 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:13,572 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-03 00:09:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:09:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2021-05-03 00:09:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:13,573 INFO L225 Difference]: With dead ends: 126 [2021-05-03 00:09:13,573 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:09:13,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 7 SyntacticMatches, 53 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 5307.2ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-03 00:09:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:09:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-03 00:09:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-03 00:09:13,583 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-03 00:09:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:13,583 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-03 00:09:13,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-03 00:09:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-03 00:09:13,584 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:13,584 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:13,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-03 00:09:13,584 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1252179580, now seen corresponding path program 47 times [2021-05-03 00:09:13,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:13,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068099823] [2021-05-03 00:09:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:13,589 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1471 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1471} OutVars{main_~x~0=v_main_~x~0_1471} AuxVars[] AssignedVars[] [2021-05-03 00:09:13,590 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:13,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:13,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:13,622 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:13,643 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:13,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1473 1) 4294967296) 100000000) (< (mod v_main_~x~0_1473 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1473} OutVars{main_~x~0=v_main_~x~0_1473} AuxVars[] AssignedVars[] [2021-05-03 00:09:13,656 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:13,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:13,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:13,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:13,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:13,780 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:13,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:13,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:16,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:16,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068099823] [2021-05-03 00:09:16,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068099823] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:16,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:16,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:09:16,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451330084] [2021-05-03 00:09:16,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:09:16,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:09:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:09:16,900 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:21,987 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-03 00:09:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:09:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-03 00:09:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:21,988 INFO L225 Difference]: With dead ends: 128 [2021-05-03 00:09:21,988 INFO L226 Difference]: Without dead ends: 121 [2021-05-03 00:09:21,989 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 7 SyntacticMatches, 54 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 5442.9ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:09:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-03 00:09:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-03 00:09:21,999 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:09:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-03 00:09:22,000 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-03 00:09:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:22,000 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-03 00:09:22,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-03 00:09:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-03 00:09:22,000 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:22,001 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:22,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-03 00:09:22,001 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:22,001 INFO L82 PathProgramCache]: Analyzing trace with hash 292045985, now seen corresponding path program 48 times [2021-05-03 00:09:22,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:22,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283788637] [2021-05-03 00:09:22,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:22,006 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1529 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1529} OutVars{main_~x~0=v_main_~x~0_1529} AuxVars[] AssignedVars[] [2021-05-03 00:09:22,007 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:22,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:22,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:22,056 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:22,083 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:22,085 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1531 1) 4294967296) 100000000) (< (mod v_main_~x~0_1531 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1531} OutVars{main_~x~0=v_main_~x~0_1531} AuxVars[] AssignedVars[] [2021-05-03 00:09:22,086 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:22,104 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:22,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:22,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:22,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:22,273 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:22,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:22,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:25,478 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:25,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283788637] [2021-05-03 00:09:25,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [283788637] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:25,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:25,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:09:25,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490187666] [2021-05-03 00:09:25,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:09:25,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:09:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:09:25,479 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:30,700 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-03 00:09:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:09:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-03 00:09:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:30,701 INFO L225 Difference]: With dead ends: 130 [2021-05-03 00:09:30,702 INFO L226 Difference]: Without dead ends: 123 [2021-05-03 00:09:30,702 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 6 SyntacticMatches, 56 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 5577.2ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:09:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-03 00:09:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-03 00:09:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-03 00:09:30,711 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-03 00:09:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:30,711 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-03 00:09:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-03 00:09:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-03 00:09:30,712 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:30,712 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:30,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-03 00:09:30,712 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1765870466, now seen corresponding path program 49 times [2021-05-03 00:09:30,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:30,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772657798] [2021-05-03 00:09:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:30,733 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1588 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1588} OutVars{main_~x~0=v_main_~x~0_1588} AuxVars[] AssignedVars[] [2021-05-03 00:09:30,734 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:30,735 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:30,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:30,779 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:30,805 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:30,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1590 1) 4294967296) 100000000) (< (mod v_main_~x~0_1590 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-03 00:09:30,808 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:30,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:30,825 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:30,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:30,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:30,957 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:30,984 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:34,382 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:34,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772657798] [2021-05-03 00:09:34,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [772657798] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:34,382 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:34,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:09:34,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673306826] [2021-05-03 00:09:34,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:09:34,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:09:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:09:34,383 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:39,887 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-03 00:09:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:09:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-03 00:09:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:39,888 INFO L225 Difference]: With dead ends: 132 [2021-05-03 00:09:39,888 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:09:39,889 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 6 SyntacticMatches, 57 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 5913.1ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:09:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:09:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-03 00:09:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-03 00:09:39,899 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-03 00:09:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:39,899 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-03 00:09:39,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-03 00:09:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-03 00:09:39,900 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:39,900 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:39,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-03 00:09:39,900 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash 556343579, now seen corresponding path program 50 times [2021-05-03 00:09:39,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:39,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872455347] [2021-05-03 00:09:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:39,906 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1648 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1648} OutVars{main_~x~0=v_main_~x~0_1648} AuxVars[] AssignedVars[] [2021-05-03 00:09:39,908 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:39,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:39,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:39,953 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:39,977 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:39,979 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1650 1) 4294967296) 100000000) (< (mod v_main_~x~0_1650 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1650} OutVars{main_~x~0=v_main_~x~0_1650} AuxVars[] AssignedVars[] [2021-05-03 00:09:39,980 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:39,998 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:39,999 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,289 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:09:42,351 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:42,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:42,385 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:42,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:42,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:45,833 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:45,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872455347] [2021-05-03 00:09:45,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872455347] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:45,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:45,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:09:45,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746443684] [2021-05-03 00:09:45,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:09:45,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:09:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:09:45,835 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:51,499 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-03 00:09:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:09:51,500 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-03 00:09:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:51,501 INFO L225 Difference]: With dead ends: 134 [2021-05-03 00:09:51,501 INFO L226 Difference]: Without dead ends: 127 [2021-05-03 00:09:51,502 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 6 SyntacticMatches, 58 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 6027.4ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:09:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-03 00:09:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-03 00:09:51,529 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:09:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-03 00:09:51,529 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-03 00:09:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:51,529 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-03 00:09:51,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-03 00:09:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:09:51,530 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:51,530 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:51,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-03 00:09:51,530 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1178953096, now seen corresponding path program 51 times [2021-05-03 00:09:51,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:51,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763397728] [2021-05-03 00:09:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:51,537 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1709 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1709} OutVars{main_~x~0=v_main_~x~0_1709} AuxVars[] AssignedVars[] [2021-05-03 00:09:51,538 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:09:51,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:51,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:09:51,586 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:09:51,616 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:51,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1711 1) 4294967296) 100000000) (< (mod v_main_~x~0_1711 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1711} OutVars{main_~x~0=v_main_~x~0_1711} AuxVars[] AssignedVars[] [2021-05-03 00:09:51,619 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:09:51,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:51,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:51,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:09:51,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:09:53,705 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-03 00:09:53,735 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:09:53,755 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:53,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:57,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:57,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763397728] [2021-05-03 00:09:57,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763397728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:57,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:57,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:09:57,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139266166] [2021-05-03 00:09:57,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:09:57,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:09:57,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:09:57,389 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:03,468 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-03 00:10:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:10:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-03 00:10:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:03,469 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:10:03,469 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:10:03,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 59 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 6380.4ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:10:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:10:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-03 00:10:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-03 00:10:03,481 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-03 00:10:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:03,482 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-03 00:10:03,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-03 00:10:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-03 00:10:03,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:03,482 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:03,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-03 00:10:03,482 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1943220373, now seen corresponding path program 52 times [2021-05-03 00:10:03,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:03,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817935149] [2021-05-03 00:10:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:03,488 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1771 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1771} OutVars{main_~x~0=v_main_~x~0_1771} AuxVars[] AssignedVars[] [2021-05-03 00:10:03,489 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:10:03,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:03,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:10:03,537 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:10:03,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:03,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1773 1) 4294967296) 100000000) (< (mod v_main_~x~0_1773 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1773} OutVars{main_~x~0=v_main_~x~0_1773} AuxVars[] AssignedVars[] [2021-05-03 00:10:03,578 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:10:03,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:03,584 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:05,663 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:10:05,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:10:05,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:10:05,740 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:10:05,762 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:05,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:09,533 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:09,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817935149] [2021-05-03 00:10:09,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1817935149] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:09,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:09,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:10:09,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364353022] [2021-05-03 00:10:09,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:10:09,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:10:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:10:09,534 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:15,949 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-03 00:10:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:10:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2021-05-03 00:10:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:15,951 INFO L225 Difference]: With dead ends: 138 [2021-05-03 00:10:15,951 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:10:15,952 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 7 SyntacticMatches, 59 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 6725.8ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:10:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:10:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:10:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-03 00:10:15,967 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-03 00:10:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:15,967 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-03 00:10:15,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-03 00:10:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-03 00:10:15,968 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:15,968 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:15,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-03 00:10:15,968 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash 169784178, now seen corresponding path program 53 times [2021-05-03 00:10:15,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:15,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [56905641] [2021-05-03 00:10:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:15,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1834 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1834} OutVars{main_~x~0=v_main_~x~0_1834} AuxVars[] AssignedVars[] [2021-05-03 00:10:15,976 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:10:15,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:15,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:10:16,032 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:10:16,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:16,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1836 1) 4294967296) 100000000) (< (mod v_main_~x~0_1836 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1836} OutVars{main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[] [2021-05-03 00:10:16,072 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:10:16,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:16,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:16,356 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:10:16,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:10:16,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:10:16,431 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:10:16,462 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:16,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:20,522 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:20,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [56905641] [2021-05-03 00:10:20,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [56905641] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:20,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:20,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:10:20,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042098569] [2021-05-03 00:10:20,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:10:20,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:10:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:10:20,524 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:27,214 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-03 00:10:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:10:27,214 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2021-05-03 00:10:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:27,215 INFO L225 Difference]: With dead ends: 140 [2021-05-03 00:10:27,215 INFO L226 Difference]: Without dead ends: 133 [2021-05-03 00:10:27,216 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 7 SyntacticMatches, 60 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 7077.9ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:10:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-03 00:10:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-03 00:10:27,230 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:10:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-03 00:10:27,231 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-03 00:10:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:27,231 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-03 00:10:27,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-03 00:10:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:10:27,232 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:27,232 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:27,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-03 00:10:27,232 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash 999617295, now seen corresponding path program 54 times [2021-05-03 00:10:27,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:27,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460323362] [2021-05-03 00:10:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:27,240 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1898 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1898} OutVars{main_~x~0=v_main_~x~0_1898} AuxVars[] AssignedVars[] [2021-05-03 00:10:27,247 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:10:27,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:27,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:10:27,378 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:10:27,402 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:27,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1900 1) 4294967296) 100000000) (< (mod v_main_~x~0_1900 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1900} OutVars{main_~x~0=v_main_~x~0_1900} AuxVars[] AssignedVars[] [2021-05-03 00:10:27,404 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:10:27,405 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:27,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:27,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:10:27,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:10:27,526 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:10:27,552 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:27,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:31,842 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:31,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460323362] [2021-05-03 00:10:31,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1460323362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:31,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:31,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:10:31,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840438183] [2021-05-03 00:10:31,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:10:31,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:10:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:10:31,844 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:38,756 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-03 00:10:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:10:38,756 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-03 00:10:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:38,757 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:10:38,757 INFO L226 Difference]: Without dead ends: 135 [2021-05-03 00:10:38,758 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 7 SyntacticMatches, 61 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 7405.0ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:10:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-03 00:10:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-03 00:10:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-03 00:10:38,769 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-03 00:10:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:38,770 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-03 00:10:38,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-03 00:10:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-03 00:10:38,770 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:38,770 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:38,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-03 00:10:38,770 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -394674324, now seen corresponding path program 55 times [2021-05-03 00:10:38,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:38,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891521200] [2021-05-03 00:10:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:38,777 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1963 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1963} OutVars{main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[] [2021-05-03 00:10:38,779 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:10:38,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:38,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:10:38,814 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:10:38,842 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:38,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1965 1) 4294967296) 100000000) (< (mod v_main_~x~0_1965 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1965} OutVars{main_~x~0=v_main_~x~0_1965} AuxVars[] AssignedVars[] [2021-05-03 00:10:38,845 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:10:38,858 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:38,860 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:39,961 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:10:40,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:10:40,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:10:40,109 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:10:40,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:40,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:44,457 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:44,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891521200] [2021-05-03 00:10:44,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1891521200] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:44,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:44,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:10:44,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163195167] [2021-05-03 00:10:44,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:10:44,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:10:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:10:44,459 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:51,748 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-03 00:10:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:10:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-03 00:10:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:51,749 INFO L225 Difference]: With dead ends: 144 [2021-05-03 00:10:51,749 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:10:51,750 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 7563.0ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:10:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:10:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-03 00:10:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-03 00:10:51,763 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-03 00:10:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:51,763 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-03 00:10:51,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-03 00:10:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-03 00:10:51,764 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:51,764 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:51,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:10:51,764 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -279123831, now seen corresponding path program 56 times [2021-05-03 00:10:51,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:51,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373553809] [2021-05-03 00:10:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:51,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2029 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2029} OutVars{main_~x~0=v_main_~x~0_2029} AuxVars[] AssignedVars[] [2021-05-03 00:10:51,775 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:10:51,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:51,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:10:51,826 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:10:51,849 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:51,860 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2031 1) 4294967296) 100000000) (< (mod v_main_~x~0_2031 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2031} OutVars{main_~x~0=v_main_~x~0_2031} AuxVars[] AssignedVars[] [2021-05-03 00:10:51,862 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:10:51,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:51,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:51,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:10:51,941 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:10:51,970 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:10:51,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:52,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:56,416 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:56,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373553809] [2021-05-03 00:10:56,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1373553809] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:56,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:56,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-03 00:10:56,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692517020] [2021-05-03 00:10:56,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-03 00:10:56,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:56,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-03 00:10:56,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:10:56,417 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:03,849 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-03 00:11:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:11:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-03 00:11:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:03,850 INFO L225 Difference]: With dead ends: 146 [2021-05-03 00:11:03,850 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:11:03,851 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 6 SyntacticMatches, 64 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 7743.5ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:11:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:11:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:11:03,861 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:11:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-03 00:11:03,861 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-03 00:11:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:03,861 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-03 00:11:03,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-03 00:11:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:11:03,862 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:03,862 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:03,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-03 00:11:03,862 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash -904249754, now seen corresponding path program 57 times [2021-05-03 00:11:03,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:03,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1695889208] [2021-05-03 00:11:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:03,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2096 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2096} OutVars{main_~x~0=v_main_~x~0_2096} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,869 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:11:03,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:11:03,912 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:11:03,934 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:03,935 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2098 1) 4294967296) 100000000) (< (mod v_main_~x~0_2098 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2098} OutVars{main_~x~0=v_main_~x~0_2098} AuxVars[] AssignedVars[] [2021-05-03 00:11:03,936 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:11:03,950 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:03,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:04,139 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:11:04,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:11:04,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:11:04,200 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:11:04,224 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:08,881 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:08,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1695889208] [2021-05-03 00:11:08,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1695889208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:08,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:08,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:11:08,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664085353] [2021-05-03 00:11:08,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:11:08,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:11:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:11:08,883 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:16,505 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-03 00:11:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:11:16,506 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-03 00:11:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:16,506 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:11:16,506 INFO L226 Difference]: Without dead ends: 141 [2021-05-03 00:11:16,507 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 6 SyntacticMatches, 65 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 8061.3ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:11:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-03 00:11:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-03 00:11:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-03 00:11:16,517 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-03 00:11:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:16,518 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-03 00:11:16,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-03 00:11:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-03 00:11:16,518 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:16,518 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:16,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-03 00:11:16,519 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -354840317, now seen corresponding path program 58 times [2021-05-03 00:11:16,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:16,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650526157] [2021-05-03 00:11:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:16,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2164 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2164} OutVars{main_~x~0=v_main_~x~0_2164} AuxVars[] AssignedVars[] [2021-05-03 00:11:16,532 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:11:16,533 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:16,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:11:16,573 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:11:16,596 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:16,597 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2166 4294967296) 10000000) (< (mod (+ v_main_~x~0_2166 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2166} OutVars{main_~x~0=v_main_~x~0_2166} AuxVars[] AssignedVars[] [2021-05-03 00:11:16,599 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:11:16,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:16,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:16,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:11:16,707 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:11:16,740 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:11:16,774 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:16,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:21,556 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:21,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650526157] [2021-05-03 00:11:21,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1650526157] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:21,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:21,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:11:21,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979542912] [2021-05-03 00:11:21,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:11:21,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:21,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:11:21,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:11:21,558 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:29,423 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-03 00:11:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:11:29,424 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2021-05-03 00:11:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:29,424 INFO L225 Difference]: With dead ends: 150 [2021-05-03 00:11:29,425 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:11:29,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 6 SyntacticMatches, 66 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 8294.7ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:11:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:11:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-03 00:11:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-03 00:11:29,441 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-03 00:11:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:29,441 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-03 00:11:29,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-03 00:11:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-03 00:11:29,442 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:29,442 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:29,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:11:29,442 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -653348768, now seen corresponding path program 59 times [2021-05-03 00:11:29,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:29,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902725448] [2021-05-03 00:11:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:29,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2233 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2233} OutVars{main_~x~0=v_main_~x~0_2233} AuxVars[] AssignedVars[] [2021-05-03 00:11:29,450 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:11:29,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:29,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:11:29,499 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:11:29,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:29,528 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2235 1) 4294967296) 100000000) (< (mod v_main_~x~0_2235 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2235} OutVars{main_~x~0=v_main_~x~0_2235} AuxVars[] AssignedVars[] [2021-05-03 00:11:29,529 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:11:29,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:29,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:29,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:11:29,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:11:29,643 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:11:29,668 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:29,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:34,580 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:34,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902725448] [2021-05-03 00:11:34,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [902725448] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:34,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:34,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:11:34,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831175968] [2021-05-03 00:11:34,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:11:34,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:11:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:11:34,582 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:43,003 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-03 00:11:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:11:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-03 00:11:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:43,005 INFO L225 Difference]: With dead ends: 152 [2021-05-03 00:11:43,005 INFO L226 Difference]: Without dead ends: 145 [2021-05-03 00:11:43,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 67 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 8652.5ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:11:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-03 00:11:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-03 00:11:43,016 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:11:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-03 00:11:43,017 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-03 00:11:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:43,017 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-03 00:11:43,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-03 00:11:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:11:43,017 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:43,018 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:43,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-03 00:11:43,018 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 242838653, now seen corresponding path program 60 times [2021-05-03 00:11:43,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:43,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129438318] [2021-05-03 00:11:43,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:43,023 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2303 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2303} OutVars{main_~x~0=v_main_~x~0_2303} AuxVars[] AssignedVars[] [2021-05-03 00:11:43,024 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:11:43,033 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:43,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:11:43,066 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:11:43,089 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:43,090 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2305 4294967296) 10000000) (< (mod (+ v_main_~x~0_2305 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2305} OutVars{main_~x~0=v_main_~x~0_2305} AuxVars[] AssignedVars[] [2021-05-03 00:11:43,091 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:11:43,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:43,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:43,145 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:11:43,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:11:43,190 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:11:43,213 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:43,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:48,292 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:48,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129438318] [2021-05-03 00:11:48,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [129438318] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:48,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:48,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-03 00:11:48,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926790697] [2021-05-03 00:11:48,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-03 00:11:48,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:48,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-03 00:11:48,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:11:48,293 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:56,893 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-03 00:11:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-03 00:11:56,894 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-03 00:11:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:56,895 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:11:56,895 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:11:56,896 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 7 SyntacticMatches, 67 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 8860.1ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:11:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:11:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-03 00:11:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-03 00:11:56,906 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-03 00:11:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:56,906 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-03 00:11:56,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-03 00:11:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-03 00:11:56,907 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:56,907 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:56,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-03 00:11:56,908 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1809476262, now seen corresponding path program 61 times [2021-05-03 00:11:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:56,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775748890] [2021-05-03 00:11:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:56,918 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2374 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2374} OutVars{main_~x~0=v_main_~x~0_2374} AuxVars[] AssignedVars[] [2021-05-03 00:11:56,919 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:11:56,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:56,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:11:56,995 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:11:57,037 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:57,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2376 1) 4294967296) 100000000) (< (mod v_main_~x~0_2376 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2376} OutVars{main_~x~0=v_main_~x~0_2376} AuxVars[] AssignedVars[] [2021-05-03 00:11:57,040 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:11:57,056 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,204 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:11:57,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:11:57,250 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:11:57,542 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-03 00:11:57,544 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:57,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:02,844 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775748890] [2021-05-03 00:12:02,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [775748890] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:12:02,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959712381] [2021-05-03 00:12:02,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:12:02,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:12:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:12:02,846 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:11,822 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2021-05-03 00:12:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:12:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2021-05-03 00:12:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:11,823 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:12:11,823 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:12:11,824 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 7 SyntacticMatches, 68 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 9215.4ms TimeCoverageRelationStatistics Valid=553, Invalid=19187, Unknown=0, NotChecked=0, Total=19740 [2021-05-03 00:12:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:12:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:12:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2021-05-03 00:12:11,835 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 145 [2021-05-03 00:12:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:11,835 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2021-05-03 00:12:11,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2021-05-03 00:12:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-03 00:12:11,836 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:11,836 INFO L523 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:11,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-03 00:12:11,836 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1600846583, now seen corresponding path program 62 times [2021-05-03 00:12:11,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:11,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510980121] [2021-05-03 00:12:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:11,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2446 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2446} OutVars{main_~x~0=v_main_~x~0_2446} AuxVars[] AssignedVars[] [2021-05-03 00:12:11,845 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:12:11,855 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:12:11,898 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:12:11,927 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:11,929 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2448 1) 4294967296) 100000000) (< (mod v_main_~x~0_2448 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2448} OutVars{main_~x~0=v_main_~x~0_2448} AuxVars[] AssignedVars[] [2021-05-03 00:12:11,930 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:12:11,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,933 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:12:11,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:12:12,014 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:12:12,037 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:12,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:17,603 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:17,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510980121] [2021-05-03 00:12:17,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1510980121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:17,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:17,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-03 00:12:17,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805468053] [2021-05-03 00:12:17,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-03 00:12:17,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-03 00:12:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:12:17,605 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:26,814 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2021-05-03 00:12:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-03 00:12:26,815 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2021-05-03 00:12:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:26,816 INFO L225 Difference]: With dead ends: 158 [2021-05-03 00:12:26,816 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:12:26,817 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 6 SyntacticMatches, 70 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 9621.2ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:12:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:12:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-03 00:12:26,829 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:12:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-03 00:12:26,829 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 147 [2021-05-03 00:12:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:26,830 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-03 00:12:26,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-03 00:12:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:12:26,831 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:26,831 INFO L523 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:26,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-05-03 00:12:26,831 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1861053780, now seen corresponding path program 63 times [2021-05-03 00:12:26,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:26,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158280010] [2021-05-03 00:12:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:26,838 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2519 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2519} OutVars{main_~x~0=v_main_~x~0_2519} AuxVars[] AssignedVars[] [2021-05-03 00:12:26,839 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:12:26,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:26,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:12:26,880 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:12:26,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:26,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2521 1) 4294967296) 100000000) (< (mod v_main_~x~0_2521 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2521} OutVars{main_~x~0=v_main_~x~0_2521} AuxVars[] AssignedVars[] [2021-05-03 00:12:26,911 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:12:26,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:26,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:29,125 WARN L205 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:12:29,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:12:29,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:12:29,190 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:12:29,242 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:29,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:35,071 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:35,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158280010] [2021-05-03 00:12:35,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1158280010] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:35,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:35,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:12:35,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450600960] [2021-05-03 00:12:35,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:12:35,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:12:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:12:35,072 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:44,909 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-03 00:12:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:12:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-03 00:12:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:44,910 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:12:44,910 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:12:44,912 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 6 SyntacticMatches, 71 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 10142.3ms TimeCoverageRelationStatistics Valid=569, Invalid=20311, Unknown=0, NotChecked=0, Total=20880 [2021-05-03 00:12:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:12:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-03 00:12:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call 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:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2021-05-03 00:12:44,928 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 149 [2021-05-03 00:12:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:44,929 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2021-05-03 00:12:44,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2021-05-03 00:12:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-03 00:12:44,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:44,930 INFO L523 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:44,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:12:44,930 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1482900367, now seen corresponding path program 64 times [2021-05-03 00:12:44,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:44,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [34696892] [2021-05-03 00:12:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:44,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2593 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2593} OutVars{main_~x~0=v_main_~x~0_2593} AuxVars[] AssignedVars[] [2021-05-03 00:12:44,938 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:12:44,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:44,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:12:45,019 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:12:45,045 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:45,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2595 4294967296) 10000000) (< (mod (+ v_main_~x~0_2595 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2595} OutVars{main_~x~0=v_main_~x~0_2595} AuxVars[] AssignedVars[] [2021-05-03 00:12:45,048 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:12:45,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:12:45,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:12:45,262 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:12:45,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:45,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:45,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:12:51,275 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:51,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [34696892] [2021-05-03 00:12:51,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [34696892] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:51,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:51,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:12:51,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013324442] [2021-05-03 00:12:51,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:12:51,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:12:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5896, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:12:51,277 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 77 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 75 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:00,155 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-05-03 00:13:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-03 00:13:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 75 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2021-05-03 00:13:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:00,157 INFO L225 Difference]: With dead ends: 162 [2021-05-03 00:13:00,157 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:13:00,158 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 4 SyntacticMatches, 70 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5431 ImplicationChecksByTransitivity, 9860.4ms TimeCoverageRelationStatistics Valid=657, Invalid=21693, Unknown=0, NotChecked=0, Total=22350 [2021-05-03 00:13:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:13:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-03 00:13:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2021-05-03 00:13:00,174 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 151 [2021-05-03 00:13:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:00,174 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2021-05-03 00:13:00,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 75 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2021-05-03 00:13:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-03 00:13:00,175 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:00,175 INFO L523 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:00,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-03 00:13:00,176 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1907669070, now seen corresponding path program 65 times [2021-05-03 00:13:00,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:00,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242391013] [2021-05-03 00:13:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:00,183 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2668 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2668} OutVars{main_~x~0=v_main_~x~0_2668} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,185 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:13:00,197 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:13:00,249 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:13:00,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,274 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2670 1) 4294967296) 100000000) (< (mod v_main_~x~0_2670 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2670} OutVars{main_~x~0=v_main_~x~0_2670} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,276 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:13:00,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,279 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,484 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:13:00,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:13:00,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:13:00,586 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:13:00,611 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,722 INFO 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:06,835 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:06,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242391013] [2021-05-03 00:13:06,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1242391013] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:06,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:06,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:13:06,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508863795] [2021-05-03 00:13:06,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:13:06,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:13:06,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=6051, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:13:06,837 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 78 states, 77 states have (on average 1.9350649350649352) internal successors, (149), 76 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:15,946 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2021-05-03 00:13:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:13:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.9350649350649352) internal successors, (149), 76 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-03 00:13:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:15,948 INFO L225 Difference]: With dead ends: 169 [2021-05-03 00:13:15,948 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:13:15,950 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 4 SyntacticMatches, 71 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5944 ImplicationChecksByTransitivity, 10384.8ms TimeCoverageRelationStatistics Valid=716, Invalid=23154, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:13:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:13:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2021-05-03 00:13:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0130718954248366) internal successors, (155), 153 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2021-05-03 00:13:15,963 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 153 [2021-05-03 00:13:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:15,963 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2021-05-03 00:13:15,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 77 states have (on average 1.9350649350649352) internal successors, (149), 76 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2021-05-03 00:13:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-05-03 00:13:15,964 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:15,964 INFO L523 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:15,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-03 00:13:15,964 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:15,965 INFO L82 PathProgramCache]: Analyzing trace with hash -645269944, now seen corresponding path program 66 times [2021-05-03 00:13:15,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:15,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1968212833] [2021-05-03 00:13:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:15,972 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2744 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2744} OutVars{main_~x~0=v_main_~x~0_2744} AuxVars[] AssignedVars[] [2021-05-03 00:13:15,974 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:13:15,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:13:16,033 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:13:16,060 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:16,065 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2746 4294967296) 10000000) (< (mod (+ v_main_~x~0_2746 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2746} OutVars{main_~x~0=v_main_~x~0_2746} AuxVars[] AssignedVars[] [2021-05-03 00:13:16,067 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:13:16,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,303 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:16,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:13:16,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:13:16,386 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:13:16,418 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:16,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:23,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:23,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1968212833] [2021-05-03 00:13:23,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1968212833] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:23,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:23,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:13:23,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083641646] [2021-05-03 00:13:23,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:13:23,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:13:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=6366, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:13:23,030 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 78 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:32,535 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2021-05-03 00:13:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:13:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 78 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2021-05-03 00:13:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:32,536 INFO L225 Difference]: With dead ends: 173 [2021-05-03 00:13:32,537 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:13:32,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 4 SyntacticMatches, 73 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 10918.8ms TimeCoverageRelationStatistics Valid=735, Invalid=24387, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:13:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:13:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2021-05-03 00:13:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2021-05-03 00:13:32,556 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 157 [2021-05-03 00:13:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:32,556 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2021-05-03 00:13:32,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 78 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2021-05-03 00:13:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:13:32,557 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:32,557 INFO L523 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:32,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-03 00:13:32,557 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1204050110, now seen corresponding path program 67 times [2021-05-03 00:13:32,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:32,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808894567] [2021-05-03 00:13:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:32,566 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2822 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2822} OutVars{main_~x~0=v_main_~x~0_2822} AuxVars[] AssignedVars[] [2021-05-03 00:13:32,568 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:13:32,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:32,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:13:32,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:13:32,664 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:32,665 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2824 4294967296) 10000000) (< (mod (+ v_main_~x~0_2824 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2824} OutVars{main_~x~0=v_main_~x~0_2824} AuxVars[] AssignedVars[] [2021-05-03 00:13:32,667 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:13:32,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:32,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:32,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:13:32,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:13:32,816 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:13:32,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:32,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:40,064 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:40,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808894567] [2021-05-03 00:13:40,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1808894567] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:40,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:40,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:13:40,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121031928] [2021-05-03 00:13:40,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:13:40,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:13:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:13:40,065 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:52,570 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2021-05-03 00:13:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:13:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2021-05-03 00:13:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:52,572 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:13:52,572 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:13:52,573 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 7 SyntacticMatches, 76 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 12526.4ms TimeCoverageRelationStatistics Valid=617, Invalid=23875, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:13:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:13:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:13:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.0125) internal successors, (162), 160 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2021-05-03 00:13:52,585 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 161 [2021-05-03 00:13:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:52,585 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2021-05-03 00:13:52,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2021-05-03 00:13:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:13:52,586 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:52,586 INFO L523 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:52,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-05-03 00:13:52,586 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash -700173601, now seen corresponding path program 68 times [2021-05-03 00:13:52,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:52,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816298896] [2021-05-03 00:13:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:52,592 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2902 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2902} OutVars{main_~x~0=v_main_~x~0_2902} AuxVars[] AssignedVars[] [2021-05-03 00:13:52,593 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:13:52,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:52,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:13:52,639 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:13:52,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:52,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2904 1) 4294967296) 100000000) (< (mod v_main_~x~0_2904 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2904} OutVars{main_~x~0=v_main_~x~0_2904} AuxVars[] AssignedVars[] [2021-05-03 00:13:52,670 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:13:52,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:52,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:52,861 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:13:52,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:13:52,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:13:53,020 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:13:53,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:53,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:00,621 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:00,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816298896] [2021-05-03 00:14:00,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1816298896] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:00,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:00,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:14:00,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401247279] [2021-05-03 00:14:00,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:14:00,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:00,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:14:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:14:00,623 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:13,450 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2021-05-03 00:14:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:14:13,451 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-03 00:14:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:13,452 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:14:13,452 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:14:13,454 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 7 SyntacticMatches, 77 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3229 ImplicationChecksByTransitivity, 12981.1ms TimeCoverageRelationStatistics Valid=625, Invalid=24497, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:14:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:14:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:14:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 162 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2021-05-03 00:14:13,467 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 163 [2021-05-03 00:14:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:13,467 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2021-05-03 00:14:13,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2021-05-03 00:14:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-05-03 00:14:13,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:13,468 INFO L523 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:13,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-05-03 00:14:13,468 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1806152900, now seen corresponding path program 69 times [2021-05-03 00:14:13,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:13,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251525374] [2021-05-03 00:14:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:13,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2983 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2983} OutVars{main_~x~0=v_main_~x~0_2983} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,479 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:14:13,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:14:13,532 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:14:13,569 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:13,570 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2985 4294967296) 10000000) (< (mod (+ v_main_~x~0_2985 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2985} OutVars{main_~x~0=v_main_~x~0_2985} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,572 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:14:13,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:17,720 WARN L205 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:14:21,791 WARN L205 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:14:25,818 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:14:25,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:14:26,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:14:26,081 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:14:26,139 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:26,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:26,256 INFO 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,260 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:45,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251525374] [2021-05-03 00:14:45,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [251525374] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:45,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:45,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:14:45,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116472055] [2021-05-03 00:14:45,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:14:45,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:45,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:14:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:14:45,262 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:22,959 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2021-05-03 00:15:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:15:22,961 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2021-05-03 00:15:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:22,961 INFO L225 Difference]: With dead ends: 176 [2021-05-03 00:15:22,961 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:15:22,963 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 7 SyntacticMatches, 78 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3310 ImplicationChecksByTransitivity, 33378.1ms TimeCoverageRelationStatistics Valid=633, Invalid=25127, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:15:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:15:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:15:22,978 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:15:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:15:22,979 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 165 [2021-05-03 00:15:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:22,979 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:15:22,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:15:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:15:22,980 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:22,980 INFO L523 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:22,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-05-03 00:15:22,980 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 499630169, now seen corresponding path program 70 times [2021-05-03 00:15:22,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:22,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169377973] [2021-05-03 00:15:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:22,993 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3065 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3065} OutVars{main_~x~0=v_main_~x~0_3065} AuxVars[] AssignedVars[] [2021-05-03 00:15:22,996 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:23,026 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:23,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:23,119 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:23,202 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:23,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_3067 4294967296) 10000000) (< (mod (+ v_main_~x~0_3067 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3067} AuxVars[] AssignedVars[] [2021-05-03 00:15:23,207 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:15:23,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:23,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:23,843 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:15:23,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:15:23,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:15:24,044 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:15:24,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:24,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:24,288 INFO 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:49,490 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:49,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169377973] [2021-05-03 00:15:49,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1169377973] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:49,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:49,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:15:49,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561923467] [2021-05-03 00:15:49,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:15:49,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:15:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:15:49,492 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:50,228 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-03 00:16:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:35,579 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:16:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:16:35,582 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2021-05-03 00:16:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:35,583 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:16:35,583 INFO L226 Difference]: Without dead ends: 171 [2021-05-03 00:16:35,584 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 7 SyntacticMatches, 79 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3392 ImplicationChecksByTransitivity, 42484.6ms TimeCoverageRelationStatistics Valid=641, Invalid=25765, Unknown=0, NotChecked=0, Total=26406 [2021-05-03 00:16:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-03 00:16:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-03 00:16:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0120481927710843) internal successors, (168), 166 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call 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:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2021-05-03 00:16:35,627 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 167 [2021-05-03 00:16:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:35,627 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2021-05-03 00:16:35,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2021-05-03 00:16:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:16:35,628 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:35,628 INFO L523 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:35,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-03 00:16:35,628 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 154034742, now seen corresponding path program 71 times [2021-05-03 00:16:35,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:35,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710169693] [2021-05-03 00:16:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:35,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3148 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3148} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,663 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:16:35,722 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:16:35,929 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:16:36,048 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-03 00:16:36,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:36,054 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3150 1) 4294967296) 100000000) (< (mod v_main_~x~0_3150 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3150} OutVars{main_~x~0=v_main_~x~0_3150} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,057 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:16:36,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,339 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:16:36,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:16:36,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:16:36,480 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:16:36,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:36,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:36,754 INFO 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:03,048 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:03,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710169693] [2021-05-03 00:17:03,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1710169693] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:03,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:03,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2021-05-03 00:17:03,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23793530] [2021-05-03 00:17:03,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2021-05-03 00:17:03,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:03,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-05-03 00:17:03,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:17:03,050 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:03,847 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-03 00:17:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:56,009 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2021-05-03 00:17:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-03 00:17:56,013 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2021-05-03 00:17:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:56,014 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:17:56,014 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:17:56,016 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 6 SyntacticMatches, 81 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 46091.4ms TimeCoverageRelationStatistics Valid=649, Invalid=26411, Unknown=0, NotChecked=0, Total=27060 [2021-05-03 00:17:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:17:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-03 00:17:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0119047619047619) internal successors, (170), 168 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call 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:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2021-05-03 00:17:56,029 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 169 [2021-05-03 00:17:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:56,030 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2021-05-03 00:17:56,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2021-05-03 00:17:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-05-03 00:17:56,031 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:56,031 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:56,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-05-03 00:17:56,031 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1250688813, now seen corresponding path program 72 times [2021-05-03 00:17:56,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:56,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82715313] [2021-05-03 00:17:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:56,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3232 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3232} OutVars{main_~x~0=v_main_~x~0_3232} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:17:56,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:17:56,213 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:17:56,313 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:56,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3234 1) 4294967296) 100000000) (< (mod v_main_~x~0_3234 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3234} OutVars{main_~x~0=v_main_~x~0_3234} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,320 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:17:56,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,480 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:17:56,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:17:56,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:17:56,767 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:17:56,873 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-03 00:17:56,877 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,118 INFO 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:31,438 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:31,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82715313] [2021-05-03 00:18:31,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [82715313] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:31,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:31,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:18:31,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465411270] [2021-05-03 00:18:31,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:18:31,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:18:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:18:31,439 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:32,305 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 47