/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/loop-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:16:41,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:16:41,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:16:41,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:16:41,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:16:41,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:16:41,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:16:41,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:16:41,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:16:41,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:16:41,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:16:41,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:16:41,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:16:41,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:16:41,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:16:41,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:16:41,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:16:41,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:16:41,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:16:41,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:16:41,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:16:41,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:16:41,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:16:41,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:16:41,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:16:41,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:16:41,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:16:41,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:16:41,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:16:41,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:16:41,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:16:41,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:16:41,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:16:41,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:16:41,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:16:41,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:16:41,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:16:41,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:16:41,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:16:41,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:16:41,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:16:41,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:16:41,759 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:16:41,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:16:41,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:16:41,760 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:16:41,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:16:41,761 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:16:41,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:16:41,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:16:41,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:16:41,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:16:41,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:16:41,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:16:41,763 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:16:41,763 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:16:41,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:16:42,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:16:42,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:16:42,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:16:42,020 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:16:42,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2021-05-02 23:16:42,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8acfe5f/fa10b806b02b4aef86fc8f1e476cb518/FLAGe4961c1bd [2021-05-02 23:16:42,374 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:16:42,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2021-05-02 23:16:42,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8acfe5f/fa10b806b02b4aef86fc8f1e476cb518/FLAGe4961c1bd [2021-05-02 23:16:42,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8acfe5f/fa10b806b02b4aef86fc8f1e476cb518 [2021-05-02 23:16:42,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:16:42,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:16:42,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:16:42,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:16:42,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:16:42,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:42,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275f0184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42, skipping insertion in model container [2021-05-02 23:16:42,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:42,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:16:42,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:16:42,930 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2021-05-02 23:16:42,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:16:42,948 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:16:42,955 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2021-05-02 23:16:42,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:16:42,973 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:16:42,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42 WrapperNode [2021-05-02 23:16:42,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:16:42,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:16:42,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:16:42,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:16:43,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... [2021-05-02 23:16:43,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:16:43,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:16:43,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:16:43,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:16:43,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:16:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:16:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:16:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:16:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:16:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:16:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:16:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:16:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:16:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:16:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:16:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:16:43,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:16:43,385 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:16:43,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:16:43 BoogieIcfgContainer [2021-05-02 23:16:43,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:16:43,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:16:43,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:16:43,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:16:43,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:16:42" (1/3) ... [2021-05-02 23:16:43,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db6f5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:16:43, skipping insertion in model container [2021-05-02 23:16:43,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:16:42" (2/3) ... [2021-05-02 23:16:43,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db6f5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:16:43, skipping insertion in model container [2021-05-02 23:16:43,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:16:43" (3/3) ... [2021-05-02 23:16:43,396 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2021-05-02 23:16:43,399 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:16:43,401 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:16:43,411 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:16:43,423 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:16:43,423 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:16:43,423 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:16:43,423 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:16:43,424 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:16:43,424 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:16:43,424 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:16:43,424 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:16:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:16:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:16:43,435 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:43,436 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:43,436 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2021-05-02 23:16:43,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:43,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546711802] [2021-05-02 23:16:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:43,478 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:16:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:43,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:43,570 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:43,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546711802] [2021-05-02 23:16:43,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [546711802] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:43,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:43,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:16:43,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889552873] [2021-05-02 23:16:43,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:16:43,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:43,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:16:43,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:16:43,583 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:43,621 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:16:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:16:43,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:16:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:43,626 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:16:43,626 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:16:43,628 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:16:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:16:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:16:43,647 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-02 23:16:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-02 23:16:43,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-02 23:16:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:43,648 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-02 23:16:43,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-02 23:16:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:16:43,649 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:43,649 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:43,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:16:43,650 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2021-05-02 23:16:43,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:43,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1951287206] [2021-05-02 23:16:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:43,652 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:16:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:43,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:43,769 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:43,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1951287206] [2021-05-02 23:16:43,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1951287206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:43,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:43,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:16:43,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795844533] [2021-05-02 23:16:43,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:16:43,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:16:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:16:43,771 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-02 23:16:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:43,821 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-05-02 23:16:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:16:43,822 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-02 23:16:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:43,823 INFO L225 Difference]: With dead ends: 20 [2021-05-02 23:16:43,823 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:16:43,824 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:16:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:16:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-05-02 23:16:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-02 23:16:43,827 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-02 23:16:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:43,828 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-02 23:16:43,828 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-02 23:16:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-02 23:16:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:16:43,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:43,828 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:43,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:16:43,828 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2021-05-02 23:16:43,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:43,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463615762] [2021-05-02 23:16:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:43,851 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_11 4294967296) 99) (not (= (mod v_main_~y~0_6 2) 0))) InVars {main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] [2021-05-02 23:16:43,859 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:43,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:43,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:43,936 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:43,971 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:44,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:44,261 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:44,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463615762] [2021-05-02 23:16:44,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [463615762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:44,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:44,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:16:44,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479142137] [2021-05-02 23:16:44,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:16:44,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:16:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:16:44,263 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-02 23:16:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:44,475 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2021-05-02 23:16:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:16:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-02 23:16:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:44,475 INFO L225 Difference]: With dead ends: 29 [2021-05-02 23:16:44,476 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:16:44,476 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 321.2ms TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:16:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:16:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-05-02 23:16:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-05-02 23:16:44,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2021-05-02 23:16:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:44,480 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-05-02 23:16:44,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 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-02 23:16:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-05-02 23:16:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:16:44,480 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:44,480 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:44,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:16:44,480 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 2 times [2021-05-02 23:16:44,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:44,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681342010] [2021-05-02 23:16:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:44,486 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (< (mod (+ v_main_~x~0_15 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] [2021-05-02 23:16:44,489 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:44,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:44,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:44,537 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:44,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:44,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_8 2) 0)) (< (mod v_main_~x~0_17 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:16:44,566 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:44,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:44,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:44,606 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:44,634 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:44,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:44,889 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:44,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681342010] [2021-05-02 23:16:44,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [681342010] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:44,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:44,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:16:44,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271655420] [2021-05-02 23:16:44,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:16:44,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:16:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:16:44,891 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-02 23:16:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:45,009 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-05-02 23:16:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:16:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-02 23:16:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:45,010 INFO L225 Difference]: With dead ends: 27 [2021-05-02 23:16:45,010 INFO L226 Difference]: Without dead ends: 20 [2021-05-02 23:16:45,011 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 234.9ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:16:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-02 23:16:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-02 23:16:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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-02 23:16:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-05-02 23:16:45,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2021-05-02 23:16:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:45,014 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-05-02 23:16:45,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-02 23:16:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-05-02 23:16:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:16:45,015 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:45,015 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:45,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:16:45,015 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 1 times [2021-05-02 23:16:45,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:45,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698062860] [2021-05-02 23:16:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:45,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_22 2) 4294967296) 99) (= (mod v_main_~y~0_9 2) 0)) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] [2021-05-02 23:16:45,023 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:45,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:45,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:45,175 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:45,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:45,238 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_24 4294967296) 99) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[] [2021-05-02 23:16:45,241 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:45,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:45,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:45,394 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:45,468 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_26 4294967296) 99) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:16:45,470 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:45,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:45,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:45,526 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:45,548 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:45,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:45,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:45,850 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:45,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698062860] [2021-05-02 23:16:45,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1698062860] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:45,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:45,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:16:45,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858045950] [2021-05-02 23:16:45,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:16:45,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:45,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:16:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:16:45,851 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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-02 23:16:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:46,018 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-05-02 23:16:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:16:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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-02 23:16:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:46,019 INFO L225 Difference]: With dead ends: 33 [2021-05-02 23:16:46,019 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:16:46,020 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 270.7ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:16:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:16:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:16:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-05-02 23:16:46,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2021-05-02 23:16:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:46,024 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-05-02 23:16:46,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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-02 23:16:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-05-02 23:16:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:16:46,025 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:46,025 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:46,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:16:46,025 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 3 times [2021-05-02 23:16:46,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:46,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [578795182] [2021-05-02 23:16:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:46,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_12 2))) (< (mod (+ v_main_~x~0_32 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[] [2021-05-02 23:16:46,039 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:46,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:46,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:46,083 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:46,118 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:46,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_13 2) 0)) (< (mod v_main_~x~0_34 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:16:46,122 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:46,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:46,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:46,184 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:46,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:46,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:46,442 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:46,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [578795182] [2021-05-02 23:16:46,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [578795182] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:46,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:46,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:16:46,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490758850] [2021-05-02 23:16:46,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:16:46,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:16:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:16:46,444 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:46,598 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-05-02 23:16:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:16:46,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:16:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:46,599 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:16:46,599 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:16:46,599 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 247.4ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:16:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:16:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:16:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-02 23:16:46,604 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2021-05-02 23:16:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:46,604 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-02 23:16:46,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-02 23:16:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:16:46,604 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:46,604 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:46,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:16:46,604 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1088949283, now seen corresponding path program 2 times [2021-05-02 23:16:46,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:46,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415655695] [2021-05-02 23:16:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:46,609 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_40 2) 4294967296) 99) (= (mod v_main_~y~0_14 2) 0)) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[] [2021-05-02 23:16:46,611 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:46,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:46,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:46,742 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:46,800 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:46,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_42 4294967296) 99) (= (mod v_main_~y~0_15 2) 0)) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:16:46,804 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:46,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:46,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:46,951 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:46,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_16 2) 0)) (< (mod v_main_~x~0_44 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[] [2021-05-02 23:16:46,997 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:47,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:47,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:47,041 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:47,065 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:47,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:47,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:47,386 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:47,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [415655695] [2021-05-02 23:16:47,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [415655695] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:47,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:47,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:16:47,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664492920] [2021-05-02 23:16:47,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:16:47,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:16:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:16:47,388 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:47,526 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-05-02 23:16:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:16:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:16:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:47,527 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:16:47,527 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:16:47,527 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 308.9ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:16:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:16:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-05-02 23:16:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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-02 23:16:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-05-02 23:16:47,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2021-05-02 23:16:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:47,531 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-05-02 23:16:47,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-05-02 23:16:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:16:47,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:47,532 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:47,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:16:47,532 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1838845100, now seen corresponding path program 4 times [2021-05-02 23:16:47,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:47,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983882334] [2021-05-02 23:16:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:47,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (< (mod (+ v_main_~x~0_51 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_51, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_51, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:16:47,537 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:47,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:47,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:47,576 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:47,599 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:47,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_18 2))) (< (mod v_main_~x~0_53 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_53, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_53, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[] [2021-05-02 23:16:47,602 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:47,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:47,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:47,639 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:47,663 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:47,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:47,919 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:47,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983882334] [2021-05-02 23:16:47,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [983882334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:47,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:47,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:16:47,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954240662] [2021-05-02 23:16:47,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:16:47,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:16:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:16:47,921 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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-02 23:16:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:48,207 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-05-02 23:16:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:16:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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-02 23:16:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:48,208 INFO L225 Difference]: With dead ends: 41 [2021-05-02 23:16:48,208 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:16:48,208 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 380.1ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:16:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:16:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:16:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-05-02 23:16:48,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2021-05-02 23:16:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:48,213 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-05-02 23:16:48,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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-02 23:16:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2021-05-02 23:16:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:16:48,214 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:48,214 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:48,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:16:48,214 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -894636902, now seen corresponding path program 3 times [2021-05-02 23:16:48,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:48,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763107318] [2021-05-02 23:16:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:48,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_60 2) 4294967296) 99) (= (mod v_main_~y~0_19 2) 0)) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[] [2021-05-02 23:16:48,220 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:48,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:48,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:48,303 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:48,354 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:48,356 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_62 4294967296) 99) (= (mod v_main_~y~0_20 2) 0)) InVars {main_~x~0=v_main_~x~0_62, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_62, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[] [2021-05-02 23:16:48,357 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:48,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:48,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:48,515 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:48,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_21 2) 0)) (< (mod v_main_~x~0_64 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[] [2021-05-02 23:16:48,587 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:48,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:48,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:48,628 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:48,652 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:48,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:48,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:48,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:48,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763107318] [2021-05-02 23:16:48,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763107318] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:48,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:48,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:16:48,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626669517] [2021-05-02 23:16:48,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:16:48,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:48,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:16:48,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:16:48,973 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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-02 23:16:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:49,149 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-05-02 23:16:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:16:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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-02 23:16:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:49,150 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:16:49,150 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:16:49,150 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 324.6ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:16:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:16:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:16:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-05-02 23:16:49,155 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2021-05-02 23:16:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:49,155 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-05-02 23:16:49,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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-02 23:16:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-05-02 23:16:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:16:49,156 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:49,156 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:49,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:16:49,156 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1155967511, now seen corresponding path program 4 times [2021-05-02 23:16:49,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:49,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039778335] [2021-05-02 23:16:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:49,160 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_22 2) 0) (< (mod (+ v_main_~x~0_72 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:16:49,162 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:49,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:49,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:49,326 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:49,364 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:49,365 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_23 2) 0) (< (mod v_main_~x~0_74 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_74, main_~y~0=v_main_~y~0_23} OutVars{main_~x~0=v_main_~x~0_74, main_~y~0=v_main_~y~0_23} AuxVars[] AssignedVars[] [2021-05-02 23:16:49,366 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:49,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:49,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:49,566 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:49,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_76 4294967296) 99) (not (= 0 (mod v_main_~y~0_24 2)))) InVars {main_~x~0=v_main_~x~0_76, main_~y~0=v_main_~y~0_24} OutVars{main_~x~0=v_main_~x~0_76, main_~y~0=v_main_~y~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:16:49,603 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:49,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:49,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:49,642 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:49,661 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:49,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:49,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:50,101 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:50,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039778335] [2021-05-02 23:16:50,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1039778335] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:50,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:50,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:16:50,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698730336] [2021-05-02 23:16:50,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:16:50,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:16:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:16:50,103 INFO L87 Difference]: Start difference. First operand 33 states and 36 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-02 23:16:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:50,289 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-05-02 23:16:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:16:50,290 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-02 23:16:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:50,291 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:16:50,291 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:16:50,291 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 406.1ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:16:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:16:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:16:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-05-02 23:16:50,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2021-05-02 23:16:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:50,306 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-05-02 23:16:50,306 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-02 23:16:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-05-02 23:16:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:16:50,307 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:50,307 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:50,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:16:50,307 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1715393034, now seen corresponding path program 5 times [2021-05-02 23:16:50,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:50,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308472441] [2021-05-02 23:16:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:50,313 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_25 2) 0)) (< (mod (+ v_main_~x~0_85 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_25} OutVars{main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_25} AuxVars[] AssignedVars[] [2021-05-02 23:16:50,314 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:50,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:50,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:50,367 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:50,393 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:50,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_26 2) 0)) (< (mod v_main_~x~0_87 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_26} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_26} AuxVars[] AssignedVars[] [2021-05-02 23:16:50,397 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:50,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:50,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:50,459 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:50,494 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:50,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:50,843 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:50,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308472441] [2021-05-02 23:16:50,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1308472441] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:50,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:50,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:16:50,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132935424] [2021-05-02 23:16:50,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:16:50,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:16:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:16:50,845 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:51,264 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-05-02 23:16:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:16:51,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 23:16:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:51,266 INFO L225 Difference]: With dead ends: 49 [2021-05-02 23:16:51,266 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:16:51,267 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 456.4ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:16:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:16:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-05-02 23:16:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-05-02 23:16:51,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2021-05-02 23:16:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:51,279 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-05-02 23:16:51,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-05-02 23:16:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:16:51,284 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:51,284 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:51,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:16:51,285 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 396819540, now seen corresponding path program 5 times [2021-05-02 23:16:51,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:51,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326892598] [2021-05-02 23:16:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:51,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_27 2) 0) (< (mod (+ v_main_~x~0_96 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_96, main_~y~0=v_main_~y~0_27} OutVars{main_~x~0=v_main_~x~0_96, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[] [2021-05-02 23:16:51,292 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:51,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:51,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:51,498 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:51,618 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:16:51,622 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:51,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_98 4294967296) 99) (= (mod v_main_~y~0_28 2) 0)) InVars {main_~x~0=v_main_~x~0_98, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_98, main_~y~0=v_main_~y~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:16:51,638 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:51,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:51,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:51,856 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:51,960 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:16:51,963 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_29 2) 0)) (< (mod v_main_~x~0_100 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_100, main_~y~0=v_main_~y~0_29} OutVars{main_~x~0=v_main_~x~0_100, main_~y~0=v_main_~y~0_29} AuxVars[] AssignedVars[] [2021-05-02 23:16:51,980 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:51,981 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:51,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:52,018 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:52,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:52,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:52,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:52,362 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:52,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326892598] [2021-05-02 23:16:52,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1326892598] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:52,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:52,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:16:52,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526172745] [2021-05-02 23:16:52,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:16:52,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:16:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:16:52,363 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:52,653 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-05-02 23:16:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:16:52,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 23:16:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:52,654 INFO L225 Difference]: With dead ends: 47 [2021-05-02 23:16:52,654 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 23:16:52,654 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 391.3ms TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:16:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 23:16:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-02 23:16:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-05-02 23:16:52,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 23 [2021-05-02 23:16:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:52,660 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-05-02 23:16:52,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2021-05-02 23:16:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:16:52,660 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:52,660 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:52,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:16:52,660 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1000059729, now seen corresponding path program 6 times [2021-05-02 23:16:52,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:52,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596707535] [2021-05-02 23:16:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:52,666 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 0 (mod v_main_~y~0_30 2)) (< (mod (+ v_main_~x~0_110 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_110, main_~y~0=v_main_~y~0_30} OutVars{main_~x~0=v_main_~x~0_110, main_~y~0=v_main_~y~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:16:52,668 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:52,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:52,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:52,791 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:52,835 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:52,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_31 2) 0) (< (mod v_main_~x~0_112 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_31} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_31} AuxVars[] AssignedVars[] [2021-05-02 23:16:52,839 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:52,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:52,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:53,039 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:53,152 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:16:53,155 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_32 2) 0)) (< (mod v_main_~x~0_114 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_32} OutVars{main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:16:53,157 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:53,170 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:53,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:53,210 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:53,233 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:53,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:53,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:53,601 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:53,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596707535] [2021-05-02 23:16:53,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [596707535] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:53,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:53,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:16:53,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841354940] [2021-05-02 23:16:53,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:16:53,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:53,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:16:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:16:53,603 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-02 23:16:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:53,941 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-05-02 23:16:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:16:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-02 23:16:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:53,941 INFO L225 Difference]: With dead ends: 49 [2021-05-02 23:16:53,941 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 23:16:53,943 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 467.7ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:16:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 23:16:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-05-02 23:16:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-05-02 23:16:53,963 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2021-05-02 23:16:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:53,963 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-05-02 23:16:53,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-02 23:16:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-05-02 23:16:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:16:53,965 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:53,965 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:53,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:16:53,965 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -599923264, now seen corresponding path program 6 times [2021-05-02 23:16:53,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:53,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1732315859] [2021-05-02 23:16:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:53,970 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_33 2) 0)) (< (mod (+ v_main_~x~0_125 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_125, main_~y~0=v_main_~y~0_33} OutVars{main_~x~0=v_main_~x~0_125, main_~y~0=v_main_~y~0_33} AuxVars[] AssignedVars[] [2021-05-02 23:16:53,971 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:53,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:53,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:54,007 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:54,027 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:54,034 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_34 2) 0)) (< (mod v_main_~x~0_127 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_127, main_~y~0=v_main_~y~0_34} OutVars{main_~x~0=v_main_~x~0_127, main_~y~0=v_main_~y~0_34} AuxVars[] AssignedVars[] [2021-05-02 23:16:54,035 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:54,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:54,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:54,077 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:54,104 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:54,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:54,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:54,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1732315859] [2021-05-02 23:16:54,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1732315859] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:54,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:54,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:16:54,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652504415] [2021-05-02 23:16:54,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:16:54,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:16:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:16:54,477 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-02 23:16:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:54,919 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2021-05-02 23:16:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:16:54,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-02 23:16:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:54,920 INFO L225 Difference]: With dead ends: 57 [2021-05-02 23:16:54,920 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:16:54,921 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 538.1ms TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:16:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:16:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 23:16:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-05-02 23:16:54,926 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2021-05-02 23:16:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:54,926 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-05-02 23:16:54,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-02 23:16:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-05-02 23:16:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:16:54,926 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:54,926 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:54,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:16:54,926 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash 893296398, now seen corresponding path program 7 times [2021-05-02 23:16:54,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:54,927 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2085367022] [2021-05-02 23:16:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:54,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_138 2) 4294967296) 99) (= (mod v_main_~y~0_35 2) 0)) InVars {main_~x~0=v_main_~x~0_138, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_138, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[] [2021-05-02 23:16:54,932 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:54,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:55,021 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:55,078 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:55,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:55,131 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_36 2) 0) (< (mod v_main_~x~0_140 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_36} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[] [2021-05-02 23:16:55,132 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:55,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:55,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:55,261 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:55,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_37 2) 0)) (< (mod v_main_~x~0_142 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_142, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_142, main_~y~0=v_main_~y~0_37} AuxVars[] AssignedVars[] [2021-05-02 23:16:55,314 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:55,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:55,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:55,351 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:55,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:55,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:55,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:55,771 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:55,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2085367022] [2021-05-02 23:16:55,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2085367022] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:55,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:55,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:16:55,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229495300] [2021-05-02 23:16:55,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:16:55,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:16:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:16:55,772 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-02 23:16:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:56,134 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-05-02 23:16:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:16:56,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-02 23:16:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:56,135 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:16:56,135 INFO L226 Difference]: Without dead ends: 48 [2021-05-02 23:16:56,135 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 540.3ms TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:16:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-02 23:16:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-05-02 23:16:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2021-05-02 23:16:56,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2021-05-02 23:16:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:56,141 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2021-05-02 23:16:56,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-02 23:16:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2021-05-02 23:16:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:16:56,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:56,141 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:56,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:16:56,141 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1372950411, now seen corresponding path program 8 times [2021-05-02 23:16:56,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:56,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372076891] [2021-05-02 23:16:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:56,146 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_154 2) 4294967296) 99) (= (mod v_main_~y~0_38 2) 0)) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_38} OutVars{main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_38} AuxVars[] AssignedVars[] [2021-05-02 23:16:56,147 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:56,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:56,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:56,254 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:56,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:56,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_156 4294967296) 99) (= (mod v_main_~y~0_39 2) 0)) InVars {main_~x~0=v_main_~x~0_156, main_~y~0=v_main_~y~0_39} OutVars{main_~x~0=v_main_~x~0_156, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:16:56,306 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:56,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:56,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:56,497 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:56,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_40 2) 0)) (< (mod v_main_~x~0_158 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_158, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_158, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[] [2021-05-02 23:16:56,545 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:56,555 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:56,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:56,581 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:56,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:56,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:56,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:57,123 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:57,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372076891] [2021-05-02 23:16:57,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1372076891] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:57,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:57,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:16:57,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777465260] [2021-05-02 23:16:57,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:16:57,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:16:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:16:57,125 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:57,561 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2021-05-02 23:16:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:16:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-02 23:16:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:57,562 INFO L225 Difference]: With dead ends: 57 [2021-05-02 23:16:57,562 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 23:16:57,562 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 685.1ms TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:16:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 23:16:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-05-02 23:16:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-05-02 23:16:57,567 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2021-05-02 23:16:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:57,568 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-05-02 23:16:57,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-05-02 23:16:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:16:57,568 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:57,568 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:57,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:16:57,568 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1350577782, now seen corresponding path program 7 times [2021-05-02 23:16:57,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:57,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [676563330] [2021-05-02 23:16:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:57,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_171 1) 4294967296) 99) (not (= (mod v_main_~y~0_41 2) 0))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_41} OutVars{main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:16:57,574 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:16:57,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:57,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:16:57,615 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:16:57,641 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:57,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_173 4294967296) 99) (not (= 0 (mod v_main_~y~0_42 2)))) InVars {main_~x~0=v_main_~x~0_173, main_~y~0=v_main_~y~0_42} OutVars{main_~x~0=v_main_~x~0_173, main_~y~0=v_main_~y~0_42} AuxVars[] AssignedVars[] [2021-05-02 23:16:57,644 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:57,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:57,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:57,684 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:57,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:57,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:58,148 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:58,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [676563330] [2021-05-02 23:16:58,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [676563330] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:58,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:58,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:16:58,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049151374] [2021-05-02 23:16:58,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:16:58,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:16:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:16:58,149 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-02 23:16:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:16:58,645 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-05-02 23:16:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:16:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-02 23:16:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:16:58,646 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:16:58,646 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:16:58,646 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 647.6ms TimeCoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:16:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:16:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:16:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:16:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2021-05-02 23:16:58,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 31 [2021-05-02 23:16:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:16:58,652 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2021-05-02 23:16:58,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-02 23:16:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2021-05-02 23:16:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:16:58,652 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:16:58,653 INFO L523 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:16:58,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:16:58,653 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:16:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:16:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1536011064, now seen corresponding path program 9 times [2021-05-02 23:16:58,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:16:58,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519608291] [2021-05-02 23:16:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:16:58,657 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_43 2) 0) (< (mod (+ v_main_~x~0_186 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_186, main_~y~0=v_main_~y~0_43} OutVars{main_~x~0=v_main_~x~0_186, main_~y~0=v_main_~y~0_43} AuxVars[] AssignedVars[] [2021-05-02 23:16:58,658 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:16:58,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:58,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:16:58,744 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:16:58,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:16:58,804 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_188 4294967296) 99) (= (mod v_main_~y~0_44 2) 0)) InVars {main_~x~0=v_main_~x~0_188, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_188, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[] [2021-05-02 23:16:58,806 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:16:58,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:58,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:16:58,934 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:16:59,023 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_45 2) 0)) (< (mod v_main_~x~0_190 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_190, main_~y~0=v_main_~y~0_45} OutVars{main_~x~0=v_main_~x~0_190, main_~y~0=v_main_~y~0_45} AuxVars[] AssignedVars[] [2021-05-02 23:16:59,025 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:16:59,035 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:16:59,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:16:59,065 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:16:59,094 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:16:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:59,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:16:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:16:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:16:59,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:59,549 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:59,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519608291] [2021-05-02 23:16:59,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1519608291] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:59,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:59,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:16:59,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150960465] [2021-05-02 23:16:59,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:16:59,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:16:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:16:59,550 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-02 23:17:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:00,013 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-05-02 23:17:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:17:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-02 23:17:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:00,014 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:17:00,014 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:17:00,014 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 647.0ms TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:17:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:17:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:17:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 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-02 23:17:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-05-02 23:17:00,020 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 31 [2021-05-02 23:17:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:00,020 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-05-02 23:17:00,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-02 23:17:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-05-02 23:17:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:17:00,020 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:00,020 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:00,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:17:00,020 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1924349617, now seen corresponding path program 8 times [2021-05-02 23:17:00,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:00,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1416345940] [2021-05-02 23:17:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:00,024 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_46 2) 0)) (< (mod (+ v_main_~x~0_204 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_46} OutVars{main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_46} AuxVars[] AssignedVars[] [2021-05-02 23:17:00,025 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:00,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:00,053 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:00,069 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:00,094 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:00,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_206 4294967296) 99) (not (= (mod v_main_~y~0_47 2) 0))) InVars {main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_47} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_47} AuxVars[] AssignedVars[] [2021-05-02 23:17:00,096 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:00,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:00,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:00,131 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:00,154 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:00,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:00,588 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:00,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1416345940] [2021-05-02 23:17:00,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1416345940] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:00,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:00,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:17:00,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012082048] [2021-05-02 23:17:00,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:17:00,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:17:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:17:00,589 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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-02 23:17:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:01,087 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-05-02 23:17:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:17:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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-02 23:17:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:01,088 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:17:01,088 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:17:01,088 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 669.2ms TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:17:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:17:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:17:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 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-02 23:17:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2021-05-02 23:17:01,094 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 33 [2021-05-02 23:17:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:01,094 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2021-05-02 23:17:01,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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-02 23:17:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2021-05-02 23:17:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:17:01,095 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:01,095 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:01,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:17:01,095 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1024278843, now seen corresponding path program 10 times [2021-05-02 23:17:01,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:01,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369849463] [2021-05-02 23:17:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:01,099 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_220 2) 4294967296) 99) (= (mod v_main_~y~0_48 2) 0)) InVars {main_~x~0=v_main_~x~0_220, main_~y~0=v_main_~y~0_48} OutVars{main_~x~0=v_main_~x~0_220, main_~y~0=v_main_~y~0_48} AuxVars[] AssignedVars[] [2021-05-02 23:17:01,100 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:01,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:01,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:01,211 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:01,253 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:01,255 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_49 2) 0) (< (mod v_main_~x~0_222 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_222, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_222, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:17:01,256 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:01,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:01,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:01,392 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:01,459 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_224 4294967296) 99) (not (= (mod v_main_~y~0_50 2) 0))) InVars {main_~x~0=v_main_~x~0_224, main_~y~0=v_main_~y~0_50} OutVars{main_~x~0=v_main_~x~0_224, main_~y~0=v_main_~y~0_50} AuxVars[] AssignedVars[] [2021-05-02 23:17:01,461 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:01,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:01,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:01,502 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:01,526 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:01,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:01,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:02,079 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:02,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369849463] [2021-05-02 23:17:02,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1369849463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:02,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:02,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:17:02,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994729155] [2021-05-02 23:17:02,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:17:02,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:02,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:17:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:17:02,082 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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-02 23:17:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:02,580 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2021-05-02 23:17:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:17:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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-02 23:17:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:02,582 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:17:02,582 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:17:02,582 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 738.9ms TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:17:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:17:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:17:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2021-05-02 23:17:02,589 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2021-05-02 23:17:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:02,589 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2021-05-02 23:17:02,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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-02 23:17:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2021-05-02 23:17:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:17:02,589 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:02,589 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:02,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:17:02,590 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash -731698132, now seen corresponding path program 9 times [2021-05-02 23:17:02,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:02,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816046205] [2021-05-02 23:17:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:02,595 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_239 1) 4294967296) 99) (not (= (mod v_main_~y~0_51 2) 0))) InVars {main_~x~0=v_main_~x~0_239, main_~y~0=v_main_~y~0_51} OutVars{main_~x~0=v_main_~x~0_239, main_~y~0=v_main_~y~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:17:02,596 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:02,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:02,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:02,644 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:02,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:02,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_52 2) 0)) (< (mod v_main_~x~0_241 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_241, main_~y~0=v_main_~y~0_52} OutVars{main_~x~0=v_main_~x~0_241, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[] [2021-05-02 23:17:02,680 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:02,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:02,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:02,719 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:02,742 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:02,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:03,156 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:03,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816046205] [2021-05-02 23:17:03,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1816046205] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:03,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:03,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:17:03,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544120684] [2021-05-02 23:17:03,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:17:03,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:17:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:17:03,158 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:03,710 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2021-05-02 23:17:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:17:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-02 23:17:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:03,710 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:17:03,711 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:17:03,711 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 670.7ms TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:17:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:17:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:17:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-05-02 23:17:03,717 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 35 [2021-05-02 23:17:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:03,717 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-05-02 23:17:03,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-05-02 23:17:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:17:03,717 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:03,717 INFO L523 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:03,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:17:03,717 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1124113794, now seen corresponding path program 11 times [2021-05-02 23:17:03,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:03,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540035618] [2021-05-02 23:17:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:03,722 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_256 2) 4294967296) 99) (= (mod v_main_~y~0_53 2) 0)) InVars {main_~x~0=v_main_~x~0_256, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_256, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[] [2021-05-02 23:17:03,723 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:03,732 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:03,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:03,875 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:03,941 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:03,942 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_258 4294967296) 99) (= (mod v_main_~y~0_54 2) 0)) InVars {main_~x~0=v_main_~x~0_258, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_258, main_~y~0=v_main_~y~0_54} AuxVars[] AssignedVars[] [2021-05-02 23:17:03,943 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:03,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:04,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:04,244 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-02 23:17:04,270 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:04,322 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_55 2) 0)) (< (mod v_main_~x~0_260 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_260, main_~y~0=v_main_~y~0_55} OutVars{main_~x~0=v_main_~x~0_260, main_~y~0=v_main_~y~0_55} AuxVars[] AssignedVars[] [2021-05-02 23:17:04,323 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:04,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:04,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:04,361 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:04,385 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:04,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:04,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:04,914 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:04,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1540035618] [2021-05-02 23:17:04,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1540035618] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:04,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:04,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:17:04,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146386235] [2021-05-02 23:17:04,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:17:04,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:04,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:17:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:17:04,915 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:05,472 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-05-02 23:17:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:17:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-02 23:17:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:05,475 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:17:05,475 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:17:05,476 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 781.2ms TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:17:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:17:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:17:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 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-02 23:17:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-05-02 23:17:05,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 35 [2021-05-02 23:17:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:05,482 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-05-02 23:17:05,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-05-02 23:17:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:17:05,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:05,482 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:05,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:17:05,483 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1983011097, now seen corresponding path program 10 times [2021-05-02 23:17:05,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:05,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531760119] [2021-05-02 23:17:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:05,487 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_276 1) 4294967296) 99) (not (= (mod v_main_~y~0_56 2) 0))) InVars {main_~x~0=v_main_~x~0_276, main_~y~0=v_main_~y~0_56} OutVars{main_~x~0=v_main_~x~0_276, main_~y~0=v_main_~y~0_56} AuxVars[] AssignedVars[] [2021-05-02 23:17:05,489 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:05,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:05,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:05,526 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:05,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:05,551 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_278 4294967296) 99) (not (= (mod v_main_~y~0_57 2) 0))) InVars {main_~x~0=v_main_~x~0_278, main_~y~0=v_main_~y~0_57} OutVars{main_~x~0=v_main_~x~0_278, main_~y~0=v_main_~y~0_57} AuxVars[] AssignedVars[] [2021-05-02 23:17:05,552 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:05,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:05,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:05,594 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:05,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:05,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:06,213 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:06,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531760119] [2021-05-02 23:17:06,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [531760119] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:06,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:06,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:17:06,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817007072] [2021-05-02 23:17:06,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:17:06,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:17:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:17:06,214 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 19 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-02 23:17:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:06,893 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2021-05-02 23:17:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:17:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 19 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-02 23:17:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:06,894 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:17:06,894 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:17:06,894 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 860.7ms TimeCoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:17:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:17:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:17:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2021-05-02 23:17:06,901 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 37 [2021-05-02 23:17:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2021-05-02 23:17:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 19 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-02 23:17:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2021-05-02 23:17:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:17:06,901 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:06,901 INFO L523 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:06,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:17:06,901 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -149831425, now seen corresponding path program 12 times [2021-05-02 23:17:06,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:06,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577756452] [2021-05-02 23:17:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:06,905 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_58 2) 0) (< (mod (+ v_main_~x~0_294 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[] [2021-05-02 23:17:06,907 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:06,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:06,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:07,027 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:07,139 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:07,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:07,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_59 2) 0) (< (mod v_main_~x~0_296 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_59} OutVars{main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_59} AuxVars[] AssignedVars[] [2021-05-02 23:17:07,143 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:07,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:07,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:07,276 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:07,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_298 4294967296) 99) (not (= (mod v_main_~y~0_60 2) 0))) InVars {main_~x~0=v_main_~x~0_298, main_~y~0=v_main_~y~0_60} OutVars{main_~x~0=v_main_~x~0_298, main_~y~0=v_main_~y~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:17:07,353 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:07,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:07,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:07,387 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:07,413 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:07,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:07,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:07,975 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:07,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577756452] [2021-05-02 23:17:07,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [577756452] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:07,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:07,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:17:07,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449105947] [2021-05-02 23:17:07,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:17:07,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:07,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:17:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:17:07,977 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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-02 23:17:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:08,532 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2021-05-02 23:17:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:17:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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-02 23:17:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:08,533 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:17:08,533 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:17:08,534 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 808.5ms TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:17:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:17:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:17:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2021-05-02 23:17:08,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 37 [2021-05-02 23:17:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:08,540 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2021-05-02 23:17:08,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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-02 23:17:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2021-05-02 23:17:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:17:08,541 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:08,541 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:08,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 23:17:08,541 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1903927582, now seen corresponding path program 11 times [2021-05-02 23:17:08,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:08,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919888083] [2021-05-02 23:17:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:08,544 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_315 1) 4294967296) 99) (not (= (mod v_main_~y~0_61 2) 0))) InVars {main_~x~0=v_main_~x~0_315, main_~y~0=v_main_~y~0_61} OutVars{main_~x~0=v_main_~x~0_315, main_~y~0=v_main_~y~0_61} AuxVars[] AssignedVars[] [2021-05-02 23:17:08,545 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:08,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:08,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:08,581 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:08,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:08,606 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_317 4294967296) 99) (not (= (mod v_main_~y~0_62 2) 0))) InVars {main_~x~0=v_main_~x~0_317, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_317, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:17:08,607 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:08,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:08,630 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:08,644 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:08,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:08,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:09,217 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:09,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919888083] [2021-05-02 23:17:09,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1919888083] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:09,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:09,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:17:09,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320056514] [2021-05-02 23:17:09,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:17:09,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:17:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:17:09,218 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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-02 23:17:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:09,981 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-05-02 23:17:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:17:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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-02 23:17:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:09,982 INFO L225 Difference]: With dead ends: 81 [2021-05-02 23:17:09,982 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:17:09,983 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 963.2ms TimeCoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:17:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:17:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-02 23:17:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-02 23:17:09,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 39 [2021-05-02 23:17:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:09,994 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-02 23:17:09,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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-02 23:17:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-02 23:17:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:17:09,995 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:09,995 INFO L523 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:09,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:17:09,995 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -345507524, now seen corresponding path program 13 times [2021-05-02 23:17:09,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:09,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255037404] [2021-05-02 23:17:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:10,000 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_63 2) 0) (< (mod (+ v_main_~x~0_334 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_334, main_~y~0=v_main_~y~0_63} OutVars{main_~x~0=v_main_~x~0_334, main_~y~0=v_main_~y~0_63} AuxVars[] AssignedVars[] [2021-05-02 23:17:10,001 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:10,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:10,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:10,249 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-05-02 23:17:10,257 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:10,419 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:10,421 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:10,422 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_64 2) 0) (< (mod v_main_~x~0_336 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_336, main_~y~0=v_main_~y~0_64} OutVars{main_~x~0=v_main_~x~0_336, main_~y~0=v_main_~y~0_64} AuxVars[] AssignedVars[] [2021-05-02 23:17:10,423 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:10,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:10,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:10,528 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:10,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_65 2) 0)) (< (mod v_main_~x~0_338 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_338, main_~y~0=v_main_~y~0_65} OutVars{main_~x~0=v_main_~x~0_338, main_~y~0=v_main_~y~0_65} AuxVars[] AssignedVars[] [2021-05-02 23:17:10,587 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:10,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:10,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:10,634 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:10,661 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:10,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:10,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:11,249 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:11,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255037404] [2021-05-02 23:17:11,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [255037404] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:11,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:11,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:17:11,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222724506] [2021-05-02 23:17:11,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:17:11,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:17:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:17:11,251 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 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-02 23:17:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:11,895 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2021-05-02 23:17:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:17:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 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-02 23:17:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:11,896 INFO L225 Difference]: With dead ends: 79 [2021-05-02 23:17:11,896 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 23:17:11,896 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 14 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 890.2ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:17:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 23:17:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-05-02 23:17:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-05-02 23:17:11,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 39 [2021-05-02 23:17:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:11,906 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-05-02 23:17:11,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 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-02 23:17:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-05-02 23:17:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:17:11,906 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:11,906 INFO L523 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:11,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:17:11,906 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:11,913 INFO L82 PathProgramCache]: Analyzing trace with hash 588322361, now seen corresponding path program 14 times [2021-05-02 23:17:11,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:11,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129812383] [2021-05-02 23:17:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:11,917 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_66 2) 0) (< (mod (+ v_main_~x~0_356 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_66} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[] [2021-05-02 23:17:11,918 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:11,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:11,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:12,037 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:12,202 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:12,204 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:12,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_358 4294967296) 99) (= (mod v_main_~y~0_67 2) 0)) InVars {main_~x~0=v_main_~x~0_358, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_358, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[] [2021-05-02 23:17:12,206 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:12,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:12,258 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:12,295 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:12,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_360 4294967296) 99) (not (= 0 (mod v_main_~y~0_68 2)))) InVars {main_~x~0=v_main_~x~0_360, main_~y~0=v_main_~y~0_68} OutVars{main_~x~0=v_main_~x~0_360, main_~y~0=v_main_~y~0_68} AuxVars[] AssignedVars[] [2021-05-02 23:17:12,360 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:12,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:12,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:12,401 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:12,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:12,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:12,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:13,256 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:13,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129812383] [2021-05-02 23:17:13,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2129812383] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:13,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:13,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:17:13,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064731156] [2021-05-02 23:17:13,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:17:13,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:17:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:17:13,257 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:14,020 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2021-05-02 23:17:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:17:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-02 23:17:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:14,021 INFO L225 Difference]: With dead ends: 81 [2021-05-02 23:17:14,021 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:17:14,022 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 15 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1166.6ms TimeCoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:17:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:17:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-02 23:17:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-02 23:17:14,033 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 41 [2021-05-02 23:17:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:14,034 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-02 23:17:14,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-02 23:17:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:17:14,034 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:14,034 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:14,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:17:14,034 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash 448874136, now seen corresponding path program 12 times [2021-05-02 23:17:14,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:14,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777905410] [2021-05-02 23:17:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:14,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_69 2) 0)) (< (mod (+ v_main_~x~0_379 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_379, main_~y~0=v_main_~y~0_69} OutVars{main_~x~0=v_main_~x~0_379, main_~y~0=v_main_~y~0_69} AuxVars[] AssignedVars[] [2021-05-02 23:17:14,039 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:14,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:14,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:14,080 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:14,104 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:14,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_381 4294967296) 99) (not (= (mod v_main_~y~0_70 2) 0))) InVars {main_~x~0=v_main_~x~0_381, main_~y~0=v_main_~y~0_70} OutVars{main_~x~0=v_main_~x~0_381, main_~y~0=v_main_~y~0_70} AuxVars[] AssignedVars[] [2021-05-02 23:17:14,107 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:14,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:14,121 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:14,143 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:14,170 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:14,888 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:14,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777905410] [2021-05-02 23:17:14,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1777905410] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:14,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:14,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:17:14,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020901409] [2021-05-02 23:17:14,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:17:14,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:17:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:17:14,889 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 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-02 23:17:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:15,720 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-05-02 23:17:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:17:15,720 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 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-02 23:17:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:15,724 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:17:15,724 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:17:15,724 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1114.1ms TimeCoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:17:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:17:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:17:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-05-02 23:17:15,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2021-05-02 23:17:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:15,736 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-05-02 23:17:15,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 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-02 23:17:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-05-02 23:17:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:17:15,736 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:15,736 INFO L523 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:15,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:17:15,737 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash 350676982, now seen corresponding path program 15 times [2021-05-02 23:17:15,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:15,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835671639] [2021-05-02 23:17:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:15,741 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_400 2) 4294967296) 99) (= (mod v_main_~y~0_71 2) 0)) InVars {main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[] [2021-05-02 23:17:15,742 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:15,751 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:15,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:15,922 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:16,015 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:16,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_72 2) 0) (< (mod v_main_~x~0_402 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_402, main_~y~0=v_main_~y~0_72} OutVars{main_~x~0=v_main_~x~0_402, main_~y~0=v_main_~y~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:17:16,018 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:16,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:16,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:16,170 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:16,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_73 2) 0)) (< (mod v_main_~x~0_404 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_404, main_~y~0=v_main_~y~0_73} OutVars{main_~x~0=v_main_~x~0_404, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[] [2021-05-02 23:17:16,231 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:16,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:16,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:16,269 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:16,296 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:16,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:16,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:17,048 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:17,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835671639] [2021-05-02 23:17:17,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [835671639] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:17,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:17,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:17:17,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563834713] [2021-05-02 23:17:17,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:17:17,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:17:17,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:17:17,049 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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-02 23:17:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:17,876 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-05-02 23:17:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:17:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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-02 23:17:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:17,877 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:17:17,877 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:17:17,878 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1152.0ms TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:17:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:17:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-05-02 23:17:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-05-02 23:17:17,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 43 [2021-05-02 23:17:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:17,885 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-05-02 23:17:17,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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-02 23:17:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-05-02 23:17:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:17:17,886 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:17,886 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:17,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:17:17,886 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1324427693, now seen corresponding path program 13 times [2021-05-02 23:17:17,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:17,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348243681] [2021-05-02 23:17:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:17,890 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_424 1) 4294967296) 99) (not (= (mod v_main_~y~0_74 2) 0))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:17:17,891 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:17,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:17,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:17,929 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:17,957 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:17,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_75 2) 0)) (< (mod v_main_~x~0_426 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_426, main_~y~0=v_main_~y~0_75} OutVars{main_~x~0=v_main_~x~0_426, main_~y~0=v_main_~y~0_75} AuxVars[] AssignedVars[] [2021-05-02 23:17:17,960 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:17,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:17,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:18,016 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:18,043 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:18,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:18,738 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:18,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348243681] [2021-05-02 23:17:18,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [348243681] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:18,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:18,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:17:18,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801272499] [2021-05-02 23:17:18,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:17:18,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:17:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:17:18,739 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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-02 23:17:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:19,425 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-05-02 23:17:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:17:19,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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-02 23:17:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:19,425 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:17:19,425 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:17:19,426 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 17 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1002.7ms TimeCoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:17:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:17:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:17:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-05-02 23:17:19,434 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 45 [2021-05-02 23:17:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:19,434 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-05-02 23:17:19,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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-02 23:17:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-05-02 23:17:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:17:19,434 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:19,434 INFO L523 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:19,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 23:17:19,434 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -393265549, now seen corresponding path program 16 times [2021-05-02 23:17:19,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:19,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589162958] [2021-05-02 23:17:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:19,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_446 2) 4294967296) 99) (= (mod v_main_~y~0_76 2) 0)) InVars {main_~x~0=v_main_~x~0_446, main_~y~0=v_main_~y~0_76} OutVars{main_~x~0=v_main_~x~0_446, main_~y~0=v_main_~y~0_76} AuxVars[] AssignedVars[] [2021-05-02 23:17:19,439 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:19,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:19,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:19,561 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:19,735 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:19,736 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:19,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_448 4294967296) 99) (= (mod v_main_~y~0_77 2) 0)) InVars {main_~x~0=v_main_~x~0_448, main_~y~0=v_main_~y~0_77} OutVars{main_~x~0=v_main_~x~0_448, main_~y~0=v_main_~y~0_77} AuxVars[] AssignedVars[] [2021-05-02 23:17:19,766 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:19,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:19,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:19,884 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:19,939 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_450 4294967296) 99) (not (= (mod v_main_~y~0_78 2) 0))) InVars {main_~x~0=v_main_~x~0_450, main_~y~0=v_main_~y~0_78} OutVars{main_~x~0=v_main_~x~0_450, main_~y~0=v_main_~y~0_78} AuxVars[] AssignedVars[] [2021-05-02 23:17:19,940 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:19,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:19,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:20,010 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:20,032 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:20,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:20,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:20,865 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:20,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589162958] [2021-05-02 23:17:20,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1589162958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:20,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:20,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:17:20,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537350617] [2021-05-02 23:17:20,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:17:20,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:17:20,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:17:20,866 INFO L87 Difference]: Start difference. First operand 81 states and 84 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-02 23:17:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:21,764 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2021-05-02 23:17:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:17:21,764 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-02 23:17:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:21,765 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:17:21,765 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:17:21,765 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 17 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1236.1ms TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:17:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:17:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:17:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-05-02 23:17:21,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2021-05-02 23:17:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:21,775 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-05-02 23:17:21,775 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-02 23:17:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-05-02 23:17:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:17:21,775 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:21,775 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:21,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:17:21,776 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash -365468850, now seen corresponding path program 14 times [2021-05-02 23:17:21,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:21,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587691401] [2021-05-02 23:17:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:21,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_471 1) 4294967296) 99) (not (= (mod v_main_~y~0_79 2) 0))) InVars {main_~x~0=v_main_~x~0_471, main_~y~0=v_main_~y~0_79} OutVars{main_~x~0=v_main_~x~0_471, main_~y~0=v_main_~y~0_79} AuxVars[] AssignedVars[] [2021-05-02 23:17:21,780 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:21,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:21,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:21,815 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:21,837 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:21,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_473 4294967296) 99) (not (= (mod v_main_~y~0_80 2) 0))) InVars {main_~x~0=v_main_~x~0_473, main_~y~0=v_main_~y~0_80} OutVars{main_~x~0=v_main_~x~0_473, main_~y~0=v_main_~y~0_80} AuxVars[] AssignedVars[] [2021-05-02 23:17:21,840 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:21,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:21,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:21,878 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:21,902 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:22,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:22,527 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:22,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587691401] [2021-05-02 23:17:22,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [587691401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:22,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:22,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:17:22,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375122898] [2021-05-02 23:17:22,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:17:22,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:17:22,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:17:22,529 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:23,365 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-05-02 23:17:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:17:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-02 23:17:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:23,366 INFO L225 Difference]: With dead ends: 97 [2021-05-02 23:17:23,366 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:17:23,366 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 986.8ms TimeCoverageRelationStatistics Valid=211, Invalid=2141, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:17:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:17:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:17:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 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-02 23:17:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2021-05-02 23:17:23,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 47 [2021-05-02 23:17:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:23,375 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-05-02 23:17:23,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2021-05-02 23:17:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:17:23,376 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:23,376 INFO L523 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:23,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:17:23,376 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1937500592, now seen corresponding path program 17 times [2021-05-02 23:17:23,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:23,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523054876] [2021-05-02 23:17:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:23,387 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_81 2) 0) (< (mod (+ v_main_~x~0_494 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_81} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[] [2021-05-02 23:17:23,388 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:23,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:23,545 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:17:23,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:23,645 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:23,701 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:23,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_496 4294967296) 99) (= (mod v_main_~y~0_82 2) 0)) InVars {main_~x~0=v_main_~x~0_496, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_496, main_~y~0=v_main_~y~0_82} AuxVars[] AssignedVars[] [2021-05-02 23:17:23,718 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:23,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:23,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:23,841 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:23,894 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_83 2) 0)) (< (mod v_main_~x~0_498 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_498, main_~y~0=v_main_~y~0_83} OutVars{main_~x~0=v_main_~x~0_498, main_~y~0=v_main_~y~0_83} AuxVars[] AssignedVars[] [2021-05-02 23:17:23,895 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:23,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:23,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:23,931 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:23,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:24,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:24,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:24,835 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:24,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523054876] [2021-05-02 23:17:24,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [523054876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:24,836 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:24,836 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:17:24,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742320695] [2021-05-02 23:17:24,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:17:24,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:17:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:17:24,836 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:25,785 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-05-02 23:17:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:17:25,786 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-02 23:17:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:25,786 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:17:25,786 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:17:25,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 18 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1322.5ms TimeCoverageRelationStatistics Valid=257, Invalid=1813, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:17:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:17:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:17:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2021-05-02 23:17:25,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 47 [2021-05-02 23:17:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:25,796 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2021-05-02 23:17:25,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2021-05-02 23:17:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:17:25,796 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:25,796 INFO L523 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:25,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:17:25,796 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -169166419, now seen corresponding path program 18 times [2021-05-02 23:17:25,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:25,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88127860] [2021-05-02 23:17:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:25,803 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_520 2) 4294967296) 99) (= (mod v_main_~y~0_84 2) 0)) InVars {main_~x~0=v_main_~x~0_520, main_~y~0=v_main_~y~0_84} OutVars{main_~x~0=v_main_~x~0_520, main_~y~0=v_main_~y~0_84} AuxVars[] AssignedVars[] [2021-05-02 23:17:25,804 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:25,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:25,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:26,072 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:26,214 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:26,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:26,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_522 4294967296) 99) (= (mod v_main_~y~0_85 2) 0)) InVars {main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_85} OutVars{main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:17:26,217 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:26,226 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:26,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:26,378 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:26,459 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_86 2) 0)) (< (mod v_main_~x~0_524 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_524, main_~y~0=v_main_~y~0_86} OutVars{main_~x~0=v_main_~x~0_524, main_~y~0=v_main_~y~0_86} AuxVars[] AssignedVars[] [2021-05-02 23:17:26,460 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:26,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:26,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:26,500 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:26,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:26,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:26,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:27,406 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:27,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88127860] [2021-05-02 23:17:27,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [88127860] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:27,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:27,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:17:27,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003097894] [2021-05-02 23:17:27,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:17:27,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:17:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:17:27,407 INFO L87 Difference]: Start difference. First operand 89 states and 92 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-02 23:17:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:28,488 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-05-02 23:17:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:17:28,488 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-02 23:17:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:28,489 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:17:28,489 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:17:28,489 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 19 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1407.5ms TimeCoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:17:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:17:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:17:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 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-02 23:17:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2021-05-02 23:17:28,498 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 49 [2021-05-02 23:17:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:28,498 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2021-05-02 23:17:28,498 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-02 23:17:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2021-05-02 23:17:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:17:28,498 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:28,499 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:28,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 23:17:28,499 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1555811068, now seen corresponding path program 15 times [2021-05-02 23:17:28,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:28,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806974725] [2021-05-02 23:17:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:28,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_87 2) 0)) (< (mod (+ v_main_~x~0_547 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_547, main_~y~0=v_main_~y~0_87} OutVars{main_~x~0=v_main_~x~0_547, main_~y~0=v_main_~y~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:17:28,503 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:28,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:28,518 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:28,542 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:28,569 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:28,570 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_88 2) 0)) (< (mod v_main_~x~0_549 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_549, main_~y~0=v_main_~y~0_88} OutVars{main_~x~0=v_main_~x~0_549, main_~y~0=v_main_~y~0_88} AuxVars[] AssignedVars[] [2021-05-02 23:17:28,571 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:28,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:28,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:28,608 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:28,635 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:29,503 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:29,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806974725] [2021-05-02 23:17:29,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1806974725] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:29,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:29,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:17:29,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006303669] [2021-05-02 23:17:29,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:17:29,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:17:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:17:29,504 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:30,764 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-05-02 23:17:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:17:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-02 23:17:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:30,765 INFO L225 Difference]: With dead ends: 105 [2021-05-02 23:17:30,765 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:17:30,766 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 4 SyntacticMatches, 20 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1520.5ms TimeCoverageRelationStatistics Valid=230, Invalid=2526, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:17:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:17:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:17:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2021-05-02 23:17:30,775 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 51 [2021-05-02 23:17:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:30,775 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2021-05-02 23:17:30,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2021-05-02 23:17:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:17:30,776 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:30,776 INFO L523 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:30,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:17:30,776 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1746567574, now seen corresponding path program 19 times [2021-05-02 23:17:30,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:30,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943318126] [2021-05-02 23:17:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:30,785 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_572 2) 4294967296) 99) (= (mod v_main_~y~0_89 2) 0)) InVars {main_~x~0=v_main_~x~0_572, main_~y~0=v_main_~y~0_89} OutVars{main_~x~0=v_main_~x~0_572, main_~y~0=v_main_~y~0_89} AuxVars[] AssignedVars[] [2021-05-02 23:17:30,786 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:30,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:30,885 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:30,921 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:31,008 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:31,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_90 2) 0) (< (mod v_main_~x~0_574 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_574, main_~y~0=v_main_~y~0_90} OutVars{main_~x~0=v_main_~x~0_574, main_~y~0=v_main_~y~0_90} AuxVars[] AssignedVars[] [2021-05-02 23:17:31,010 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:31,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:31,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:31,128 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:31,350 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:17:31,353 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_91 2) 0)) (< (mod v_main_~x~0_576 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_576, main_~y~0=v_main_~y~0_91} OutVars{main_~x~0=v_main_~x~0_576, main_~y~0=v_main_~y~0_91} AuxVars[] AssignedVars[] [2021-05-02 23:17:31,355 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:31,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:31,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:31,396 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:31,420 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:31,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:31,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:32,413 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:32,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943318126] [2021-05-02 23:17:32,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [943318126] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:32,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:32,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:17:32,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981923152] [2021-05-02 23:17:32,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:17:32,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:17:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:17:32,414 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:33,542 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2021-05-02 23:17:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:17:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-02 23:17:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:33,550 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:17:33,550 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:17:33,550 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 20 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1539.0ms TimeCoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:17:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:17:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:17:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 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-02 23:17:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2021-05-02 23:17:33,562 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 51 [2021-05-02 23:17:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:33,562 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2021-05-02 23:17:33,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2021-05-02 23:17:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:17:33,562 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:33,562 INFO L523 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:33,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-02 23:17:33,562 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1505622041, now seen corresponding path program 20 times [2021-05-02 23:17:33,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:33,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893000012] [2021-05-02 23:17:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:33,592 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_600 2) 4294967296) 99) (= (mod v_main_~y~0_92 2) 0)) InVars {main_~x~0=v_main_~x~0_600, main_~y~0=v_main_~y~0_92} OutVars{main_~x~0=v_main_~x~0_600, main_~y~0=v_main_~y~0_92} AuxVars[] AssignedVars[] [2021-05-02 23:17:33,594 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:33,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:33,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:33,730 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:33,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:33,799 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_93 2) 0) (< (mod v_main_~x~0_602 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_602, main_~y~0=v_main_~y~0_93} OutVars{main_~x~0=v_main_~x~0_602, main_~y~0=v_main_~y~0_93} AuxVars[] AssignedVars[] [2021-05-02 23:17:33,800 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:33,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:33,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:33,939 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:34,109 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:17:34,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_94 2) 0)) (< (mod v_main_~x~0_604 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_604, main_~y~0=v_main_~y~0_94} OutVars{main_~x~0=v_main_~x~0_604, main_~y~0=v_main_~y~0_94} AuxVars[] AssignedVars[] [2021-05-02 23:17:34,113 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:34,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:34,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:34,157 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:34,184 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:34,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:34,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:35,246 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:35,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893000012] [2021-05-02 23:17:35,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1893000012] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:35,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:35,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:17:35,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496529303] [2021-05-02 23:17:35,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:17:35,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:17:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:17:35,247 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:36,561 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-05-02 23:17:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:17:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-02 23:17:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:36,562 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:17:36,562 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:17:36,562 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 21 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1709.5ms TimeCoverageRelationStatistics Valid=256, Invalid=2396, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:17:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:17:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:17:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2021-05-02 23:17:36,572 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 53 [2021-05-02 23:17:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:36,572 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2021-05-02 23:17:36,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2021-05-02 23:17:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:17:36,573 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:36,573 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:36,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:17:36,573 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2121974854, now seen corresponding path program 16 times [2021-05-02 23:17:36,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:36,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78671799] [2021-05-02 23:17:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:36,577 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_95 2) 0)) (< (mod (+ v_main_~x~0_629 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_629, main_~y~0=v_main_~y~0_95} OutVars{main_~x~0=v_main_~x~0_629, main_~y~0=v_main_~y~0_95} AuxVars[] AssignedVars[] [2021-05-02 23:17:36,578 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:36,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:36,604 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:36,625 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:36,656 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:36,657 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_631 4294967296) 99) (not (= (mod v_main_~y~0_96 2) 0))) InVars {main_~x~0=v_main_~x~0_631, main_~y~0=v_main_~y~0_96} OutVars{main_~x~0=v_main_~x~0_631, main_~y~0=v_main_~y~0_96} AuxVars[] AssignedVars[] [2021-05-02 23:17:36,658 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:36,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:36,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:36,705 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:36,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:36,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:37,744 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:37,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78671799] [2021-05-02 23:17:37,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [78671799] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:37,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:37,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:17:37,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482826379] [2021-05-02 23:17:37,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:17:37,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:17:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:17:37,745 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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-02 23:17:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:39,163 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-05-02 23:17:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:17:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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-02 23:17:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:39,164 INFO L225 Difference]: With dead ends: 113 [2021-05-02 23:17:39,164 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:17:39,165 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 22 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1724.8ms TimeCoverageRelationStatistics Valid=249, Invalid=2943, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:17:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:17:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2021-05-02 23:17:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2021-05-02 23:17:39,175 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 55 [2021-05-02 23:17:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:39,175 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2021-05-02 23:17:39,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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-02 23:17:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2021-05-02 23:17:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:17:39,175 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:39,175 INFO L523 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:39,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-02 23:17:39,175 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1885198812, now seen corresponding path program 21 times [2021-05-02 23:17:39,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:39,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933289701] [2021-05-02 23:17:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:39,181 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_97 2) 0) (< (mod (+ v_main_~x~0_656 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_656, main_~y~0=v_main_~y~0_97} OutVars{main_~x~0=v_main_~x~0_656, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[] [2021-05-02 23:17:39,182 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:39,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:39,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:39,308 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:39,374 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:39,376 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_98 2) 0) (< (mod v_main_~x~0_658 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_658, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_658, main_~y~0=v_main_~y~0_98} AuxVars[] AssignedVars[] [2021-05-02 23:17:39,377 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:39,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:39,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:39,599 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:39,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_660 4294967296) 99) (not (= (mod v_main_~y~0_99 2) 0))) InVars {main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_99} OutVars{main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:17:39,675 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:39,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:39,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:39,725 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:39,755 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:39,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:39,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:40,845 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:40,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933289701] [2021-05-02 23:17:40,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1933289701] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:40,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:40,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:17:40,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755613939] [2021-05-02 23:17:40,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:17:40,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:17:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:17:40,846 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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-02 23:17:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:42,078 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2021-05-02 23:17:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:17:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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-02 23:17:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:42,082 INFO L225 Difference]: With dead ends: 111 [2021-05-02 23:17:42,082 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 23:17:42,083 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 22 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1696.1ms TimeCoverageRelationStatistics Valid=309, Invalid=2553, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:17:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 23:17:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-05-02 23:17:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2021-05-02 23:17:42,109 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 55 [2021-05-02 23:17:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:42,109 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2021-05-02 23:17:42,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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-02 23:17:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2021-05-02 23:17:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:17:42,110 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:42,110 INFO L523 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:42,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:17:42,110 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1586255583, now seen corresponding path program 22 times [2021-05-02 23:17:42,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:42,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033399161] [2021-05-02 23:17:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:42,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_100 2) 0) (< (mod (+ v_main_~x~0_686 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_686, main_~y~0=v_main_~y~0_100} OutVars{main_~x~0=v_main_~x~0_686, main_~y~0=v_main_~y~0_100} AuxVars[] AssignedVars[] [2021-05-02 23:17:42,133 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:42,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:42,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:42,246 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:42,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:42,327 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_101 2) 0) (< (mod v_main_~x~0_688 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_688, main_~y~0=v_main_~y~0_101} OutVars{main_~x~0=v_main_~x~0_688, main_~y~0=v_main_~y~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:17:42,328 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:42,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:42,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:42,471 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:42,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_102 2) 0)) (< (mod v_main_~x~0_690 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_102} OutVars{main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_102} AuxVars[] AssignedVars[] [2021-05-02 23:17:42,555 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:42,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:42,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:42,598 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:42,686 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:42,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:42,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:43,862 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:43,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033399161] [2021-05-02 23:17:43,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1033399161] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:43,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:43,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:17:43,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475984985] [2021-05-02 23:17:43,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:17:43,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:17:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:17:43,863 INFO L87 Difference]: Start difference. First operand 104 states and 107 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-02 23:17:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:45,270 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-02 23:17:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:17:45,271 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-02 23:17:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:45,272 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:17:45,272 INFO L226 Difference]: Without dead ends: 108 [2021-05-02 23:17:45,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1870.2ms TimeCoverageRelationStatistics Valid=322, Invalid=2758, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:17:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-02 23:17:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2021-05-02 23:17:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2021-05-02 23:17:45,282 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 57 [2021-05-02 23:17:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:45,282 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2021-05-02 23:17:45,282 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-02 23:17:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2021-05-02 23:17:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:17:45,283 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:45,283 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:45,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-02 23:17:45,283 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1244137616, now seen corresponding path program 17 times [2021-05-02 23:17:45,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:45,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068270221] [2021-05-02 23:17:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:45,287 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_717 1) 4294967296) 99) (not (= (mod v_main_~y~0_103 2) 0))) InVars {main_~x~0=v_main_~x~0_717, main_~y~0=v_main_~y~0_103} OutVars{main_~x~0=v_main_~x~0_717, main_~y~0=v_main_~y~0_103} AuxVars[] AssignedVars[] [2021-05-02 23:17:45,288 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:45,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:45,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:45,329 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:45,357 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:45,359 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_719 4294967296) 99) (not (= (mod v_main_~y~0_104 2) 0))) InVars {main_~x~0=v_main_~x~0_719, main_~y~0=v_main_~y~0_104} OutVars{main_~x~0=v_main_~x~0_719, main_~y~0=v_main_~y~0_104} AuxVars[] AssignedVars[] [2021-05-02 23:17:45,360 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:45,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:45,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:45,406 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:45,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:45,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:46,562 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:46,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068270221] [2021-05-02 23:17:46,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1068270221] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:46,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:46,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:17:46,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178373489] [2021-05-02 23:17:46,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:17:46,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:46,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:17:46,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:17:46,563 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:48,134 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-05-02 23:17:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:17:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-02 23:17:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:48,135 INFO L225 Difference]: With dead ends: 121 [2021-05-02 23:17:48,135 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:17:48,135 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 24 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1949.7ms TimeCoverageRelationStatistics Valid=268, Invalid=3392, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:17:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:17:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:17:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2021-05-02 23:17:48,146 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 59 [2021-05-02 23:17:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:48,146 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2021-05-02 23:17:48,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2021-05-02 23:17:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:17:48,146 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:48,147 INFO L523 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:48,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:17:48,147 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2064621346, now seen corresponding path program 23 times [2021-05-02 23:17:48,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:48,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171040590] [2021-05-02 23:17:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:48,153 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_746 2) 4294967296) 99) (= (mod v_main_~y~0_105 2) 0)) InVars {main_~x~0=v_main_~x~0_746, main_~y~0=v_main_~y~0_105} OutVars{main_~x~0=v_main_~x~0_746, main_~y~0=v_main_~y~0_105} AuxVars[] AssignedVars[] [2021-05-02 23:17:48,154 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:48,154 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:48,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:48,272 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:48,324 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:48,325 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_106 2) 0) (< (mod v_main_~x~0_748 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_748, main_~y~0=v_main_~y~0_106} OutVars{main_~x~0=v_main_~x~0_748, main_~y~0=v_main_~y~0_106} AuxVars[] AssignedVars[] [2021-05-02 23:17:48,326 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:48,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:48,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:48,475 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:48,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_107 2))) (< (mod v_main_~x~0_750 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_750, main_~y~0=v_main_~y~0_107} OutVars{main_~x~0=v_main_~x~0_750, main_~y~0=v_main_~y~0_107} AuxVars[] AssignedVars[] [2021-05-02 23:17:48,574 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:48,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:48,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:48,617 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:48,648 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:48,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:48,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:49,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:50,033 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:50,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171040590] [2021-05-02 23:17:50,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [171040590] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:50,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:50,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:17:50,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795698925] [2021-05-02 23:17:50,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:17:50,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:17:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:17:50,034 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:51,712 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-05-02 23:17:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:17:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-02 23:17:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:51,713 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:17:51,713 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:17:51,713 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2132.9ms TimeCoverageRelationStatistics Valid=335, Invalid=2971, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:17:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:17:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:17:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2021-05-02 23:17:51,724 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 59 [2021-05-02 23:17:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:51,724 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2021-05-02 23:17:51,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:17:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2021-05-02 23:17:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 23:17:51,725 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:51,725 INFO L523 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:51,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-02 23:17:51,725 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2082348379, now seen corresponding path program 24 times [2021-05-02 23:17:51,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:51,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371401478] [2021-05-02 23:17:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:51,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_108 2) 0) (< (mod (+ v_main_~x~0_778 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_778, main_~y~0=v_main_~y~0_108} OutVars{main_~x~0=v_main_~x~0_778, main_~y~0=v_main_~y~0_108} AuxVars[] AssignedVars[] [2021-05-02 23:17:51,731 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:51,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:51,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:51,869 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:51,934 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:51,935 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_780 4294967296) 99) (= (mod v_main_~y~0_109 2) 0)) InVars {main_~x~0=v_main_~x~0_780, main_~y~0=v_main_~y~0_109} OutVars{main_~x~0=v_main_~x~0_780, main_~y~0=v_main_~y~0_109} AuxVars[] AssignedVars[] [2021-05-02 23:17:51,937 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:51,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:52,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:52,051 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:52,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_782 4294967296) 99) (not (= (mod v_main_~y~0_110 2) 0))) InVars {main_~x~0=v_main_~x~0_782, main_~y~0=v_main_~y~0_110} OutVars{main_~x~0=v_main_~x~0_782, main_~y~0=v_main_~y~0_110} AuxVars[] AssignedVars[] [2021-05-02 23:17:52,150 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:52,162 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:52,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:52,195 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:52,238 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:52,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:52,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:53,599 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:53,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371401478] [2021-05-02 23:17:53,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1371401478] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:53,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:53,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:17:53,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693483991] [2021-05-02 23:17:53,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:17:53,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:17:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:17:53,600 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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-02 23:17:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:55,176 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2021-05-02 23:17:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:17:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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-02 23:17:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:55,179 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:17:55,180 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:17:55,180 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 25 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 2056.2ms TimeCoverageRelationStatistics Valid=348, Invalid=3192, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:17:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:17:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:17:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 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-02 23:17:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2021-05-02 23:17:55,217 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 61 [2021-05-02 23:17:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:55,219 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2021-05-02 23:17:55,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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-02 23:17:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2021-05-02 23:17:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:17:55,220 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:55,220 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:55,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:17:55,220 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -967186394, now seen corresponding path program 18 times [2021-05-02 23:17:55,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:55,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996094747] [2021-05-02 23:17:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:55,232 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_111 2) 0)) (< (mod (+ v_main_~x~0_811 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_811, main_~y~0=v_main_~y~0_111} OutVars{main_~x~0=v_main_~x~0_811, main_~y~0=v_main_~y~0_111} AuxVars[] AssignedVars[] [2021-05-02 23:17:55,233 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:17:55,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:55,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:17:55,274 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:17:55,299 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:55,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_813 4294967296) 99) (not (= (mod v_main_~y~0_112 2) 0))) InVars {main_~x~0=v_main_~x~0_813, main_~y~0=v_main_~y~0_112} OutVars{main_~x~0=v_main_~x~0_813, main_~y~0=v_main_~y~0_112} AuxVars[] AssignedVars[] [2021-05-02 23:17:55,302 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:55,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:55,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:55,340 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:55,365 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:55,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:56,884 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:17:56,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996094747] [2021-05-02 23:17:56,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1996094747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:17:56,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:17:56,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:17:56,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930470846] [2021-05-02 23:17:56,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:17:56,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:17:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:17:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:17:56,885 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 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-02 23:17:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:17:58,786 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2021-05-02 23:17:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:17:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 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-02 23:17:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:17:58,787 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:17:58,787 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:17:58,788 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2373.7ms TimeCoverageRelationStatistics Valid=233, Invalid=3549, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:17:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:17:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:17:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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-02 23:17:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2021-05-02 23:17:58,820 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 63 [2021-05-02 23:17:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:17:58,820 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2021-05-02 23:17:58,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 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-02 23:17:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2021-05-02 23:17:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:17:58,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:17:58,836 INFO L523 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:17:58,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-02 23:17:58,837 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:17:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:17:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1590603416, now seen corresponding path program 25 times [2021-05-02 23:17:58,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:17:58,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710758413] [2021-05-02 23:17:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:17:58,842 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 0 (mod v_main_~y~0_113 2)) (< (mod (+ v_main_~x~0_842 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_842, main_~y~0=v_main_~y~0_113} OutVars{main_~x~0=v_main_~x~0_842, main_~y~0=v_main_~y~0_113} AuxVars[] AssignedVars[] [2021-05-02 23:17:58,843 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:17:58,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:58,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:17:59,018 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:17:59,134 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:17:59,135 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:17:59,137 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_114 2) 0) (< (mod v_main_~x~0_844 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_844, main_~y~0=v_main_~y~0_114} OutVars{main_~x~0=v_main_~x~0_844, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:17:59,138 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:17:59,149 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:59,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:17:59,295 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:17:59,348 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_846 4294967296) 99) (not (= (mod v_main_~y~0_115 2) 0))) InVars {main_~x~0=v_main_~x~0_846, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_846, main_~y~0=v_main_~y~0_115} AuxVars[] AssignedVars[] [2021-05-02 23:17:59,349 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:17:59,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:17:59,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:17:59,390 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:17:59,417 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:17:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:59,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:17:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:17:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:17:59,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:17:59,700 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2021-05-02 23:17:59,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:01,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:01,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710758413] [2021-05-02 23:18:01,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1710758413] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:01,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:01,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:18:01,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544570889] [2021-05-02 23:18:01,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:18:01,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:18:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:18:01,007 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 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-02 23:18:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:02,888 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2021-05-02 23:18:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:18:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 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-02 23:18:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:02,889 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:18:02,889 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:18:02,890 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 5 SyntacticMatches, 26 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2428.2ms TimeCoverageRelationStatistics Valid=361, Invalid=3421, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:18:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:18:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-02 23:18:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2021-05-02 23:18:02,902 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 63 [2021-05-02 23:18:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:02,902 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2021-05-02 23:18:02,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 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-02 23:18:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2021-05-02 23:18:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:18:02,902 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:02,902 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:02,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:18:02,902 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -653964191, now seen corresponding path program 19 times [2021-05-02 23:18:02,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:02,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580089731] [2021-05-02 23:18:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:02,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_876 1) 4294967296) 99) (not (= (mod v_main_~y~0_116 2) 0))) InVars {main_~x~0=v_main_~x~0_876, main_~y~0=v_main_~y~0_116} OutVars{main_~x~0=v_main_~x~0_876, main_~y~0=v_main_~y~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:18:02,908 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:18:02,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:02,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:18:02,966 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:18:02,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:02,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_878 4294967296) 99) (not (= (mod v_main_~y~0_117 2) 0))) InVars {main_~x~0=v_main_~x~0_878, main_~y~0=v_main_~y~0_117} OutVars{main_~x~0=v_main_~x~0_878, main_~y~0=v_main_~y~0_117} AuxVars[] AssignedVars[] [2021-05-02 23:18:03,000 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:03,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:03,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:03,042 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:03,070 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:03,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:04,493 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:04,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580089731] [2021-05-02 23:18:04,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [580089731] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:04,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:04,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:18:04,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676015607] [2021-05-02 23:18:04,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:18:04,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:18:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:18:04,494 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:06,600 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2021-05-02 23:18:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:18:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 23:18:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:06,602 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:18:06,602 INFO L226 Difference]: Without dead ends: 121 [2021-05-02 23:18:06,602 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 27 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2455.3ms TimeCoverageRelationStatistics Valid=288, Invalid=3872, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:18:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-02 23:18:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-02 23:18:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 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-02 23:18:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2021-05-02 23:18:06,614 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 65 [2021-05-02 23:18:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:06,614 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2021-05-02 23:18:06,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2021-05-02 23:18:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:18:06,615 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:06,615 INFO L523 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:06,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-02 23:18:06,615 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1470096533, now seen corresponding path program 26 times [2021-05-02 23:18:06,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:06,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1161918898] [2021-05-02 23:18:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:06,621 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_118 2) 0) (< (mod (+ v_main_~x~0_908 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_908, main_~y~0=v_main_~y~0_118} OutVars{main_~x~0=v_main_~x~0_908, main_~y~0=v_main_~y~0_118} AuxVars[] AssignedVars[] [2021-05-02 23:18:06,622 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:06,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:06,707 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:06,751 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:06,811 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:06,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_910 4294967296) 99) (= (mod v_main_~y~0_119 2) 0)) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_119} OutVars{main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_119} AuxVars[] AssignedVars[] [2021-05-02 23:18:06,814 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:06,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:06,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:07,004 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:07,092 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_120 2) 0)) (< (mod v_main_~x~0_912 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_912, main_~y~0=v_main_~y~0_120} OutVars{main_~x~0=v_main_~x~0_912, main_~y~0=v_main_~y~0_120} AuxVars[] AssignedVars[] [2021-05-02 23:18:07,093 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:07,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:07,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:07,142 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:07,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:07,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:07,360 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:08,727 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:08,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1161918898] [2021-05-02 23:18:08,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1161918898] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:08,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:08,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:18:08,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295443648] [2021-05-02 23:18:08,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:18:08,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:18:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:18:08,728 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:10,779 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-05-02 23:18:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:18:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 23:18:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:10,780 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:18:10,780 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:18:10,780 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 27 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2580.4ms TimeCoverageRelationStatistics Valid=322, Invalid=3710, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:18:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:18:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:18:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 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-02 23:18:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2021-05-02 23:18:10,792 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 65 [2021-05-02 23:18:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:10,792 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2021-05-02 23:18:10,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2021-05-02 23:18:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:18:10,793 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:10,793 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:10,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:18:10,793 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -295137828, now seen corresponding path program 20 times [2021-05-02 23:18:10,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:10,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821321593] [2021-05-02 23:18:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:10,798 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_943 1) 4294967296) 99) (not (= (mod v_main_~y~0_121 2) 0))) InVars {main_~x~0=v_main_~x~0_943, main_~y~0=v_main_~y~0_121} OutVars{main_~x~0=v_main_~x~0_943, main_~y~0=v_main_~y~0_121} AuxVars[] AssignedVars[] [2021-05-02 23:18:10,799 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:18:10,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:10,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:18:10,844 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:18:10,878 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:10,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_945 4294967296) 99) (not (= (mod v_main_~y~0_122 2) 0))) InVars {main_~x~0=v_main_~x~0_945, main_~y~0=v_main_~y~0_122} OutVars{main_~x~0=v_main_~x~0_945, main_~y~0=v_main_~y~0_122} AuxVars[] AssignedVars[] [2021-05-02 23:18:10,880 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:10,898 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:10,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:10,940 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:10,970 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:11,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:12,351 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:12,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821321593] [2021-05-02 23:18:12,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1821321593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:12,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:12,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:18:12,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995594829] [2021-05-02 23:18:12,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:18:12,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:18:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:18:12,354 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 34 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-02 23:18:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:14,278 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2021-05-02 23:18:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:18:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 34 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-02 23:18:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:14,280 INFO L225 Difference]: With dead ends: 137 [2021-05-02 23:18:14,280 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 23:18:14,281 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 4 SyntacticMatches, 28 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2382.1ms TimeCoverageRelationStatistics Valid=306, Invalid=4386, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:18:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 23:18:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-02 23:18:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2021-05-02 23:18:14,295 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 67 [2021-05-02 23:18:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:14,295 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2021-05-02 23:18:14,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 34 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-02 23:18:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2021-05-02 23:18:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:18:14,295 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:14,295 INFO L523 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:14,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-02 23:18:14,295 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1627098962, now seen corresponding path program 27 times [2021-05-02 23:18:14,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:14,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610585594] [2021-05-02 23:18:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:14,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_976 2) 4294967296) 99) (= (mod v_main_~y~0_123 2) 0)) InVars {main_~x~0=v_main_~x~0_976, main_~y~0=v_main_~y~0_123} OutVars{main_~x~0=v_main_~x~0_976, main_~y~0=v_main_~y~0_123} AuxVars[] AssignedVars[] [2021-05-02 23:18:14,302 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:14,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:14,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:14,431 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:14,487 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:14,489 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_978 4294967296) 99) (= (mod v_main_~y~0_124 2) 0)) InVars {main_~x~0=v_main_~x~0_978, main_~y~0=v_main_~y~0_124} OutVars{main_~x~0=v_main_~x~0_978, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[] [2021-05-02 23:18:14,490 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:14,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:14,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:14,638 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:14,819 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:18:14,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_980 4294967296) 99) (not (= (mod v_main_~y~0_125 2) 0))) InVars {main_~x~0=v_main_~x~0_980, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_980, main_~y~0=v_main_~y~0_125} AuxVars[] AssignedVars[] [2021-05-02 23:18:14,833 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:14,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:14,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:14,879 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:14,917 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:15,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:15,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:16,722 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:16,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1610585594] [2021-05-02 23:18:16,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1610585594] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:16,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:16,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:18:16,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969844162] [2021-05-02 23:18:16,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:18:16,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:18:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:18:16,723 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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-02 23:18:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:18,893 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-05-02 23:18:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:18:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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-02 23:18:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:18,894 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:18:18,894 INFO L226 Difference]: Without dead ends: 129 [2021-05-02 23:18:18,895 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2806.6ms TimeCoverageRelationStatistics Valid=387, Invalid=3903, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:18:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-02 23:18:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-02 23:18:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2021-05-02 23:18:18,914 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 67 [2021-05-02 23:18:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:18,914 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2021-05-02 23:18:18,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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-02 23:18:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2021-05-02 23:18:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 23:18:18,915 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:18,915 INFO L523 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:18,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:18:18,915 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2112389425, now seen corresponding path program 28 times [2021-05-02 23:18:18,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:18,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734546625] [2021-05-02 23:18:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:18,920 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_126 2) 0) (< (mod (+ v_main_~x~0_1012 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1012, main_~y~0=v_main_~y~0_126} OutVars{main_~x~0=v_main_~x~0_1012, main_~y~0=v_main_~y~0_126} AuxVars[] AssignedVars[] [2021-05-02 23:18:18,921 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:18,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:19,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:19,068 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:19,139 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:19,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_127 2) 0) (< (mod v_main_~x~0_1014 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1014, main_~y~0=v_main_~y~0_127} OutVars{main_~x~0=v_main_~x~0_1014, main_~y~0=v_main_~y~0_127} AuxVars[] AssignedVars[] [2021-05-02 23:18:19,142 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:19,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:19,210 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:19,303 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:19,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1016 4294967296) 99) (not (= (mod v_main_~y~0_128 2) 0))) InVars {main_~x~0=v_main_~x~0_1016, main_~y~0=v_main_~y~0_128} OutVars{main_~x~0=v_main_~x~0_1016, main_~y~0=v_main_~y~0_128} AuxVars[] AssignedVars[] [2021-05-02 23:18:19,367 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:19,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:19,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:19,428 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:19,464 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:19,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:19,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:19,809 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2021-05-02 23:18:19,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:21,569 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:21,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734546625] [2021-05-02 23:18:21,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1734546625] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:21,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:21,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:18:21,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968390721] [2021-05-02 23:18:21,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:18:21,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:18:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:18:21,570 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 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-02 23:18:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:24,096 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2021-05-02 23:18:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:18:24,097 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 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-02 23:18:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:24,098 INFO L225 Difference]: With dead ends: 138 [2021-05-02 23:18:24,098 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:18:24,098 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 29 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 3232.4ms TimeCoverageRelationStatistics Valid=400, Invalid=4156, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:18:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:18:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-02 23:18:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2021-05-02 23:18:24,111 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 69 [2021-05-02 23:18:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:24,111 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2021-05-02 23:18:24,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 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-02 23:18:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2021-05-02 23:18:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:18:24,111 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:24,111 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:24,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-02 23:18:24,112 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2124507282, now seen corresponding path program 21 times [2021-05-02 23:18:24,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:24,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910206596] [2021-05-02 23:18:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:24,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1049 1) 4294967296) 99) (not (= (mod v_main_~y~0_129 2) 0))) InVars {main_~x~0=v_main_~x~0_1049, main_~y~0=v_main_~y~0_129} OutVars{main_~x~0=v_main_~x~0_1049, main_~y~0=v_main_~y~0_129} AuxVars[] AssignedVars[] [2021-05-02 23:18:24,118 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:18:24,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:24,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:18:24,165 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:18:24,196 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:24,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_130 2) 0)) (< (mod v_main_~x~0_1051 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1051, main_~y~0=v_main_~y~0_130} OutVars{main_~x~0=v_main_~x~0_1051, main_~y~0=v_main_~y~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:18:24,199 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:24,200 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:24,235 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:24,263 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:24,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:24,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:26,089 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:26,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910206596] [2021-05-02 23:18:26,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [910206596] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:26,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:26,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:18:26,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79032199] [2021-05-02 23:18:26,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:18:26,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:18:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:18:26,091 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:28,407 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2021-05-02 23:18:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:18:28,408 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-02 23:18:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:28,409 INFO L225 Difference]: With dead ends: 145 [2021-05-02 23:18:28,409 INFO L226 Difference]: Without dead ends: 135 [2021-05-02 23:18:28,409 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 30 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 2889.8ms TimeCoverageRelationStatistics Valid=325, Invalid=4931, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:18:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-02 23:18:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-02 23:18:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 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-02 23:18:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2021-05-02 23:18:28,423 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 71 [2021-05-02 23:18:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:28,423 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2021-05-02 23:18:28,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2021-05-02 23:18:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:18:28,423 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:28,423 INFO L523 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:28,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:18:28,424 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -873102580, now seen corresponding path program 29 times [2021-05-02 23:18:28,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:28,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [310305008] [2021-05-02 23:18:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:28,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1084 2) 4294967296) 99) (= (mod v_main_~y~0_131 2) 0)) InVars {main_~x~0=v_main_~x~0_1084, main_~y~0=v_main_~y~0_131} OutVars{main_~x~0=v_main_~x~0_1084, main_~y~0=v_main_~y~0_131} AuxVars[] AssignedVars[] [2021-05-02 23:18:28,431 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:28,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:28,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:28,715 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:28,773 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:28,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1086 4294967296) 99) (= (mod v_main_~y~0_132 2) 0)) InVars {main_~x~0=v_main_~x~0_1086, main_~y~0=v_main_~y~0_132} OutVars{main_~x~0=v_main_~x~0_1086, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:18:28,776 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:28,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:28,915 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:28,950 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:29,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_133 2) 0)) (< (mod v_main_~x~0_1088 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1088, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_1088, main_~y~0=v_main_~y~0_133} AuxVars[] AssignedVars[] [2021-05-02 23:18:29,022 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:29,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:29,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:29,075 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:29,107 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:29,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:29,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:29,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:30,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:30,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [310305008] [2021-05-02 23:18:30,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [310305008] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:30,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:30,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:18:30,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686723269] [2021-05-02 23:18:30,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:18:30,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:30,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:18:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:18:30,973 INFO L87 Difference]: Start difference. First operand 135 states and 138 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-02 23:18:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:33,726 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2021-05-02 23:18:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:18:33,727 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-02 23:18:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:33,728 INFO L225 Difference]: With dead ends: 144 [2021-05-02 23:18:33,728 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:18:33,728 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 5 SyntacticMatches, 30 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3134.8ms TimeCoverageRelationStatistics Valid=413, Invalid=4417, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:18:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:18:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-02 23:18:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2021-05-02 23:18:33,742 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 71 [2021-05-02 23:18:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:33,742 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2021-05-02 23:18:33,742 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-02 23:18:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2021-05-02 23:18:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:18:33,742 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:33,742 INFO L523 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:33,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-02 23:18:33,742 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 375614473, now seen corresponding path program 30 times [2021-05-02 23:18:33,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:33,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069402507] [2021-05-02 23:18:33,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:33,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_134 2) 0) (< (mod (+ v_main_~x~0_1122 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_134} OutVars{main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_134} AuxVars[] AssignedVars[] [2021-05-02 23:18:33,751 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:33,765 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:33,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:33,955 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:34,062 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:18:34,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:34,066 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_135 2) 0) (< (mod v_main_~x~0_1124 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1124, main_~y~0=v_main_~y~0_135} OutVars{main_~x~0=v_main_~x~0_1124, main_~y~0=v_main_~y~0_135} AuxVars[] AssignedVars[] [2021-05-02 23:18:34,068 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:34,082 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:34,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:34,246 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:34,337 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_136 2) 0)) (< (mod v_main_~x~0_1126 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1126, main_~y~0=v_main_~y~0_136} OutVars{main_~x~0=v_main_~x~0_1126, main_~y~0=v_main_~y~0_136} AuxVars[] AssignedVars[] [2021-05-02 23:18:34,339 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:34,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:34,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:34,401 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:34,442 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:34,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:34,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:36,494 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:36,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069402507] [2021-05-02 23:18:36,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1069402507] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:36,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:36,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:18:36,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540882932] [2021-05-02 23:18:36,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:18:36,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:18:36,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:18:36,509 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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-02 23:18:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:39,369 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2021-05-02 23:18:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:18:39,370 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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-02 23:18:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:39,371 INFO L225 Difference]: With dead ends: 146 [2021-05-02 23:18:39,371 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:18:39,371 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 31 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3375.4ms TimeCoverageRelationStatistics Valid=426, Invalid=4686, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:18:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:18:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-02 23:18:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 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-02 23:18:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2021-05-02 23:18:39,385 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 73 [2021-05-02 23:18:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:39,385 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2021-05-02 23:18:39,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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-02 23:18:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2021-05-02 23:18:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:18:39,385 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:39,385 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:39,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:18:39,386 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1021442120, now seen corresponding path program 22 times [2021-05-02 23:18:39,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:39,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158879473] [2021-05-02 23:18:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:39,391 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1161 1) 4294967296) 99) (not (= (mod v_main_~y~0_137 2) 0))) InVars {main_~x~0=v_main_~x~0_1161, main_~y~0=v_main_~y~0_137} OutVars{main_~x~0=v_main_~x~0_1161, main_~y~0=v_main_~y~0_137} AuxVars[] AssignedVars[] [2021-05-02 23:18:39,392 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:18:39,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:39,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:18:39,440 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:18:39,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:39,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_138 2) 0)) (< (mod v_main_~x~0_1163 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1163, main_~y~0=v_main_~y~0_138} OutVars{main_~x~0=v_main_~x~0_1163, main_~y~0=v_main_~y~0_138} AuxVars[] AssignedVars[] [2021-05-02 23:18:39,479 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:39,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:39,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:39,527 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:39,560 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:39,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:41,814 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:41,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158879473] [2021-05-02 23:18:41,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1158879473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:41,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:41,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:18:41,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104414724] [2021-05-02 23:18:41,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:18:41,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:18:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:18:41,815 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 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-02 23:18:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:45,103 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2021-05-02 23:18:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:18:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 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-02 23:18:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:45,107 INFO L225 Difference]: With dead ends: 148 [2021-05-02 23:18:45,107 INFO L226 Difference]: Without dead ends: 141 [2021-05-02 23:18:45,107 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 4 SyntacticMatches, 32 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3782.4ms TimeCoverageRelationStatistics Valid=281, Invalid=5121, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:18:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-02 23:18:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-02 23:18:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 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-02 23:18:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2021-05-02 23:18:45,121 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 75 [2021-05-02 23:18:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:45,121 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2021-05-02 23:18:45,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 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-02 23:18:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2021-05-02 23:18:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:18:45,121 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:45,122 INFO L523 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:45,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-02 23:18:45,122 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2096826822, now seen corresponding path program 31 times [2021-05-02 23:18:45,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:45,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574359913] [2021-05-02 23:18:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:45,127 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_139 2) 0) (< (mod (+ v_main_~x~0_1198 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1198, main_~y~0=v_main_~y~0_139} OutVars{main_~x~0=v_main_~x~0_1198, main_~y~0=v_main_~y~0_139} AuxVars[] AssignedVars[] [2021-05-02 23:18:45,128 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:45,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:45,335 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:18:45,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:45,472 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:45,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:45,547 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1200 4294967296) 99) (= (mod v_main_~y~0_140 2) 0)) InVars {main_~x~0=v_main_~x~0_1200, main_~y~0=v_main_~y~0_140} OutVars{main_~x~0=v_main_~x~0_1200, main_~y~0=v_main_~y~0_140} AuxVars[] AssignedVars[] [2021-05-02 23:18:45,548 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:45,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:45,669 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:18:45,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:45,752 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:45,912 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:18:45,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_141 2) 0)) (< (mod v_main_~x~0_1202 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1202, main_~y~0=v_main_~y~0_141} OutVars{main_~x~0=v_main_~x~0_1202, main_~y~0=v_main_~y~0_141} AuxVars[] AssignedVars[] [2021-05-02 23:18:45,917 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:45,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:45,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:45,970 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:46,014 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:46,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:46,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:18:48,213 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:48,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [574359913] [2021-05-02 23:18:48,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [574359913] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:48,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:48,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:18:48,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244473432] [2021-05-02 23:18:48,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:18:48,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:18:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:18:48,214 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 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-02 23:18:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:51,362 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-05-02 23:18:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:18:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 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-02 23:18:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:51,363 INFO L225 Difference]: With dead ends: 150 [2021-05-02 23:18:51,363 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:18:51,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 32 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 3693.4ms TimeCoverageRelationStatistics Valid=439, Invalid=4963, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:18:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:18:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-02 23:18:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2021-05-02 23:18:51,378 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 75 [2021-05-02 23:18:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:51,378 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2021-05-02 23:18:51,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 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-02 23:18:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2021-05-02 23:18:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:18:51,379 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:51,379 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:51,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:18:51,379 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash -842408957, now seen corresponding path program 23 times [2021-05-02 23:18:51,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:51,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1972553386] [2021-05-02 23:18:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:51,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_142 2))) (< (mod (+ v_main_~x~0_1238 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1238, main_~y~0=v_main_~y~0_142} OutVars{main_~x~0=v_main_~x~0_1238, main_~y~0=v_main_~y~0_142} AuxVars[] AssignedVars[] [2021-05-02 23:18:51,401 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:18:51,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:51,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:18:51,459 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:18:51,492 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:51,494 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1240 4294967296) 99) (not (= (mod v_main_~y~0_143 2) 0))) InVars {main_~x~0=v_main_~x~0_1240, main_~y~0=v_main_~y~0_143} OutVars{main_~x~0=v_main_~x~0_1240, main_~y~0=v_main_~y~0_143} AuxVars[] AssignedVars[] [2021-05-02 23:18:51,495 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:51,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:51,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:51,546 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:51,590 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:54,311 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:18:54,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1972553386] [2021-05-02 23:18:54,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1972553386] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:18:54,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:18:54,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:18:54,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228068044] [2021-05-02 23:18:54,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:18:54,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:18:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:18:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:18:54,312 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:18:57,835 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2021-05-02 23:18:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:18:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-02 23:18:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:18:57,837 INFO L225 Difference]: With dead ends: 152 [2021-05-02 23:18:57,837 INFO L226 Difference]: Without dead ends: 145 [2021-05-02 23:18:57,837 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 4 SyntacticMatches, 33 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 4380.9ms TimeCoverageRelationStatistics Valid=345, Invalid=5507, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:18:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-02 23:18:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-02 23:18:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 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-02 23:18:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2021-05-02 23:18:57,852 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 77 [2021-05-02 23:18:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:18:57,852 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2021-05-02 23:18:57,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:18:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2021-05-02 23:18:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:18:57,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:18:57,853 INFO L523 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:18:57,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-02 23:18:57,853 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:18:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:18:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1675482045, now seen corresponding path program 32 times [2021-05-02 23:18:57,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:18:57,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254598176] [2021-05-02 23:18:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:18:57,860 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_144 2) 0) (< (mod (+ v_main_~x~0_1276 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1276, main_~y~0=v_main_~y~0_144} OutVars{main_~x~0=v_main_~x~0_1276, main_~y~0=v_main_~y~0_144} AuxVars[] AssignedVars[] [2021-05-02 23:18:57,862 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:18:57,863 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:58,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:18:58,125 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:18:58,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:18:58,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 0 (mod v_main_~y~0_145 2)) (< (mod v_main_~x~0_1278 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1278, main_~y~0=v_main_~y~0_145} OutVars{main_~x~0=v_main_~x~0_1278, main_~y~0=v_main_~y~0_145} AuxVars[] AssignedVars[] [2021-05-02 23:18:58,232 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:18:58,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:58,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:18:58,402 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:18:58,551 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:18:58,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1280 4294967296) 99) (not (= (mod v_main_~y~0_146 2) 0))) InVars {main_~x~0=v_main_~x~0_1280, main_~y~0=v_main_~y~0_146} OutVars{main_~x~0=v_main_~x~0_1280, main_~y~0=v_main_~y~0_146} AuxVars[] AssignedVars[] [2021-05-02 23:18:58,555 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:18:58,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:18:58,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:18:58,603 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:18:58,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:18:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:58,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:18:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:18:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:18:58,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:19:01,401 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:01,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254598176] [2021-05-02 23:19:01,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [254598176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:01,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:01,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:19:01,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575910212] [2021-05-02 23:19:01,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:19:01,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:01,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:19:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:19:01,402 INFO L87 Difference]: Start difference. First operand 145 states and 148 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-02 23:19:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:04,915 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2021-05-02 23:19:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:19:04,916 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-02 23:19:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:04,917 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:19:04,917 INFO L226 Difference]: Without dead ends: 147 [2021-05-02 23:19:04,917 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 33 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 4354.0ms TimeCoverageRelationStatistics Valid=452, Invalid=5248, Unknown=0, NotChecked=0, Total=5700 [2021-05-02 23:19:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-02 23:19:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-02 23:19:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2021-05-02 23:19:04,931 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 77 [2021-05-02 23:19:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:04,931 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2021-05-02 23:19:04,931 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-02 23:19:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2021-05-02 23:19:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:19:04,932 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:04,932 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:04,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:19:04,932 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1001931522, now seen corresponding path program 24 times [2021-05-02 23:19:04,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:04,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420480428] [2021-05-02 23:19:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:04,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_147 2) 0)) (< (mod (+ v_main_~x~0_1317 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1317, main_~y~0=v_main_~y~0_147} OutVars{main_~x~0=v_main_~x~0_1317, main_~y~0=v_main_~y~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:19:04,939 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:19:04,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:05,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:19:05,053 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:19:05,094 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:05,096 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1319 4294967296) 99) (not (= (mod v_main_~y~0_148 2) 0))) InVars {main_~x~0=v_main_~x~0_1319, main_~y~0=v_main_~y~0_148} OutVars{main_~x~0=v_main_~x~0_1319, main_~y~0=v_main_~y~0_148} AuxVars[] AssignedVars[] [2021-05-02 23:19:05,097 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:05,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:05,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:05,159 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:05,199 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:05,359 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2021-05-02 23:19:05,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:07,865 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:07,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420480428] [2021-05-02 23:19:07,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [420480428] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:07,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:07,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:19:07,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247857361] [2021-05-02 23:19:07,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:19:07,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:19:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1668, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:19:07,867 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 40 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:11,584 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2021-05-02 23:19:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:19:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 40 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 23:19:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:11,585 INFO L225 Difference]: With dead ends: 161 [2021-05-02 23:19:11,586 INFO L226 Difference]: Without dead ends: 151 [2021-05-02 23:19:11,586 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 34 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 4475.8ms TimeCoverageRelationStatistics Valid=363, Invalid=6117, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:19:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-02 23:19:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-02 23:19:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 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-02 23:19:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2021-05-02 23:19:11,601 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 79 [2021-05-02 23:19:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:11,601 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2021-05-02 23:19:11,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 40 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2021-05-02 23:19:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:19:11,601 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:11,601 INFO L523 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:11,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-02 23:19:11,601 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1911905408, now seen corresponding path program 33 times [2021-05-02 23:19:11,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:11,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131822668] [2021-05-02 23:19:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:11,608 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_149 2) 0) (< (mod (+ v_main_~x~0_1356 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1356, main_~y~0=v_main_~y~0_149} OutVars{main_~x~0=v_main_~x~0_1356, main_~y~0=v_main_~y~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:19:11,609 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:19:11,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:11,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:19:11,738 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:19:11,845 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:19:11,847 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:11,864 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1358 4294967296) 99) (= (mod v_main_~y~0_150 2) 0)) InVars {main_~x~0=v_main_~x~0_1358, main_~y~0=v_main_~y~0_150} OutVars{main_~x~0=v_main_~x~0_1358, main_~y~0=v_main_~y~0_150} AuxVars[] AssignedVars[] [2021-05-02 23:19:11,865 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:19:11,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:12,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:19:12,114 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:19:12,306 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:19:12,309 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_151 2) 0)) (< (mod v_main_~x~0_1360 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1360, main_~y~0=v_main_~y~0_151} OutVars{main_~x~0=v_main_~x~0_1360, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[] [2021-05-02 23:19:12,310 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:12,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:12,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:12,365 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:12,411 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:19:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:12,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:12,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:19:12,847 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-05-02 23:19:12,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:19:15,893 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:15,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131822668] [2021-05-02 23:19:15,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131822668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:15,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:15,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:19:15,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449866780] [2021-05-02 23:19:15,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:19:15,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:19:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:19:15,895 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:20,162 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2021-05-02 23:19:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:19:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 23:19:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:20,164 INFO L225 Difference]: With dead ends: 160 [2021-05-02 23:19:20,164 INFO L226 Difference]: Without dead ends: 153 [2021-05-02 23:19:20,164 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 5 SyntacticMatches, 34 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 5310.8ms TimeCoverageRelationStatistics Valid=465, Invalid=5541, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:19:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-02 23:19:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-02 23:19:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2021-05-02 23:19:20,179 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 79 [2021-05-02 23:19:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:20,179 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2021-05-02 23:19:20,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2021-05-02 23:19:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:19:20,180 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:20,180 INFO L523 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:20,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-02 23:19:20,180 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1481490563, now seen corresponding path program 34 times [2021-05-02 23:19:20,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:20,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359275172] [2021-05-02 23:19:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:20,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_152 2) 0) (< (mod (+ v_main_~x~0_1398 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1398, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_1398, main_~y~0=v_main_~y~0_152} AuxVars[] AssignedVars[] [2021-05-02 23:19:20,194 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:19:20,195 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:20,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:19:20,362 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:19:20,438 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:20,440 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1400 4294967296) 99) (= (mod v_main_~y~0_153 2) 0)) InVars {main_~x~0=v_main_~x~0_1400, main_~y~0=v_main_~y~0_153} OutVars{main_~x~0=v_main_~x~0_1400, main_~y~0=v_main_~y~0_153} AuxVars[] AssignedVars[] [2021-05-02 23:19:20,441 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:19:20,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:20,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:19:20,577 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:19:20,690 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:19:20,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_154 2) 0)) (< (mod v_main_~x~0_1402 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1402, main_~y~0=v_main_~y~0_154} OutVars{main_~x~0=v_main_~x~0_1402, main_~y~0=v_main_~y~0_154} AuxVars[] AssignedVars[] [2021-05-02 23:19:20,694 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:20,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:20,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:20,773 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:20,822 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:19:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:21,023 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2021-05-02 23:19:21,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:21,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:19:24,143 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:24,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359275172] [2021-05-02 23:19:24,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1359275172] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:24,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:24,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:19:24,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577964718] [2021-05-02 23:19:24,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:19:24,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:19:24,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:19:24,144 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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-02 23:19:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:29,842 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2021-05-02 23:19:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:19:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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-02 23:19:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:29,844 INFO L225 Difference]: With dead ends: 162 [2021-05-02 23:19:29,845 INFO L226 Difference]: Without dead ends: 155 [2021-05-02 23:19:29,845 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 35 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 5823.4ms TimeCoverageRelationStatistics Valid=478, Invalid=5842, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 23:19:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-02 23:19:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-02 23:19:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2021-05-02 23:19:29,860 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 81 [2021-05-02 23:19:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:29,860 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2021-05-02 23:19:29,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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-02 23:19:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2021-05-02 23:19:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:19:29,861 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:29,861 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:29,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-02 23:19:29,861 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash -449825100, now seen corresponding path program 25 times [2021-05-02 23:19:29,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:29,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817909228] [2021-05-02 23:19:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:29,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_155 2) 0)) (< (mod (+ v_main_~x~0_1441 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1441, main_~y~0=v_main_~y~0_155} OutVars{main_~x~0=v_main_~x~0_1441, main_~y~0=v_main_~y~0_155} AuxVars[] AssignedVars[] [2021-05-02 23:19:29,870 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:19:29,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:29,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:19:29,942 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:19:29,996 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:29,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1443 4294967296) 99) (not (= (mod v_main_~y~0_156 2) 0))) InVars {main_~x~0=v_main_~x~0_1443, main_~y~0=v_main_~y~0_156} OutVars{main_~x~0=v_main_~x~0_1443, main_~y~0=v_main_~y~0_156} AuxVars[] AssignedVars[] [2021-05-02 23:19:30,001 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:30,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:30,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:30,082 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:30,132 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:30,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:33,843 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:33,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817909228] [2021-05-02 23:19:33,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1817909228] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:33,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:33,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:19:33,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364292583] [2021-05-02 23:19:33,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:19:33,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:19:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:19:33,844 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:40,056 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2021-05-02 23:19:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:19:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:19:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:40,058 INFO L225 Difference]: With dead ends: 164 [2021-05-02 23:19:40,058 INFO L226 Difference]: Without dead ends: 157 [2021-05-02 23:19:40,059 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 4 SyntacticMatches, 36 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 6409.1ms TimeCoverageRelationStatistics Valid=313, Invalid=6329, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 23:19:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-02 23:19:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-02 23:19:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2021-05-02 23:19:40,078 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 83 [2021-05-02 23:19:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:40,078 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2021-05-02 23:19:40,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2021-05-02 23:19:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:19:40,078 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:40,078 INFO L523 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:40,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:19:40,079 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash -169684934, now seen corresponding path program 35 times [2021-05-02 23:19:40,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:40,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116248978] [2021-05-02 23:19:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:40,086 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1482 2) 4294967296) 99) (= (mod v_main_~y~0_157 2) 0)) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_157} OutVars{main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_157} AuxVars[] AssignedVars[] [2021-05-02 23:19:40,088 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:19:40,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:40,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:19:40,316 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:19:40,412 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:40,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1484 4294967296) 99) (= (mod v_main_~y~0_158 2) 0)) InVars {main_~x~0=v_main_~x~0_1484, main_~y~0=v_main_~y~0_158} OutVars{main_~x~0=v_main_~x~0_1484, main_~y~0=v_main_~y~0_158} AuxVars[] AssignedVars[] [2021-05-02 23:19:40,416 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:19:40,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:40,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:19:40,676 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:19:40,837 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:19:40,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_159 2) 0)) (< (mod v_main_~x~0_1486 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1486, main_~y~0=v_main_~y~0_159} OutVars{main_~x~0=v_main_~x~0_1486, main_~y~0=v_main_~y~0_159} AuxVars[] AssignedVars[] [2021-05-02 23:19:40,843 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:40,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:40,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:40,913 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:40,961 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:19:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:41,238 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2021-05-02 23:19:41,395 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2021-05-02 23:19:41,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:41,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:19:45,058 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:45,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116248978] [2021-05-02 23:19:45,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1116248978] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:45,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:45,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:19:45,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764367034] [2021-05-02 23:19:45,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:19:45,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:19:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:19:45,059 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:19:51,285 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2021-05-02 23:19:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:19:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:19:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:19:51,289 INFO L225 Difference]: With dead ends: 166 [2021-05-02 23:19:51,289 INFO L226 Difference]: Without dead ends: 159 [2021-05-02 23:19:51,289 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 37 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 6711.2ms TimeCoverageRelationStatistics Valid=305, Invalid=6015, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 23:19:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-02 23:19:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-02 23:19:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2021-05-02 23:19:51,305 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 83 [2021-05-02 23:19:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:19:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2021-05-02 23:19:51,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:19:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2021-05-02 23:19:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:19:51,306 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:19:51,306 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:19:51,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-02 23:19:51,306 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:19:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:19:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1685966993, now seen corresponding path program 26 times [2021-05-02 23:19:51,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:19:51,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275509031] [2021-05-02 23:19:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:19:51,313 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_160 2) 0)) (< (mod (+ v_main_~x~0_1526 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1526, main_~y~0=v_main_~y~0_160} OutVars{main_~x~0=v_main_~x~0_1526, main_~y~0=v_main_~y~0_160} AuxVars[] AssignedVars[] [2021-05-02 23:19:51,315 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:19:51,340 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:51,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:19:51,407 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:19:51,471 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:51,473 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1528 4294967296) 99) (not (= (mod v_main_~y~0_161 2) 0))) InVars {main_~x~0=v_main_~x~0_1528, main_~y~0=v_main_~y~0_161} OutVars{main_~x~0=v_main_~x~0_1528, main_~y~0=v_main_~y~0_161} AuxVars[] AssignedVars[] [2021-05-02 23:19:51,475 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:19:51,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:19:51,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:19:51,563 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:19:51,622 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:19:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:51,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:19:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:19:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:19:56,186 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:19:56,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275509031] [2021-05-02 23:19:56,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [275509031] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:19:56,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:19:56,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:19:56,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579349385] [2021-05-02 23:19:56,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:19:56,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:19:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:19:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:19:56,187 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand has 45 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 43 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-02 23:20:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:20:03,127 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2021-05-02 23:20:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:20:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 43 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-02 23:20:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:20:03,130 INFO L225 Difference]: With dead ends: 168 [2021-05-02 23:20:03,130 INFO L226 Difference]: Without dead ends: 161 [2021-05-02 23:20:03,130 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 4 SyntacticMatches, 37 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 7495.2ms TimeCoverageRelationStatistics Valid=321, Invalid=6651, Unknown=0, NotChecked=0, Total=6972 [2021-05-02 23:20:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-02 23:20:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-02 23:20:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 164 transitions. [2021-05-02 23:20:03,147 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 164 transitions. Word has length 85 [2021-05-02 23:20:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:20:03,147 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 164 transitions. [2021-05-02 23:20:03,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 43 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-02 23:20:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2021-05-02 23:20:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:20:03,147 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:20:03,147 INFO L523 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:20:03,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-02 23:20:03,147 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:20:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:20:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2050106807, now seen corresponding path program 36 times [2021-05-02 23:20:03,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:20:03,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566189844] [2021-05-02 23:20:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:20:03,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 0 (mod v_main_~y~0_162 2)) (< (mod (+ v_main_~x~0_1568 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1568, main_~y~0=v_main_~y~0_162} OutVars{main_~x~0=v_main_~x~0_1568, main_~y~0=v_main_~y~0_162} AuxVars[] AssignedVars[] [2021-05-02 23:20:03,158 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:20:03,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:03,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:20:03,343 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:20:03,520 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:20:03,523 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:03,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_163 2) 0) (< (mod v_main_~x~0_1570 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1570, main_~y~0=v_main_~y~0_163} OutVars{main_~x~0=v_main_~x~0_1570, main_~y~0=v_main_~y~0_163} AuxVars[] AssignedVars[] [2021-05-02 23:20:03,528 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:20:03,547 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:03,726 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:20:03,797 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:20:03,896 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1572 4294967296) 99) (not (= (mod v_main_~y~0_164 2) 0))) InVars {main_~x~0=v_main_~x~0_1572, main_~y~0=v_main_~y~0_164} OutVars{main_~x~0=v_main_~x~0_1572, main_~y~0=v_main_~y~0_164} AuxVars[] AssignedVars[] [2021-05-02 23:20:03,898 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:20:03,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:03,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:20:04,005 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:20:04,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:20:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:04,269 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2021-05-02 23:20:04,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:20:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:20:04,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:20:09,227 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:20:09,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [566189844] [2021-05-02 23:20:09,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [566189844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:20:09,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:20:09,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:20:09,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072651986] [2021-05-02 23:20:09,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:20:09,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:20:09,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:20:09,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:20:09,228 INFO L87 Difference]: Start difference. First operand 161 states and 164 transitions. Second operand has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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-02 23:20:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:20:16,649 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2021-05-02 23:20:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:20:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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-02 23:20:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:20:16,652 INFO L225 Difference]: With dead ends: 170 [2021-05-02 23:20:16,652 INFO L226 Difference]: Without dead ends: 163 [2021-05-02 23:20:16,652 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 37 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 8275.4ms TimeCoverageRelationStatistics Valid=504, Invalid=6468, Unknown=0, NotChecked=0, Total=6972 [2021-05-02 23:20:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-02 23:20:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-02 23:20:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0253164556962024) internal successors, (162), 158 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 166 transitions. [2021-05-02 23:20:16,669 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 166 transitions. Word has length 85 [2021-05-02 23:20:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:20:16,669 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 166 transitions. [2021-05-02 23:20:16,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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-02 23:20:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 166 transitions. [2021-05-02 23:20:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:20:16,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:20:16,670 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:20:16,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-02 23:20:16,670 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:20:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:20:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 87614826, now seen corresponding path program 27 times [2021-05-02 23:20:16,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:20:16,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461216920] [2021-05-02 23:20:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:20:16,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_165 2) 0)) (< (mod (+ v_main_~x~0_1613 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1613, main_~y~0=v_main_~y~0_165} OutVars{main_~x~0=v_main_~x~0_1613, main_~y~0=v_main_~y~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:20:16,679 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:20:16,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:16,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:20:16,786 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:20:16,855 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:16,858 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1615 4294967296) 99) (not (= (mod v_main_~y~0_166 2) 0))) InVars {main_~x~0=v_main_~x~0_1615, main_~y~0=v_main_~y~0_166} OutVars{main_~x~0=v_main_~x~0_1615, main_~y~0=v_main_~y~0_166} AuxVars[] AssignedVars[] [2021-05-02 23:20:16,859 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:20:16,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:16,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:20:16,964 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:20:17,050 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:17,206 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2021-05-02 23:20:17,336 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 28 [2021-05-02 23:20:17,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:20:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:20:22,517 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:20:22,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461216920] [2021-05-02 23:20:22,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [461216920] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:20:22,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:20:22,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:20:22,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988076938] [2021-05-02 23:20:22,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:20:22,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:20:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:20:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2029, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:20:22,518 INFO L87 Difference]: Start difference. First operand 163 states and 166 transitions. Second operand has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 44 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-02 23:20:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:20:31,143 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2021-05-02 23:20:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:20:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 44 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-02 23:20:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:20:31,145 INFO L225 Difference]: With dead ends: 172 [2021-05-02 23:20:31,145 INFO L226 Difference]: Without dead ends: 165 [2021-05-02 23:20:31,146 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 4 SyntacticMatches, 38 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 9033.1ms TimeCoverageRelationStatistics Valid=329, Invalid=6981, Unknown=0, NotChecked=0, Total=7310 [2021-05-02 23:20:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-02 23:20:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-02 23:20:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.025) internal successors, (164), 160 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2021-05-02 23:20:31,162 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 87 [2021-05-02 23:20:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:20:31,162 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2021-05-02 23:20:31,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 44 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-02 23:20:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2021-05-02 23:20:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:20:31,163 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:20:31,163 INFO L523 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:20:31,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-02 23:20:31,163 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:20:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:20:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 671223796, now seen corresponding path program 37 times [2021-05-02 23:20:31,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:20:31,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68564877] [2021-05-02 23:20:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:20:31,171 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_167 2) 0) (< (mod (+ v_main_~x~0_1656 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1656, main_~y~0=v_main_~y~0_167} OutVars{main_~x~0=v_main_~x~0_1656, main_~y~0=v_main_~y~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:20:31,173 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:20:31,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:31,488 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 1 [2021-05-02 23:20:31,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:20:31,599 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:20:31,798 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:20:31,801 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:31,805 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1658 4294967296) 99) (= (mod v_main_~y~0_168 2) 0)) InVars {main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_168} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_168} AuxVars[] AssignedVars[] [2021-05-02 23:20:31,806 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:20:31,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:31,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:20:32,051 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:20:32,366 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:20:32,372 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_169 2) 0)) (< (mod v_main_~x~0_1660 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1660, main_~y~0=v_main_~y~0_169} OutVars{main_~x~0=v_main_~x~0_1660, main_~y~0=v_main_~y~0_169} AuxVars[] AssignedVars[] [2021-05-02 23:20:32,374 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:20:32,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:32,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:20:32,489 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:20:32,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:20:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:32,824 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2021-05-02 23:20:32,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:20:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:20:33,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:20:33,126 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 27 [2021-05-02 23:20:38,447 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:20:38,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68564877] [2021-05-02 23:20:38,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [68564877] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:20:38,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:20:38,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:20:38,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522421593] [2021-05-02 23:20:38,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:20:38,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:20:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:20:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1953, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:20:38,449 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 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-02 23:20:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:20:46,702 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2021-05-02 23:20:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:20:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 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-02 23:20:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:20:46,704 INFO L225 Difference]: With dead ends: 174 [2021-05-02 23:20:46,705 INFO L226 Difference]: Without dead ends: 167 [2021-05-02 23:20:46,705 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 5 SyntacticMatches, 38 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 9291.4ms TimeCoverageRelationStatistics Valid=517, Invalid=6793, Unknown=0, NotChecked=0, Total=7310 [2021-05-02 23:20:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-02 23:20:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-02 23:20:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0246913580246915) internal successors, (166), 162 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2021-05-02 23:20:46,722 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 87 [2021-05-02 23:20:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:20:46,722 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2021-05-02 23:20:46,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 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-02 23:20:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2021-05-02 23:20:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:20:46,722 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:20:46,723 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:20:46,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-02 23:20:46,723 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:20:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:20:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash -602273627, now seen corresponding path program 28 times [2021-05-02 23:20:46,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:20:46,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1427826658] [2021-05-02 23:20:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:20:46,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1702 1) 4294967296) 99) (not (= (mod v_main_~y~0_170 2) 0))) InVars {main_~x~0=v_main_~x~0_1702, main_~y~0=v_main_~y~0_170} OutVars{main_~x~0=v_main_~x~0_1702, main_~y~0=v_main_~y~0_170} AuxVars[] AssignedVars[] [2021-05-02 23:20:46,732 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:20:46,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:46,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:20:46,832 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:20:46,906 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:46,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_171 2) 0)) (< (mod v_main_~x~0_1704 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1704, main_~y~0=v_main_~y~0_171} OutVars{main_~x~0=v_main_~x~0_1704, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[] [2021-05-02 23:20:46,912 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:20:46,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:46,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:20:47,023 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:20:47,094 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:20:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:47,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:20:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:20:47,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-02 23:20:52,195 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:20:52,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1427826658] [2021-05-02 23:20:52,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1427826658] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:20:52,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:20:52,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:20:52,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037085034] [2021-05-02 23:20:52,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:20:52,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:20:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:20:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:20:52,197 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 45 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:20:59,779 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2021-05-02 23:20:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:20:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 45 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-02 23:20:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:20:59,783 INFO L225 Difference]: With dead ends: 176 [2021-05-02 23:20:59,783 INFO L226 Difference]: Without dead ends: 169 [2021-05-02 23:20:59,784 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 4 SyntacticMatches, 39 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 8385.6ms TimeCoverageRelationStatistics Valid=377, Invalid=7279, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:20:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-02 23:20:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-02 23:20:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.024390243902439) internal successors, (168), 164 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-02 23:20:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2021-05-02 23:20:59,803 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 89 [2021-05-02 23:20:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:20:59,804 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2021-05-02 23:20:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 45 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:20:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2021-05-02 23:20:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:20:59,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:20:59,804 INFO L523 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:20:59,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:20:59,804 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:20:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:20:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1585422607, now seen corresponding path program 38 times [2021-05-02 23:20:59,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:20:59,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125040727] [2021-05-02 23:20:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:20:59,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1746 2) 4294967296) 99) (= (mod v_main_~y~0_172 2) 0)) InVars {main_~x~0=v_main_~x~0_1746, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_1746, main_~y~0=v_main_~y~0_172} AuxVars[] AssignedVars[] [2021-05-02 23:20:59,815 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:20:59,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:20:59,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:21:00,093 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:21:00,280 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:21:00,283 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:00,287 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1748 4294967296) 99) (= (mod v_main_~y~0_173 2) 0)) InVars {main_~x~0=v_main_~x~0_1748, main_~y~0=v_main_~y~0_173} OutVars{main_~x~0=v_main_~x~0_1748, main_~y~0=v_main_~y~0_173} AuxVars[] AssignedVars[] [2021-05-02 23:21:00,289 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:21:00,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:00,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:21:00,577 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:21:00,717 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:21:00,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1750 4294967296) 99) (not (= (mod v_main_~y~0_174 2) 0))) InVars {main_~x~0=v_main_~x~0_1750, main_~y~0=v_main_~y~0_174} OutVars{main_~x~0=v_main_~x~0_1750, main_~y~0=v_main_~y~0_174} AuxVars[] AssignedVars[] [2021-05-02 23:21:00,726 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:21:00,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:00,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:21:00,848 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:21:00,924 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:21:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:01,221 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2021-05-02 23:21:01,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:21:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:21:01,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:21:07,050 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:21:07,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125040727] [2021-05-02 23:21:07,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1125040727] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:21:07,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:21:07,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:21:07,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824763584] [2021-05-02 23:21:07,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:21:07,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:21:07,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:21:07,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:21:07,051 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:21:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:21:16,717 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2021-05-02 23:21:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:21:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-02 23:21:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:21:16,721 INFO L225 Difference]: With dead ends: 178 [2021-05-02 23:21:16,721 INFO L226 Difference]: Without dead ends: 171 [2021-05-02 23:21:16,721 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 39 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 9995.3ms TimeCoverageRelationStatistics Valid=530, Invalid=7126, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:21:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-02 23:21:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-02 23:21:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 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-02 23:21:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2021-05-02 23:21:16,739 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 89 [2021-05-02 23:21:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:21:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2021-05-02 23:21:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:21:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2021-05-02 23:21:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:21:16,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:21:16,740 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:21:16,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-05-02 23:21:16,740 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:21:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:21:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2134853920, now seen corresponding path program 29 times [2021-05-02 23:21:16,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:21:16,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363667432] [2021-05-02 23:21:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:21:16,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_175 2) 0)) (< (mod (+ v_main_~x~0_1793 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1793, main_~y~0=v_main_~y~0_175} OutVars{main_~x~0=v_main_~x~0_1793, main_~y~0=v_main_~y~0_175} AuxVars[] AssignedVars[] [2021-05-02 23:21:16,751 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:21:16,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:16,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:21:16,869 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:21:16,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:16,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1795 4294967296) 99) (not (= (mod v_main_~y~0_176 2) 0))) InVars {main_~x~0=v_main_~x~0_1795, main_~y~0=v_main_~y~0_176} OutVars{main_~x~0=v_main_~x~0_1795, main_~y~0=v_main_~y~0_176} AuxVars[] AssignedVars[] [2021-05-02 23:21:16,955 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:21:16,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:17,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:21:17,095 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:21:17,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:17,347 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2021-05-02 23:21:17,472 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2021-05-02 23:21:17,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:21:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:21:24,012 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:21:24,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363667432] [2021-05-02 23:21:24,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [363667432] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:21:24,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:21:24,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:21:24,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036278186] [2021-05-02 23:21:24,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:21:24,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:21:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:21:24,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2213, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:21:24,013 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 46 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-02 23:21:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:21:34,994 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2021-05-02 23:21:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:21:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 46 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-02 23:21:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:21:34,998 INFO L225 Difference]: With dead ends: 180 [2021-05-02 23:21:34,998 INFO L226 Difference]: Without dead ends: 173 [2021-05-02 23:21:34,999 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 4 SyntacticMatches, 40 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 11236.7ms TimeCoverageRelationStatistics Valid=345, Invalid=7665, Unknown=0, NotChecked=0, Total=8010 [2021-05-02 23:21:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-02 23:21:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-02 23:21:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:21:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2021-05-02 23:21:35,017 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 91 [2021-05-02 23:21:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:21:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2021-05-02 23:21:35,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 46 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-02 23:21:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2021-05-02 23:21:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:21:35,018 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:21:35,018 INFO L523 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:21:35,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-02 23:21:35,018 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:21:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:21:35,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1264131410, now seen corresponding path program 39 times [2021-05-02 23:21:35,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:21:35,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770315393] [2021-05-02 23:21:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:21:35,028 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1838 2) 4294967296) 99) (= (mod v_main_~y~0_177 2) 0)) InVars {main_~x~0=v_main_~x~0_1838, main_~y~0=v_main_~y~0_177} OutVars{main_~x~0=v_main_~x~0_1838, main_~y~0=v_main_~y~0_177} AuxVars[] AssignedVars[] [2021-05-02 23:21:35,030 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:21:35,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:35,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:21:35,264 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:21:35,862 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:21:35,866 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:35,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1840 4294967296) 99) (= (mod v_main_~y~0_178 2) 0)) InVars {main_~x~0=v_main_~x~0_1840, main_~y~0=v_main_~y~0_178} OutVars{main_~x~0=v_main_~x~0_1840, main_~y~0=v_main_~y~0_178} AuxVars[] AssignedVars[] [2021-05-02 23:21:35,872 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:21:35,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:36,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:21:36,259 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:21:36,457 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:21:36,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_179 2) 0)) (< (mod v_main_~x~0_1842 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1842, main_~y~0=v_main_~y~0_179} OutVars{main_~x~0=v_main_~x~0_1842, main_~y~0=v_main_~y~0_179} AuxVars[] AssignedVars[] [2021-05-02 23:21:36,467 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:21:36,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:36,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:21:36,605 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:21:36,707 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:21:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:37,021 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 26 [2021-05-02 23:21:37,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:21:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:21:37,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:21:37,363 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2021-05-02 23:21:44,197 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:21:44,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770315393] [2021-05-02 23:21:44,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1770315393] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:21:44,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:21:44,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:21:44,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858017796] [2021-05-02 23:21:44,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:21:44,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:21:44,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:21:44,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2133, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:21:44,199 INFO L87 Difference]: Start difference. First operand 173 states and 176 transitions. Second operand has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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-02 23:21:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:21:56,389 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2021-05-02 23:21:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:21:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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-02 23:21:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:21:56,393 INFO L225 Difference]: With dead ends: 182 [2021-05-02 23:21:56,393 INFO L226 Difference]: Without dead ends: 175 [2021-05-02 23:21:56,393 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 5 SyntacticMatches, 40 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 12512.8ms TimeCoverageRelationStatistics Valid=543, Invalid=7467, Unknown=0, NotChecked=0, Total=8010 [2021-05-02 23:21:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-05-02 23:21:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-05-02 23:21:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.0235294117647058) internal successors, (174), 170 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:21:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 178 transitions. [2021-05-02 23:21:56,411 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 178 transitions. Word has length 91 [2021-05-02 23:21:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:21:56,411 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 178 transitions. [2021-05-02 23:21:56,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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-02 23:21:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 178 transitions. [2021-05-02 23:21:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:21:56,412 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:21:56,412 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:21:56,412 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-02 23:21:56,412 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:21:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:21:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -300525861, now seen corresponding path program 30 times [2021-05-02 23:21:56,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:21:56,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350381034] [2021-05-02 23:21:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:21:56,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1886 1) 4294967296) 99) (not (= (mod v_main_~y~0_180 2) 0))) InVars {main_~x~0=v_main_~x~0_1886, main_~y~0=v_main_~y~0_180} OutVars{main_~x~0=v_main_~x~0_1886, main_~y~0=v_main_~y~0_180} AuxVars[] AssignedVars[] [2021-05-02 23:21:56,426 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:21:56,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:56,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:21:56,567 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:21:56,670 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:56,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_181 2) 0)) (< (mod v_main_~x~0_1888 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1888, main_~y~0=v_main_~y~0_181} OutVars{main_~x~0=v_main_~x~0_1888, main_~y~0=v_main_~y~0_181} AuxVars[] AssignedVars[] [2021-05-02 23:21:56,677 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:21:56,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:21:56,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:21:56,831 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:21:56,934 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:21:56,938 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:21:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:57,117 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2021-05-02 23:21:57,251 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2021-05-02 23:21:57,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:21:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:21:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:22:04,456 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:22:04,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350381034] [2021-05-02 23:22:04,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [350381034] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:22:04,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:22:04,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:22:04,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875195403] [2021-05-02 23:22:04,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:22:04,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:22:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:22:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:22:04,458 INFO L87 Difference]: Start difference. First operand 175 states and 178 transitions. Second operand has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 47 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-02 23:22:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:22:15,719 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2021-05-02 23:22:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:22:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 47 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-02 23:22:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:22:15,726 INFO L225 Difference]: With dead ends: 184 [2021-05-02 23:22:15,726 INFO L226 Difference]: Without dead ends: 177 [2021-05-02 23:22:15,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 4 SyntacticMatches, 41 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 12211.8ms TimeCoverageRelationStatistics Valid=395, Invalid=7977, Unknown=0, NotChecked=0, Total=8372 [2021-05-02 23:22:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-02 23:22:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-05-02 23:22:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0232558139534884) internal successors, (176), 172 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:22:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2021-05-02 23:22:15,745 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 93 [2021-05-02 23:22:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:22:15,745 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2021-05-02 23:22:15,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 47 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-02 23:22:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2021-05-02 23:22:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:22:15,746 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:22:15,746 INFO L523 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:22:15,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:22:15,746 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:22:15,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:22:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1740936405, now seen corresponding path program 40 times [2021-05-02 23:22:15,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:22:15,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1737647136] [2021-05-02 23:22:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:22:15,759 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_182 2) 0) (< (mod (+ v_main_~x~0_1932 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1932, main_~y~0=v_main_~y~0_182} OutVars{main_~x~0=v_main_~x~0_1932, main_~y~0=v_main_~y~0_182} AuxVars[] AssignedVars[] [2021-05-02 23:22:15,762 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:22:15,765 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:22:16,077 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:22:16,300 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:22:16,595 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:22:16,601 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:22:16,607 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_183 2) 0) (< (mod v_main_~x~0_1934 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1934, main_~y~0=v_main_~y~0_183} OutVars{main_~x~0=v_main_~x~0_1934, main_~y~0=v_main_~y~0_183} AuxVars[] AssignedVars[] [2021-05-02 23:22:16,610 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:22:16,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:22:16,911 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:22:16,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:22:17,053 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:22:17,237 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:22:17,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_184 2) 0)) (< (mod v_main_~x~0_1936 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1936, main_~y~0=v_main_~y~0_184} OutVars{main_~x~0=v_main_~x~0_1936, main_~y~0=v_main_~y~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:22:17,253 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:22:17,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:22:17,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:22:17,400 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:22:17,514 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:22:17,518 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:22:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:22:17,681 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2021-05-02 23:22:17,944 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2021-05-02 23:22:18,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:22:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:22:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:22:18,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:22:18,593 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-05-02 23:22:18,821 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-05-02 23:22:18,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:22:27,099 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:22:27,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1737647136] [2021-05-02 23:22:27,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1737647136] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:22:27,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:22:27,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:22:27,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165730665] [2021-05-02 23:22:27,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:22:27,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:22:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:22:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:22:27,100 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 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-02 23:22:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:22:40,879 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2021-05-02 23:22:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:22:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 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-02 23:22:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:22:40,885 INFO L225 Difference]: With dead ends: 186 [2021-05-02 23:22:40,885 INFO L226 Difference]: Without dead ends: 179 [2021-05-02 23:22:40,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 5 SyntacticMatches, 41 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 14686.3ms TimeCoverageRelationStatistics Valid=556, Invalid=7816, Unknown=0, NotChecked=0, Total=8372 [2021-05-02 23:22:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-02 23:22:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-05-02 23:22:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.0229885057471264) internal successors, (178), 174 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:22:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 182 transitions. [2021-05-02 23:22:40,906 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 182 transitions. Word has length 93 [2021-05-02 23:22:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:22:40,906 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 182 transitions. [2021-05-02 23:22:40,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 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-02 23:22:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 182 transitions. [2021-05-02 23:22:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:22:40,906 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:22:40,906 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:22:40,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-02 23:22:40,907 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:22:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:22:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash 56680918, now seen corresponding path program 31 times [2021-05-02 23:22:40,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:22:40,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612464994] [2021-05-02 23:22:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:22:40,922 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1981 1) 4294967296) 99) (not (= (mod v_main_~y~0_185 2) 0))) InVars {main_~x~0=v_main_~x~0_1981, main_~y~0=v_main_~y~0_185} OutVars{main_~x~0=v_main_~x~0_1981, main_~y~0=v_main_~y~0_185} AuxVars[] AssignedVars[] [2021-05-02 23:22:40,925 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:22:40,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:22:40,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:22:41,087 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:22:41,210 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:22:41,214 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:22:41,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_186 2) 0)) (< (mod v_main_~x~0_1983 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_1983, main_~y~0=v_main_~y~0_186} OutVars{main_~x~0=v_main_~x~0_1983, main_~y~0=v_main_~y~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:22:41,221 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:22:41,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:22:41,280 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:22:41,396 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:22:41,520 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:22:41,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:22:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:22:41,755 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2021-05-02 23:22:42,014 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 26 [2021-05-02 23:22:42,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:22:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:22:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:22:42,256 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:22:50,576 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:22:50,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612464994] [2021-05-02 23:22:50,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1612464994] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:22:50,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:22:50,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:22:50,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513724918] [2021-05-02 23:22:50,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:22:50,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:22:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:22:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2384, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:22:50,577 INFO L87 Difference]: Start difference. First operand 179 states and 182 transitions. Second operand has 50 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:23:04,563 INFO L93 Difference]: Finished difference Result 193 states and 201 transitions. [2021-05-02 23:23:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:23:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-02 23:23:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:23:04,569 INFO L225 Difference]: With dead ends: 193 [2021-05-02 23:23:04,569 INFO L226 Difference]: Without dead ends: 183 [2021-05-02 23:23:04,570 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 42 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 14884.3ms TimeCoverageRelationStatistics Valid=439, Invalid=8873, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:23:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-05-02 23:23:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-05-02 23:23:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.0225988700564972) internal successors, (181), 177 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2021-05-02 23:23:04,597 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 95 [2021-05-02 23:23:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:23:04,597 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2021-05-02 23:23:04,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 48 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2021-05-02 23:23:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:23:04,597 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:23:04,598 INFO L523 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:23:04,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-02 23:23:04,598 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:23:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:23:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash -389035928, now seen corresponding path program 41 times [2021-05-02 23:23:04,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:23:04,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533415253] [2021-05-02 23:23:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:23:04,610 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2028 2) 4294967296) 99) (= (mod v_main_~y~0_187 2) 0)) InVars {main_~x~0=v_main_~x~0_2028, main_~y~0=v_main_~y~0_187} OutVars{main_~x~0=v_main_~x~0_2028, main_~y~0=v_main_~y~0_187} AuxVars[] AssignedVars[] [2021-05-02 23:23:04,613 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:23:04,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:04,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:23:05,002 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:23:05,225 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:23:05,229 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:23:05,235 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_188 2) 0) (< (mod v_main_~x~0_2030 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2030, main_~y~0=v_main_~y~0_188} OutVars{main_~x~0=v_main_~x~0_2030, main_~y~0=v_main_~y~0_188} AuxVars[] AssignedVars[] [2021-05-02 23:23:05,237 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:23:05,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:05,497 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:23:05,768 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-05-02 23:23:05,851 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:23:06,472 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:23:06,481 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2032 4294967296) 99) (not (= (mod v_main_~y~0_189 2) 0))) InVars {main_~x~0=v_main_~x~0_2032, main_~y~0=v_main_~y~0_189} OutVars{main_~x~0=v_main_~x~0_2032, main_~y~0=v_main_~y~0_189} AuxVars[] AssignedVars[] [2021-05-02 23:23:06,483 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:23:06,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:06,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:23:06,637 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:23:06,762 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:23:06,767 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:23:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:23:06,958 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2021-05-02 23:23:07,250 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2021-05-02 23:23:07,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:23:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:23:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:23:07,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:23:07,635 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2021-05-02 23:23:17,238 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:23:17,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533415253] [2021-05-02 23:23:17,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [533415253] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:23:17,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:23:17,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:23:17,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460933548] [2021-05-02 23:23:17,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:23:17,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:23:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:23:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2321, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:23:17,239 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:23:33,637 INFO L93 Difference]: Finished difference Result 191 states and 196 transitions. [2021-05-02 23:23:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:23:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-02 23:23:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:23:33,643 INFO L225 Difference]: With dead ends: 191 [2021-05-02 23:23:33,643 INFO L226 Difference]: Without dead ends: 184 [2021-05-02 23:23:33,644 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 5 SyntacticMatches, 42 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 17092.3ms TimeCoverageRelationStatistics Valid=569, Invalid=8173, Unknown=0, NotChecked=0, Total=8742 [2021-05-02 23:23:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-05-02 23:23:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-05-02 23:23:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.0223463687150838) internal successors, (183), 179 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2021-05-02 23:23:33,688 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 95 [2021-05-02 23:23:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:23:33,690 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2021-05-02 23:23:33,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:23:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2021-05-02 23:23:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-02 23:23:33,690 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:23:33,690 INFO L523 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:23:33,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-05-02 23:23:33,691 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:23:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:23:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1707199077, now seen corresponding path program 42 times [2021-05-02 23:23:33,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:23:33,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783415126] [2021-05-02 23:23:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:23:33,716 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2078 2) 4294967296) 99) (= (mod v_main_~y~0_190 2) 0)) InVars {main_~x~0=v_main_~x~0_2078, main_~y~0=v_main_~y~0_190} OutVars{main_~x~0=v_main_~x~0_2078, main_~y~0=v_main_~y~0_190} AuxVars[] AssignedVars[] [2021-05-02 23:23:33,719 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:23:33,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:33,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:23:34,158 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:23:34,678 WARN L205 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:23:34,683 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:23:34,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2080 4294967296) 99) (= (mod v_main_~y~0_191 2) 0)) InVars {main_~x~0=v_main_~x~0_2080, main_~y~0=v_main_~y~0_191} OutVars{main_~x~0=v_main_~x~0_2080, main_~y~0=v_main_~y~0_191} AuxVars[] AssignedVars[] [2021-05-02 23:23:34,692 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:23:34,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:34,991 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:23:35,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:23:35,202 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:23:35,433 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:23:35,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_192 2) 0)) (< (mod v_main_~x~0_2082 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2082, main_~y~0=v_main_~y~0_192} OutVars{main_~x~0=v_main_~x~0_2082, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[] [2021-05-02 23:23:35,454 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:23:35,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:23:35,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:23:35,680 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:23:35,816 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:23:35,821 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:23:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:23:36,045 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2021-05-02 23:23:36,311 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2021-05-02 23:23:36,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:23:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:23:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:23:36,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:23:36,890 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-05-02 23:23:37,154 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-05-02 23:23:37,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:23:48,119 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:23:48,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783415126] [2021-05-02 23:23:48,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1783415126] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:23:48,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:23:48,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:23:48,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616864017] [2021-05-02 23:23:48,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:23:48,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:23:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:23:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2418, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:23:48,120 INFO L87 Difference]: Start difference. First operand 184 states and 187 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-02 23:24:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:24:06,896 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2021-05-02 23:24:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:24:06,902 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-02 23:24:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:24:06,903 INFO L225 Difference]: With dead ends: 193 [2021-05-02 23:24:06,903 INFO L226 Difference]: Without dead ends: 186 [2021-05-02 23:24:06,904 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 5 SyntacticMatches, 43 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 19655.6ms TimeCoverageRelationStatistics Valid=582, Invalid=8538, Unknown=0, NotChecked=0, Total=9120 [2021-05-02 23:24:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-05-02 23:24:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-05-02 23:24:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:24:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2021-05-02 23:24:06,924 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 97 [2021-05-02 23:24:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:24:06,924 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2021-05-02 23:24:06,924 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-02 23:24:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2021-05-02 23:24:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:24:06,925 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:24:06,925 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:24:06,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-02 23:24:06,925 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:24:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:24:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -151310452, now seen corresponding path program 32 times [2021-05-02 23:24:06,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:24:06,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755808560] [2021-05-02 23:24:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:24:06,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_193 2))) (< (mod (+ v_main_~x~0_2129 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2129, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_2129, main_~y~0=v_main_~y~0_193} AuxVars[] AssignedVars[] [2021-05-02 23:24:06,940 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:24:06,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:24:07,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:24:07,150 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:24:07,320 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:24:07,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:24:07,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2131 4294967296) 99) (not (= (mod v_main_~y~0_194 2) 0))) InVars {main_~x~0=v_main_~x~0_2131, main_~y~0=v_main_~y~0_194} OutVars{main_~x~0=v_main_~x~0_2131, main_~y~0=v_main_~y~0_194} AuxVars[] AssignedVars[] [2021-05-02 23:24:07,336 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:24:07,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:24:07,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:24:07,552 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:24:07,712 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:24:07,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:24:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:24:08,112 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2021-05-02 23:24:08,486 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 26 [2021-05-02 23:24:08,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:24:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:24:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:24:08,794 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:24:19,959 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:24:19,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755808560] [2021-05-02 23:24:19,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1755808560] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:24:19,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:24:19,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:24:19,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111486852] [2021-05-02 23:24:19,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:24:19,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:24:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:24:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:24:19,960 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:24:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:24:38,811 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-05-02 23:24:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:24:38,816 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-02 23:24:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:24:38,817 INFO L225 Difference]: With dead ends: 201 [2021-05-02 23:24:38,817 INFO L226 Difference]: Without dead ends: 191 [2021-05-02 23:24:38,818 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 4 SyntacticMatches, 44 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2392 ImplicationChecksByTransitivity, 20030.2ms TimeCoverageRelationStatistics Valid=458, Invalid=9642, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:24:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-02 23:24:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-05-02 23:24:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:24:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 194 transitions. [2021-05-02 23:24:38,839 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 194 transitions. Word has length 99 [2021-05-02 23:24:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:24:38,839 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 194 transitions. [2021-05-02 23:24:38,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:24:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2021-05-02 23:24:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:24:38,840 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:24:38,840 INFO L523 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:24:38,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-02 23:24:38,840 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:24:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:24:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1849377058, now seen corresponding path program 43 times [2021-05-02 23:24:38,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:24:38,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073178000] [2021-05-02 23:24:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:24:38,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_195 2) 0) (< (mod (+ v_main_~x~0_2178 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2178, main_~y~0=v_main_~y~0_195} OutVars{main_~x~0=v_main_~x~0_2178, main_~y~0=v_main_~y~0_195} AuxVars[] AssignedVars[] [2021-05-02 23:24:38,882 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:24:38,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:24:38,997 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:24:39,105 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 1 [2021-05-02 23:24:39,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:24:39,414 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:24:39,713 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:24:39,720 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:24:39,727 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_196 2) 0) (< (mod v_main_~x~0_2180 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2180, main_~y~0=v_main_~y~0_196} OutVars{main_~x~0=v_main_~x~0_2180, main_~y~0=v_main_~y~0_196} AuxVars[] AssignedVars[] [2021-05-02 23:24:39,730 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:24:39,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:24:40,109 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:24:40,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:24:40,273 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-05-02 23:24:40,388 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:24:40,688 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:24:40,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_197 2) 0)) (< (mod v_main_~x~0_2182 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2182, main_~y~0=v_main_~y~0_197} OutVars{main_~x~0=v_main_~x~0_2182, main_~y~0=v_main_~y~0_197} AuxVars[] AssignedVars[] [2021-05-02 23:24:40,703 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:24:40,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:24:40,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:24:40,891 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:24:41,036 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:24:41,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:24:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:24:41,204 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2021-05-02 23:24:41,726 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2021-05-02 23:24:41,948 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 14 [2021-05-02 23:24:42,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:24:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:24:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:24:42,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:24:42,412 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 27 [2021-05-02 23:24:42,663 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-05-02 23:24:56,003 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:24:56,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073178000] [2021-05-02 23:24:56,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1073178000] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:24:56,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:24:56,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:24:56,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881274085] [2021-05-02 23:24:56,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:24:56,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:24:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:24:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2517, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:24:56,005 INFO L87 Difference]: Start difference. First operand 191 states and 194 transitions. Second operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:25:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:25:18,756 INFO L93 Difference]: Finished difference Result 200 states and 205 transitions. [2021-05-02 23:25:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:25:18,762 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-02 23:25:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:25:18,763 INFO L225 Difference]: With dead ends: 200 [2021-05-02 23:25:18,763 INFO L226 Difference]: Without dead ends: 193 [2021-05-02 23:25:18,764 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 5 SyntacticMatches, 44 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 23759.3ms TimeCoverageRelationStatistics Valid=595, Invalid=8911, Unknown=0, NotChecked=0, Total=9506 [2021-05-02 23:25:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-02 23:25:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-05-02 23:25:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.0212765957446808) internal successors, (192), 188 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:25:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2021-05-02 23:25:18,784 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 99 [2021-05-02 23:25:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:25:18,784 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2021-05-02 23:25:18,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:25:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2021-05-02 23:25:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:25:18,785 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:25:18,785 INFO L523 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:25:18,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:25:18,785 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:25:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:25:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1043463327, now seen corresponding path program 44 times [2021-05-02 23:25:18,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:25:18,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369606407] [2021-05-02 23:25:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:25:18,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_198 2) 0) (< (mod (+ v_main_~x~0_2230 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2230, main_~y~0=v_main_~y~0_198} OutVars{main_~x~0=v_main_~x~0_2230, main_~y~0=v_main_~y~0_198} AuxVars[] AssignedVars[] [2021-05-02 23:25:18,818 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:25:18,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:25:19,039 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:25:19,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:25:19,347 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:25:19,858 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:25:19,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:25:19,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2232 4294967296) 99) (= (mod v_main_~y~0_199 2) 0)) InVars {main_~x~0=v_main_~x~0_2232, main_~y~0=v_main_~y~0_199} OutVars{main_~x~0=v_main_~x~0_2232, main_~y~0=v_main_~y~0_199} AuxVars[] AssignedVars[] [2021-05-02 23:25:19,875 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:25:19,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:25:20,241 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:25:20,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:25:20,685 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:25:21,145 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:25:21,157 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2234 4294967296) 99) (not (= 0 (mod v_main_~y~0_200 2)))) InVars {main_~x~0=v_main_~x~0_2234, main_~y~0=v_main_~y~0_200} OutVars{main_~x~0=v_main_~x~0_2234, main_~y~0=v_main_~y~0_200} AuxVars[] AssignedVars[] [2021-05-02 23:25:21,160 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:25:21,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:25:21,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:25:21,383 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:25:21,533 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:25:21,540 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:25:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:25:21,811 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2021-05-02 23:25:22,218 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2021-05-02 23:25:22,378 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2021-05-02 23:25:22,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:25:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:25:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:25:22,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:25:23,026 WARN L205 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-05-02 23:25:23,356 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-05-02 23:25:23,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:25:38,219 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:25:38,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369606407] [2021-05-02 23:25:38,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [369606407] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:25:38,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:25:38,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:25:38,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498077696] [2021-05-02 23:25:38,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:25:38,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:25:38,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:25:38,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:25:38,221 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:25:59,302 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:25:59,952 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:26:00,554 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:26:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:26:03,503 INFO L93 Difference]: Finished difference Result 202 states and 207 transitions. [2021-05-02 23:26:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:26:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-02 23:26:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:26:03,512 INFO L225 Difference]: With dead ends: 202 [2021-05-02 23:26:03,512 INFO L226 Difference]: Without dead ends: 195 [2021-05-02 23:26:03,513 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 5 SyntacticMatches, 45 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 25990.3ms TimeCoverageRelationStatistics Valid=608, Invalid=9292, Unknown=0, NotChecked=0, Total=9900 [2021-05-02 23:26:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-05-02 23:26:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-05-02 23:26:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.0210526315789474) internal successors, (194), 190 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:26:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 198 transitions. [2021-05-02 23:26:03,535 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 198 transitions. Word has length 101 [2021-05-02 23:26:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:26:03,535 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 198 transitions. [2021-05-02 23:26:03,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:26:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2021-05-02 23:26:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:26:03,536 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:26:03,536 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:26:03,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-02 23:26:03,536 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:26:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:26:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash -726945214, now seen corresponding path program 33 times [2021-05-02 23:26:03,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:26:03,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766874088] [2021-05-02 23:26:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:26:03,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_201 2) 0)) (< (mod (+ v_main_~x~0_2283 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2283, main_~y~0=v_main_~y~0_201} OutVars{main_~x~0=v_main_~x~0_2283, main_~y~0=v_main_~y~0_201} AuxVars[] AssignedVars[] [2021-05-02 23:26:03,555 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:26:03,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:26:03,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:26:03,811 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:26:04,103 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:26:04,110 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:26:04,118 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_202 2) 0)) (< (mod v_main_~x~0_2285 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2285, main_~y~0=v_main_~y~0_202} OutVars{main_~x~0=v_main_~x~0_2285, main_~y~0=v_main_~y~0_202} AuxVars[] AssignedVars[] [2021-05-02 23:26:04,122 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:26:04,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:26:04,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:26:04,355 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:26:04,541 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:26:04,548 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:26:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:26:04,967 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-05-02 23:26:05,241 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2021-05-02 23:26:05,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:26:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:26:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:26:05,649 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:26:22,218 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:26:22,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766874088] [2021-05-02 23:26:22,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1766874088] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:26:22,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:26:22,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:26:22,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895556351] [2021-05-02 23:26:22,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:26:22,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:26:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:26:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2813, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:26:22,219 INFO L87 Difference]: Start difference. First operand 195 states and 198 transitions. Second operand has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 52 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-02 23:26:23,578 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:24,396 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:26:25,638 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:27,500 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:28,731 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:29,344 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:32,254 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:34,098 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:35,944 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:39,012 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:42,672 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:44,538 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:46,396 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:47,614 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:48,891 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:49,564 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:50,238 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:50,878 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:26:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:26:52,807 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2021-05-02 23:26:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:26:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 52 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-02 23:26:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:26:52,817 INFO L225 Difference]: With dead ends: 204 [2021-05-02 23:26:52,817 INFO L226 Difference]: Without dead ends: 197 [2021-05-02 23:26:52,818 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 4 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 28919.5ms TimeCoverageRelationStatistics Valid=393, Invalid=9909, Unknown=0, NotChecked=0, Total=10302 [2021-05-02 23:26:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-02 23:26:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-05-02 23:26:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.0208333333333333) internal successors, (196), 192 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:26:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-05-02 23:26:52,852 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 103 [2021-05-02 23:26:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:26:52,852 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-05-02 23:26:52,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 52 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-02 23:26:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-05-02 23:26:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:26:52,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:26:52,853 INFO L523 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:26:52,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-02 23:26:52,853 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:26:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:26:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash -345518884, now seen corresponding path program 45 times [2021-05-02 23:26:52,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:26:52,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733147802] [2021-05-02 23:26:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:26:52,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2334 2) 4294967296) 99) (= (mod v_main_~y~0_203 2) 0)) InVars {main_~x~0=v_main_~x~0_2334, main_~y~0=v_main_~y~0_203} OutVars{main_~x~0=v_main_~x~0_2334, main_~y~0=v_main_~y~0_203} AuxVars[] AssignedVars[] [2021-05-02 23:26:52,875 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:26:52,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:26:53,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:26:53,470 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:26:53,769 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:26:53,777 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:26:53,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2336 4294967296) 99) (= (mod v_main_~y~0_204 2) 0)) InVars {main_~x~0=v_main_~x~0_2336, main_~y~0=v_main_~y~0_204} OutVars{main_~x~0=v_main_~x~0_2336, main_~y~0=v_main_~y~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:26:53,788 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:26:53,843 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:26:54,030 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:26:54,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:26:54,375 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:26:54,864 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:26:54,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_205 2) 0)) (< (mod v_main_~x~0_2338 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2338, main_~y~0=v_main_~y~0_205} OutVars{main_~x~0=v_main_~x~0_2338, main_~y~0=v_main_~y~0_205} AuxVars[] AssignedVars[] [2021-05-02 23:26:54,895 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:26:54,898 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:26:54,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:26:55,160 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:26:55,362 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:26:55,370 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:26:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:26:55,788 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2021-05-02 23:26:56,446 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 30 [2021-05-02 23:26:56,915 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 22 [2021-05-02 23:26:57,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:26:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:26:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:26:57,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:26:57,422 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 27 [2021-05-02 23:27:14,818 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:27:14,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733147802] [2021-05-02 23:27:14,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [733147802] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:27:14,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:27:14,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:27:14,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174059243] [2021-05-02 23:27:14,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:27:14,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:27:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:27:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2721, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:27:14,820 INFO L87 Difference]: Start difference. First operand 197 states and 200 transitions. Second operand has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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-02 23:27:15,380 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-02 23:27:15,874 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:27:17,490 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:18,163 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:18,836 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:19,512 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:20,184 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:20,849 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:22,096 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:25,087 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:28,115 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:28,791 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:29,448 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:30,123 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:30,756 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:31,377 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:32,008 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:32,660 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:33,291 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:33,936 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:34,568 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:35,190 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:35,829 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:36,474 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:37,748 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:39,027 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:39,663 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:40,312 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:42,180 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:42,875 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:43,577 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:44,259 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:27:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:27:44,839 INFO L93 Difference]: Finished difference Result 206 states and 211 transitions. [2021-05-02 23:27:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:27:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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-02 23:27:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:27:44,849 INFO L225 Difference]: With dead ends: 206 [2021-05-02 23:27:44,849 INFO L226 Difference]: Without dead ends: 199 [2021-05-02 23:27:44,850 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 5 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 30832.5ms TimeCoverageRelationStatistics Valid=621, Invalid=9681, Unknown=0, NotChecked=0, Total=10302 [2021-05-02 23:27:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-05-02 23:27:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-05-02 23:27:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:27:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 202 transitions. [2021-05-02 23:27:44,908 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 202 transitions. Word has length 103 [2021-05-02 23:27:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:27:44,908 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 202 transitions. [2021-05-02 23:27:44,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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-02 23:27:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 202 transitions. [2021-05-02 23:27:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:27:44,908 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:27:44,909 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:27:44,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-05-02 23:27:44,909 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:27:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:27:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1710424195, now seen corresponding path program 34 times [2021-05-02 23:27:44,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:27:44,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1317891267] [2021-05-02 23:27:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:27:44,925 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2388 1) 4294967296) 99) (not (= (mod v_main_~y~0_206 2) 0))) InVars {main_~x~0=v_main_~x~0_2388, main_~y~0=v_main_~y~0_206} OutVars{main_~x~0=v_main_~x~0_2388, main_~y~0=v_main_~y~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:27:44,929 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:27:44,932 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:27:45,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:27:45,325 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:27:45,588 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:27:45,597 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:27:45,605 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2390 4294967296) 99) (not (= (mod v_main_~y~0_207 2) 0))) InVars {main_~x~0=v_main_~x~0_2390, main_~y~0=v_main_~y~0_207} OutVars{main_~x~0=v_main_~x~0_2390, main_~y~0=v_main_~y~0_207} AuxVars[] AssignedVars[] [2021-05-02 23:27:45,609 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:27:45,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:27:45,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:27:45,894 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:27:46,097 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:27:46,105 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:27:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:27:46,640 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-05-02 23:27:46,934 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2021-05-02 23:27:47,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:27:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:27:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:27:47,338 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:28:05,957 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:05,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1317891267] [2021-05-02 23:28:05,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1317891267] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:05,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:05,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:28:05,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220053375] [2021-05-02 23:28:05,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:28:05,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:28:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:28:05,958 INFO L87 Difference]: Start difference. First operand 199 states and 202 transitions. Second operand has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 53 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-02 23:28:07,300 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:08,124 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-05-02 23:28:08,822 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:09,566 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:10,284 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:10,954 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:11,633 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:12,319 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:12,998 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:13,672 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:14,347 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:15,029 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:15,700 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:16,373 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:17,041 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:17,704 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:19,615 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:20,269 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:25,144 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:26,413 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:27,078 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:30,101 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:32,540 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:33,186 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:34,390 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:28:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:38,067 INFO L93 Difference]: Finished difference Result 208 states and 214 transitions. [2021-05-02 23:28:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:28:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 53 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-02 23:28:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:38,076 INFO L225 Difference]: With dead ends: 208 [2021-05-02 23:28:38,076 INFO L226 Difference]: Without dead ends: 201 [2021-05-02 23:28:38,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 4 SyntacticMatches, 47 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 31655.2ms TimeCoverageRelationStatistics Valid=401, Invalid=10311, Unknown=0, NotChecked=0, Total=10712 [2021-05-02 23:28:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-05-02 23:28:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-05-02 23:28:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2021-05-02 23:28:38,107 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 105 [2021-05-02 23:28:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:38,107 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2021-05-02 23:28:38,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 53 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-02 23:28:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2021-05-02 23:28:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:28:38,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:38,108 INFO L523 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:38,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:28:38,108 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash 577405401, now seen corresponding path program 46 times [2021-05-02 23:28:38,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:38,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079294463] [2021-05-02 23:28:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:38,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_208 2) 0) (< (mod (+ v_main_~x~0_2440 2) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2440, main_~y~0=v_main_~y~0_208} OutVars{main_~x~0=v_main_~x~0_2440, main_~y~0=v_main_~y~0_208} AuxVars[] AssignedVars[] [2021-05-02 23:28:38,127 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:28:38,130 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:38,338 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:38,630 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 1 [2021-05-02 23:28:39,369 WARN L205 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 1 [2021-05-02 23:28:39,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:28:39,619 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:28:40,199 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:28:40,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:40,215 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2442 4294967296) 99) (= (mod v_main_~y~0_209 2) 0)) InVars {main_~x~0=v_main_~x~0_2442, main_~y~0=v_main_~y~0_209} OutVars{main_~x~0=v_main_~x~0_2442, main_~y~0=v_main_~y~0_209} AuxVars[] AssignedVars[] [2021-05-02 23:28:40,219 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:28:40,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:40,552 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:40,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:28:41,103 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:28:41,471 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:28:41,487 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2444 4294967296) 99) (not (= (mod v_main_~y~0_210 2) 0))) InVars {main_~x~0=v_main_~x~0_2444, main_~y~0=v_main_~y~0_210} OutVars{main_~x~0=v_main_~x~0_2444, main_~y~0=v_main_~y~0_210} AuxVars[] AssignedVars[] [2021-05-02 23:28:41,491 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:28:41,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:41,634 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:41,760 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:28:41,996 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:28:42,004 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:28:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:42,368 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2021-05-02 23:28:42,770 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2021-05-02 23:28:42,962 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 14 [2021-05-02 23:28:43,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:43,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-02 23:28:43,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:28:43,446 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 27 [2021-05-02 23:28:58,741 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:58,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079294463] [2021-05-02 23:28:58,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1079294463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:58,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:58,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:28:58,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689804754] [2021-05-02 23:28:58,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:28:58,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:28:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2826, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:28:58,742 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 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-02 23:29:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:24,785 INFO L93 Difference]: Finished difference Result 210 states and 215 transitions. [2021-05-02 23:29:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:29:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 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-02 23:29:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:24,793 INFO L225 Difference]: With dead ends: 210 [2021-05-02 23:29:24,793 INFO L226 Difference]: Without dead ends: 203 [2021-05-02 23:29:24,794 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 5 SyntacticMatches, 47 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 26537.0ms TimeCoverageRelationStatistics Valid=634, Invalid=10078, Unknown=0, NotChecked=0, Total=10712 [2021-05-02 23:29:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-05-02 23:29:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-05-02 23:29:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.02020202020202) internal successors, (202), 198 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 206 transitions. [2021-05-02 23:29:24,823 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 206 transitions. Word has length 105 [2021-05-02 23:29:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 206 transitions. [2021-05-02 23:29:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 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-02 23:29:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 206 transitions. [2021-05-02 23:29:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:29:24,823 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:24,823 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:24,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-02 23:29:24,824 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1940919816, now seen corresponding path program 35 times [2021-05-02 23:29:24,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:24,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371771127] [2021-05-02 23:29:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:24,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2495 1) 4294967296) 99) (not (= (mod v_main_~y~0_211 2) 0))) InVars {main_~x~0=v_main_~x~0_2495, main_~y~0=v_main_~y~0_211} OutVars{main_~x~0=v_main_~x~0_2495, main_~y~0=v_main_~y~0_211} AuxVars[] AssignedVars[] [2021-05-02 23:29:24,843 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:29:24,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:25,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:29:25,107 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:29:25,274 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:29:25,281 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:25,288 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= (mod v_main_~y~0_212 2) 0)) (< (mod v_main_~x~0_2497 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2497, main_~y~0=v_main_~y~0_212} OutVars{main_~x~0=v_main_~x~0_2497, main_~y~0=v_main_~y~0_212} AuxVars[] AssignedVars[] [2021-05-02 23:29:25,291 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:29:25,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:25,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:25,493 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:29:25,639 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:29:25,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:26,048 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-05-02 23:29:26,304 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2021-05-02 23:29:26,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:26,650 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:29:41,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:41,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371771127] [2021-05-02 23:29:41,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [371771127] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:41,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:41,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:29:41,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699042269] [2021-05-02 23:29:41,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:29:41,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:29:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3029, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:29:41,477 INFO L87 Difference]: Start difference. First operand 203 states and 206 transitions. Second operand has 56 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 54 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,850 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2021-05-02 23:30:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:30:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 54 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-02 23:30:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,858 INFO L225 Difference]: With dead ends: 212 [2021-05-02 23:30:06,858 INFO L226 Difference]: Without dead ends: 205 [2021-05-02 23:30:06,858 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 4 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 25209.2ms TimeCoverageRelationStatistics Valid=409, Invalid=10721, Unknown=0, NotChecked=0, Total=11130 [2021-05-02 23:30:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-02 23:30:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-05-02 23:30:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.02) internal successors, (204), 200 states have internal predecessors, (204), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2021-05-02 23:30:06,887 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 107 [2021-05-02 23:30:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,887 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2021-05-02 23:30:06,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 54 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2021-05-02 23:30:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:30:06,888 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:06,888 INFO L523 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:06,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-02 23:30:06,888 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1550586986, now seen corresponding path program 47 times [2021-05-02 23:30:06,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:06,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014756329] [2021-05-02 23:30:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:06,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2548 2) 4294967296) 99) (= (mod v_main_~y~0_213 2) 0)) InVars {main_~x~0=v_main_~x~0_2548, main_~y~0=v_main_~y~0_213} OutVars{main_~x~0=v_main_~x~0_2548, main_~y~0=v_main_~y~0_213} AuxVars[] AssignedVars[] [2021-05-02 23:30:06,905 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size [2021-05-02 23:30:06,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:07,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-05-02 23:30:07,427 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 79.2 percent of original size 76 [2021-05-02 23:30:07,929 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-05-02 23:30:07,935 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:07,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= (mod v_main_~y~0_214 2) 0) (< (mod v_main_~x~0_2550 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2550, main_~y~0=v_main_~y~0_214} OutVars{main_~x~0=v_main_~x~0_2550, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[] [2021-05-02 23:30:07,944 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size [2021-05-02 23:30:07,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:08,096 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 1 [2021-05-02 23:30:08,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-05-02 23:30:08,473 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.8 percent of original size 70 [2021-05-02 23:30:08,806 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-05-02 23:30:08,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2552 4294967296) 99) (not (= (mod v_main_~y~0_215 2) 0))) InVars {main_~x~0=v_main_~x~0_2552, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_2552, main_~y~0=v_main_~y~0_215} AuxVars[] AssignedVars[] [2021-05-02 23:30:08,822 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:30:08,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:08,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:09,032 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:30:09,200 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:30:09,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:30:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,423 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2021-05-02 23:30:09,755 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 26 [2021-05-02 23:30:09,967 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 14 [2021-05-02 23:30:10,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:10,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:10,430 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2021-05-02 23:30:25,269 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:25,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014756329] [2021-05-02 23:30:25,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014756329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:25,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:25,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:30:25,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697736181] [2021-05-02 23:30:25,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:30:25,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:30:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2933, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:30:25,271 INFO L87 Difference]: Start difference. First operand 205 states and 208 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-02 23:30:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:48,757 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2021-05-02 23:30:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:30:48,763 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-02 23:30:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:48,763 INFO L225 Difference]: With dead ends: 214 [2021-05-02 23:30:48,763 INFO L226 Difference]: Without dead ends: 207 [2021-05-02 23:30:48,764 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 5 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 24985.4ms TimeCoverageRelationStatistics Valid=647, Invalid=10483, Unknown=0, NotChecked=0, Total=11130 [2021-05-02 23:30:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-05-02 23:30:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-05-02 23:30:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.0198019801980198) internal successors, (206), 202 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 210 transitions. [2021-05-02 23:30:48,794 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 210 transitions. Word has length 107 [2021-05-02 23:30:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:48,794 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 210 transitions. [2021-05-02 23:30:48,794 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-02 23:30:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 210 transitions. [2021-05-02 23:30:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-02 23:30:48,795 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:48,795 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:48,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-02 23:30:48,795 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash -108912205, now seen corresponding path program 36 times [2021-05-02 23:30:48,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:48,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706392318] [2021-05-02 23:30:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:48,805 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 0 (mod v_main_~y~0_216 2))) (< (mod (+ v_main_~x~0_2604 1) 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_216} OutVars{main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_216} AuxVars[] AssignedVars[] [2021-05-02 23:30:48,807 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size [2021-05-02 23:30:48,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:48,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:30:49,017 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 78.5 percent of original size 73 [2021-05-02 23:30:49,179 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:30:49,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:49,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2606 4294967296) 99) (not (= (mod v_main_~y~0_217 2) 0))) InVars {main_~x~0=v_main_~x~0_2606, main_~y~0=v_main_~y~0_217} OutVars{main_~x~0=v_main_~x~0_2606, main_~y~0=v_main_~y~0_217} AuxVars[] AssignedVars[] [2021-05-02 23:30:49,193 WARN L240 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size [2021-05-02 23:30:49,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:49,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:49,390 WARN L245 tifierPushTermWalker]: treesize reduction 20, result has 77.0 percent of original size 67 [2021-05-02 23:30:49,544 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-05-02 23:30:49,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:49,860 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2021-05-02 23:30:50,081 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2021-05-02 23:30:50,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:50,389 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-05-02 23:31:05,752 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:05,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706392318] [2021-05-02 23:31:05,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1706392318] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:05,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:05,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:31:05,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814264772] [2021-05-02 23:31:05,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:31:05,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:31:05,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:31:05,754 INFO L87 Difference]: Start difference. First operand 207 states and 210 transitions. Second operand has 57 states, 56 states have (on average 1.875) internal successors, (105), 55 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)