/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/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:28:37,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:28:37,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:28:37,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:28:37,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:28:37,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:28:37,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:28:37,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:28:37,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:28:37,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:28:37,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:28:37,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:28:37,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:28:37,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:28:37,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:28:37,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:28:37,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:28:37,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:28:37,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:28:37,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:28:37,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:28:37,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:28:37,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:28:37,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:28:37,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:28:37,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:28:37,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:28:37,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:28:37,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:28:37,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:28:37,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:28:37,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:28:37,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:28:37,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:28:37,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:28:37,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:28:37,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:28:37,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:28:37,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:28:37,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:28:37,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:28:37,533 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:28:37,560 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:28:37,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:28:37,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:28:37,567 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:28:37,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:28:37,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:28:37,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:28:37,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:28:37,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:28:37,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:28:37,569 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:28:37,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:28:37,570 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:28:37,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:28:37,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:28:37,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:28:37,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:28:37,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:28:37,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:28:37,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:28:37,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:28:37,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:28:37,572 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:28:37,572 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:28:38,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:28:38,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:28:38,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:28:38,132 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:28:38,133 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:28:38,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2021-05-02 23:28:38,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dfb722a/ddc81f2df771412e978c71817d2c698a/FLAGdd023cb0b [2021-05-02 23:28:38,874 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:28:38,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2021-05-02 23:28:38,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dfb722a/ddc81f2df771412e978c71817d2c698a/FLAGdd023cb0b [2021-05-02 23:28:39,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dfb722a/ddc81f2df771412e978c71817d2c698a [2021-05-02 23:28:39,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:28:39,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:28:39,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:28:39,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:28:39,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:28:39,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a43b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39, skipping insertion in model container [2021-05-02 23:28:39,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:28:39,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:28:39,454 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/phases_1-2.c[322,335] [2021-05-02 23:28:39,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:28:39,480 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:28:39,492 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/phases_1-2.c[322,335] [2021-05-02 23:28:39,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:28:39,508 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:28:39,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39 WrapperNode [2021-05-02 23:28:39,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:28:39,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:28:39,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:28:39,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:28:39,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (1/1) ... [2021-05-02 23:28:39,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:28:39,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:28:39,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:28:39,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:28:39,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (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:28:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:28:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:28:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:28:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:28:39,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:28:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:28:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:28:39,691 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:28:39,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:28:39,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:28:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:28:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:28:39,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:28:39,973 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:28:39,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:28:39 BoogieIcfgContainer [2021-05-02 23:28:39,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:28:39,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:28:39,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:28:39,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:28:39,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:28:39" (1/3) ... [2021-05-02 23:28:39,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44761165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:28:39, skipping insertion in model container [2021-05-02 23:28:39,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:39" (2/3) ... [2021-05-02 23:28:39,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44761165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:28:39, skipping insertion in model container [2021-05-02 23:28:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:28:39" (3/3) ... [2021-05-02 23:28:40,000 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-2.c [2021-05-02 23:28:40,024 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:28:40,030 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:28:40,050 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:28:40,080 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:28:40,081 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:28:40,081 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:28:40,081 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:28:40,081 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:28:40,081 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:28:40,081 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:28:40,082 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:28:40,101 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:28:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:28:40,110 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:40,111 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:40,111 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2021-05-02 23:28:40,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:40,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095412073] [2021-05-02 23:28:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:40,190 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:28:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:40,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:40,435 INFO 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:40,437 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:40,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095412073] [2021-05-02 23:28:40,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2095412073] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:40,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:40,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:28:40,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296052424] [2021-05-02 23:28:40,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:28:40,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:28:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:28:40,461 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:28:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:40,560 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:28:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:28:40,563 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:28:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:40,569 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:28:40,569 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:28:40,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:28:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:28:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:28:40,612 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:28:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-02 23:28:40,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-02 23:28:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:40,615 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-02 23:28:40,615 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:28:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-02 23:28:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:28:40,617 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:40,617 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:40,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:28:40,618 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2021-05-02 23:28:40,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:40,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301282123] [2021-05-02 23:28:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:40,631 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:28:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:40,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:40,838 INFO 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:40,839 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:40,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301282123] [2021-05-02 23:28:40,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1301282123] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:40,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:40,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:28:40,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255740977] [2021-05-02 23:28:40,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:28:40,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:28:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:28:40,845 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:28:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:40,930 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-02 23:28:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:28:40,930 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:28:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:40,931 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:28:40,932 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:28:40,933 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:28:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:28:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:28:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-02 23:28:40,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-02 23:28:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:40,939 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-02 23:28:40,939 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:28:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-02 23:28:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:28:40,940 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:40,940 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:40,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:28:40,940 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2021-05-02 23:28:40,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:40,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645681460] [2021-05-02 23:28:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:40,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_11 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:28:41,026 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:41,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:41,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:41,167 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:41,204 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:41,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:41,323 INFO 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:41,415 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:41,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645681460] [2021-05-02 23:28:41,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1645681460] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:41,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:41,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:28:41,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193726247] [2021-05-02 23:28:41,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:28:41,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:28:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:28:41,418 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:41,554 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-02 23:28:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:28:41,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:28:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:41,556 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:28:41,556 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:28:41,557 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 178.9ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:28:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:28:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:28:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-02 23:28:41,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-02 23:28:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:41,569 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-02 23:28:41,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-02 23:28:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:28:41,570 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:41,571 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:41,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:28:41,571 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1162777244, now seen corresponding path program 2 times [2021-05-02 23:28:41,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:41,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269380524] [2021-05-02 23:28:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:41,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_15 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:28:41,594 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:41,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:41,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:41,691 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:41,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:41,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_17 4294967296) 65521) (< (mod (+ v_main_~x~0_17 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:28:41,760 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:41,765 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:41,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:45,823 WARN L205 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:46,435 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:28:48,515 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:28:48,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:48,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:48,717 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:48,768 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:48,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:48,958 INFO 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:49,062 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:49,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269380524] [2021-05-02 23:28:49,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [269380524] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:49,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:49,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:28:49,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047217318] [2021-05-02 23:28:49,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:28:49,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:28:49,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:28:49,065 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:49,285 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-02 23:28:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:28:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 23:28:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:49,290 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:28:49,290 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:28:49,291 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 258.2ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:28:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:28:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:28:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:28:49,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-02 23:28:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:49,302 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:28:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:28:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:28:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:28:49,306 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:49,306 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:49,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:28:49,307 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1812766649, now seen corresponding path program 3 times [2021-05-02 23:28:49,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:49,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972393027] [2021-05-02 23:28:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:49,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_22 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:28:49,328 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:49,331 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:49,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:49,429 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:49,462 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:49,468 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_24 1) 4294967296) 268435455) (< (mod v_main_~x~0_24 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:28:49,481 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:49,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:49,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:53,567 WARN L205 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:57,767 WARN L205 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:29:00,501 WARN L205 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:29:00,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:00,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:00,630 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:00,669 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:00,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:00,811 INFO 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:00,958 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:00,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972393027] [2021-05-02 23:29:00,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [972393027] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:00,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:00,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:29:00,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663607366] [2021-05-02 23:29:00,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:29:00,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:00,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:29:00,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:29:00,969 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:01,233 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:29:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:29:01,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:29:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:01,235 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:29:01,235 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:29:01,236 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 325.2ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:29:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:29:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:29:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-02 23:29:01,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-02 23:29:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:01,248 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-02 23:29:01,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-02 23:29:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:29:01,249 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:01,249 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:01,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:29:01,249 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -612640362, now seen corresponding path program 4 times [2021-05-02 23:29:01,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:01,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819414225] [2021-05-02 23:29:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:01,263 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_30 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:29:01,268 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:01,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:01,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:01,357 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:01,388 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:01,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_32 4294967296) 65521) (< (mod (+ v_main_~x~0_32 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:29:01,398 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:01,401 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:01,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:03,788 WARN L205 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:05,927 WARN L205 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:29:05,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:05,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:06,034 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:06,065 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:06,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:06,157 INFO 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:06,299 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:06,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819414225] [2021-05-02 23:29:06,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1819414225] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:06,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:06,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:29:06,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444004972] [2021-05-02 23:29:06,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:29:06,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:29:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:29:06,303 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:06,587 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:29:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:29:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 23:29:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:06,589 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:29:06,589 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:29:06,599 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 315.7ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:29:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:29:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:29:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-02 23:29:06,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-02 23:29:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:06,605 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-02 23:29:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-02 23:29:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:29:06,605 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:06,606 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:06,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:29:06,606 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash 738463795, now seen corresponding path program 5 times [2021-05-02 23:29:06,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:06,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [656814399] [2021-05-02 23:29:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:06,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_39 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:29:06,621 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:06,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:06,679 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:06,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:06,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_41 4294967296) 65521) (< (mod (+ v_main_~x~0_41 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:29:06,715 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:06,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,743 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,917 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:06,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:06,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:06,999 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:07,027 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:07,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:07,123 INFO 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:07,286 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:07,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [656814399] [2021-05-02 23:29:07,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [656814399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:07,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:07,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:29:07,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078868043] [2021-05-02 23:29:07,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:29:07,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:29:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:29:07,289 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:07,623 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-02 23:29:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:29:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 23:29:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:07,625 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:29:07,627 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:29:07,628 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 373.2ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:29:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:29:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:29:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:29:07,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-05-02 23:29:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:07,639 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:29:07,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:29:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:29:07,641 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:07,641 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:07,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:29:07,641 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2069435280, now seen corresponding path program 6 times [2021-05-02 23:29:07,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:07,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579436608] [2021-05-02 23:29:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:07,651 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_49 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:29:07,654 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:07,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:07,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:07,726 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:07,753 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:07,755 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_51 1) 4294967296) 268435455) (< (mod v_main_~x~0_51 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:29:07,769 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:07,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:07,809 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:07,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:07,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:08,023 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:08,053 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:08,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:08,172 INFO 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:08,360 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:08,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579436608] [2021-05-02 23:29:08,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [579436608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:08,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:08,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:29:08,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662183950] [2021-05-02 23:29:08,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:29:08,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:29:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:29:08,362 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:08,728 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-02 23:29:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:29:08,729 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 23:29:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:08,730 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:29:08,730 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:29:08,730 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 428.8ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:29:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:29:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:29:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:29:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-02 23:29:08,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-02 23:29:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:08,736 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-02 23:29:08,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-02 23:29:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:29:08,737 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:08,737 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:08,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:29:08,737 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1232778157, now seen corresponding path program 7 times [2021-05-02 23:29:08,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:08,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1960990517] [2021-05-02 23:29:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:08,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_60 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:29:08,749 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:08,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:08,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:08,794 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:08,817 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:08,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_62 1) 4294967296) 268435455) (< (mod v_main_~x~0_62 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_62} OutVars{main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:29:08,836 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:08,855 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:08,858 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:08,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:09,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:09,046 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:09,075 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:09,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:09,149 INFO 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:09,386 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:09,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1960990517] [2021-05-02 23:29:09,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1960990517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:09,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:09,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:29:09,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63616567] [2021-05-02 23:29:09,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:29:09,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:29:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:29:09,388 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:09,777 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-02 23:29:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:29:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-02 23:29:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:09,778 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:29:09,778 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:29:09,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 472.4ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:29:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:29:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:29:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-02 23:29:09,785 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-02 23:29:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:09,785 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-02 23:29:09,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-02 23:29:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:29:09,786 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:09,786 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:09,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:29:09,786 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 364167306, now seen corresponding path program 8 times [2021-05-02 23:29:09,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:09,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950161322] [2021-05-02 23:29:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:09,796 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_72 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:29:09,798 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:09,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:09,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:09,850 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:09,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:09,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_74 1) 4294967296) 268435455) (< (mod v_main_~x~0_74 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:29:09,904 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:09,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:09,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:09,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:10,003 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:10,061 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:10,089 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:10,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:10,429 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:10,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950161322] [2021-05-02 23:29:10,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [950161322] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:10,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:10,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:29:10,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646612158] [2021-05-02 23:29:10,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:29:10,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:29:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:29:10,431 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:10,860 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-02 23:29:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:29:10,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-02 23:29:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:10,861 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:29:10,861 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:29:10,862 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 490.0ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:29:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:29:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:29:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:29:10,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-02 23:29:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:10,867 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:29:10,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:29:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:29:10,868 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:10,868 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:10,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:29:10,868 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1147205081, now seen corresponding path program 9 times [2021-05-02 23:29:10,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:10,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481898616] [2021-05-02 23:29:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:10,877 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_85 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:29:10,878 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:10,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:10,899 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:10,942 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:10,962 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:10,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_87 4294967296) 65521) (< (mod (+ v_main_~x~0_87 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_87} OutVars{main_~x~0=v_main_~x~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:29:10,966 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:10,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:10,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:11,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:11,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:11,071 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:11,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:11,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:11,159 INFO 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:11,376 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:11,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481898616] [2021-05-02 23:29:11,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1481898616] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:11,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:11,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:29:11,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752240430] [2021-05-02 23:29:11,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:29:11,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:29:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:29:11,379 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:11,859 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:29:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:29:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-02 23:29:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:11,860 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:29:11,860 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:29:11,861 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 507.7ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:29:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:29:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:29:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 23:29:11,866 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-02 23:29:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:11,866 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 23:29:11,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 23:29:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:29:11,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:11,868 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:11,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:29:11,868 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1877122940, now seen corresponding path program 10 times [2021-05-02 23:29:11,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:11,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438248762] [2021-05-02 23:29:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:11,878 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_99 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:29:11,879 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:11,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:11,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:11,920 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:11,941 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:11,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_101 4294967296) 65521) (< (mod (+ v_main_~x~0_101 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_101} OutVars{main_~x~0=v_main_~x~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:29:11,946 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:11,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:11,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:12,384 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:12,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:12,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:12,481 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:12,504 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:12,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:12,568 INFO 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:12,836 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:12,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438248762] [2021-05-02 23:29:12,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [438248762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:12,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:12,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:29:12,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926685081] [2021-05-02 23:29:12,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:29:12,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:29:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:29:12,839 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:13,364 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:29:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:29:13,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-02 23:29:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:13,366 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:29:13,366 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:29:13,366 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 568.4ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:29:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:29:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:29:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-02 23:29:13,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-02 23:29:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:13,372 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-02 23:29:13,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-02 23:29:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:29:13,378 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:13,379 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:13,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:29:13,379 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1046451105, now seen corresponding path program 11 times [2021-05-02 23:29:13,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:13,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366165458] [2021-05-02 23:29:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:13,392 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_114 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_114} OutVars{main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:29:13,397 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:13,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:13,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:13,455 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:13,478 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:13,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_116 4294967296) 65521) (< (mod (+ v_main_~x~0_116 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_116} OutVars{main_~x~0=v_main_~x~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:29:13,482 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:13,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:13,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:14,151 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:14,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:14,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:14,226 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:14,250 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:14,325 INFO 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:14,619 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:14,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366165458] [2021-05-02 23:29:14,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [366165458] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:14,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:14,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:29:14,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943096399] [2021-05-02 23:29:14,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:29:14,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:29:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:29:14,621 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:15,455 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-02 23:29:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:29:15,456 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-02 23:29:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:15,457 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:29:15,457 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:29:15,458 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 740.2ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:29:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:29:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:29:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:29:15,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-02 23:29:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:15,464 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:29:15,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:29:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:29:15,465 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:15,466 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:15,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:29:15,466 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:15,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1692496766, now seen corresponding path program 12 times [2021-05-02 23:29:15,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:15,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743554468] [2021-05-02 23:29:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:15,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_130 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:29:15,478 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:15,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:15,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:15,541 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:15,570 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:15,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_132 1) 4294967296) 268435455) (< (mod v_main_~x~0_132 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:29:15,574 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:15,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:15,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:15,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:15,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:15,677 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:15,697 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:15,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:15,772 INFO 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:16,126 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:16,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743554468] [2021-05-02 23:29:16,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1743554468] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:16,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:16,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:29:16,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565681440] [2021-05-02 23:29:16,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:29:16,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:29:16,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:29:16,128 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:16,858 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:29:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:29:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-02 23:29:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:16,859 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:29:16,859 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:29:16,860 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 772.3ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:29:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:29:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-02 23:29:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-02 23:29:16,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-02 23:29:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-02 23:29:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-02 23:29:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:29:16,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:16,867 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:16,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:29:16,867 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash -227880933, now seen corresponding path program 13 times [2021-05-02 23:29:16,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:16,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640476679] [2021-05-02 23:29:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:16,876 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_147 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_147} OutVars{main_~x~0=v_main_~x~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:29:16,879 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:16,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:16,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:16,939 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:16,962 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:16,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_149 4294967296) 65521) (< (mod (+ v_main_~x~0_149 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_149} OutVars{main_~x~0=v_main_~x~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:29:16,966 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:16,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:16,969 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:17,720 WARN L205 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:17,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:17,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:17,853 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:17,882 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,970 INFO 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:18,400 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:18,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640476679] [2021-05-02 23:29:18,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1640476679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:18,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:18,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:29:18,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698265968] [2021-05-02 23:29:18,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:29:18,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:29:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:29:18,402 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:19,098 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:29:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:29:19,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-02 23:29:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:19,099 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:29:19,099 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:29:19,100 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 838.7ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:29:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:29:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-02 23:29:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-02 23:29:19,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-02 23:29:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:19,107 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-02 23:29:19,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-02 23:29:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:29:19,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:19,108 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:19,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:29:19,108 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:19,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1125087608, now seen corresponding path program 14 times [2021-05-02 23:29:19,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:19,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929801408] [2021-05-02 23:29:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:19,117 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_165 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:29:19,119 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:19,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:19,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:19,171 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:19,218 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:19,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_167 1) 4294967296) 268435455) (< (mod v_main_~x~0_167 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:29:19,223 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:19,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:19,226 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:19,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:19,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:19,402 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:19,424 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:19,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:19,496 INFO 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:20,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:20,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929801408] [2021-05-02 23:29:20,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [929801408] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:20,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:20,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:29:20,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045341440] [2021-05-02 23:29:20,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:29:20,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:29:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:29:20,030 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:21,145 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-02 23:29:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:29:21,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-02 23:29:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:21,147 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:29:21,147 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:29:21,148 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1168.9ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:29:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:29:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:29:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:29:21,154 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-02 23:29:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:29:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:29:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:29:21,155 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:21,155 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:21,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:29:21,155 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -47235179, now seen corresponding path program 15 times [2021-05-02 23:29:21,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:21,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735273490] [2021-05-02 23:29:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:21,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_184 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:29:21,167 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:21,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:21,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:21,229 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:21,267 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:21,269 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_186 4294967296) 65521) (< (mod (+ v_main_~x~0_186 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_186} OutVars{main_~x~0=v_main_~x~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:29:21,272 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:21,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:21,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:21,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:21,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:21,435 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:21,473 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:21,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:22,203 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:22,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735273490] [2021-05-02 23:29:22,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [735273490] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:22,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:22,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:29:22,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236815891] [2021-05-02 23:29:22,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:29:22,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:29:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:29:22,205 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:23,224 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-02 23:29:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:29:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-02 23:29:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:23,225 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:29:23,225 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:29:23,226 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1176.7ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:29:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:29:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:29:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-02 23:29:23,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-02 23:29:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:23,233 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-02 23:29:23,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-02 23:29:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:29:23,233 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:23,234 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:23,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:29:23,234 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1368001934, now seen corresponding path program 16 times [2021-05-02 23:29:23,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:23,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2100512161] [2021-05-02 23:29:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:23,242 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_204 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:29:23,244 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:23,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:23,297 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:23,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:23,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_206 1) 4294967296) 268435455) (< (mod v_main_~x~0_206 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_206} OutVars{main_~x~0=v_main_~x~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:29:23,340 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:23,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:23,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:23,485 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:23,509 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,580 INFO 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:24,041 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:24,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2100512161] [2021-05-02 23:29:24,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2100512161] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:24,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:24,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:29:24,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275938695] [2021-05-02 23:29:24,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:29:24,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:29:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:29:24,043 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:24,979 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-02 23:29:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:29:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-02 23:29:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:24,980 INFO L225 Difference]: With dead ends: 54 [2021-05-02 23:29:24,980 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:29:24,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 996.5ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:29:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:29:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:29:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-02 23:29:24,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-02 23:29:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:24,988 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-02 23:29:24,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-02 23:29:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:29:24,989 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:24,989 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:24,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:29:24,989 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 685466127, now seen corresponding path program 17 times [2021-05-02 23:29:24,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:24,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71503084] [2021-05-02 23:29:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:25,006 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_225 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-02 23:29:25,007 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:25,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:25,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:25,043 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:25,062 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:25,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_227 4294967296) 65521) (< (mod (+ v_main_~x~0_227 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-02 23:29:25,072 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:25,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:25,080 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:25,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:25,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:25,255 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:25,277 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:25,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:25,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:29:25,843 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:25,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71503084] [2021-05-02 23:29:25,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [71503084] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:25,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:25,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:29:25,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099837850] [2021-05-02 23:29:25,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:29:25,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:29:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:29:25,845 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:26,872 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-02 23:29:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:29:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-02 23:29:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:26,873 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:29:26,874 INFO L226 Difference]: Without dead ends: 49 [2021-05-02 23:29:26,874 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1055.5ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:29:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-02 23:29:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-02 23:29:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:29:26,880 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2021-05-02 23:29:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:26,880 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:29:26,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:29:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:29:26,881 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:26,881 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:26,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:29:26,882 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1616683412, now seen corresponding path program 18 times [2021-05-02 23:29:26,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:26,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802013170] [2021-05-02 23:29:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:26,890 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_247 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_247} OutVars{main_~x~0=v_main_~x~0_247} AuxVars[] AssignedVars[] [2021-05-02 23:29:26,891 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:26,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:26,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:26,932 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:26,964 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:26,966 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_249 4294967296) 65521) (< (mod (+ v_main_~x~0_249 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_249} OutVars{main_~x~0=v_main_~x~0_249} AuxVars[] AssignedVars[] [2021-05-02 23:29:26,967 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:26,969 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:26,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:27,319 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:27,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:27,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:27,419 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:27,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:27,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:28,095 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:28,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802013170] [2021-05-02 23:29:28,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1802013170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:28,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:28,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:29:28,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280191247] [2021-05-02 23:29:28,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:29:28,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:29:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:29:28,097 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:29,207 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:29:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:29:29,207 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-02 23:29:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:29,208 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:29:29,208 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:29:29,208 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1153.9ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:29:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:29:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:29:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-02 23:29:29,215 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-02 23:29:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:29,216 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-02 23:29:29,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-02 23:29:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:29:29,217 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:29,217 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:29,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:29:29,217 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2074232951, now seen corresponding path program 19 times [2021-05-02 23:29:29,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:29,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624559984] [2021-05-02 23:29:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:29,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_270 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:29:29,231 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:29,232 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:29,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:29,305 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:29,327 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:29,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_272 1) 4294967296) 268435455) (< (mod v_main_~x~0_272 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_272} OutVars{main_~x~0=v_main_~x~0_272} AuxVars[] AssignedVars[] [2021-05-02 23:29:29,341 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:29,343 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:29,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:29,600 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:29,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:29,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:29,674 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:29,699 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:29,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:29,776 INFO 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:30,346 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:30,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624559984] [2021-05-02 23:29:30,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [624559984] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:30,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:30,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:29:30,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461037724] [2021-05-02 23:29:30,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:29:30,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:30,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:29:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:29:30,347 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:31,440 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 23:29:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:29:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-02 23:29:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:31,441 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:29:31,442 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:29:31,442 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1173.9ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:29:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:29:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:29:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-02 23:29:31,448 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2021-05-02 23:29:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:31,448 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-02 23:29:31,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-02 23:29:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:29:31,449 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:31,449 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:31,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:29:31,449 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 602291558, now seen corresponding path program 20 times [2021-05-02 23:29:31,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:31,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433382872] [2021-05-02 23:29:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:31,459 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_294 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:29:31,461 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:31,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:31,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:31,520 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:31,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:31,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_296 4294967296) 65521) (< (mod (+ v_main_~x~0_296 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_296} OutVars{main_~x~0=v_main_~x~0_296} AuxVars[] AssignedVars[] [2021-05-02 23:29:31,558 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:31,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:31,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:31,767 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:31,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:31,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:31,841 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:31,863 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:31,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:31,937 INFO 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:32,861 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:32,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433382872] [2021-05-02 23:29:32,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1433382872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:32,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:32,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:29:32,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040406434] [2021-05-02 23:29:32,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:29:32,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:29:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:29:32,863 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:34,461 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-05-02 23:29:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:29:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-02 23:29:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:34,464 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:29:34,464 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:29:34,465 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1812.8ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:29:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:29:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:29:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:29:34,469 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2021-05-02 23:29:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:34,469 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:29:34,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:29:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:29:34,470 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:34,470 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:34,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:29:34,470 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 56934403, now seen corresponding path program 21 times [2021-05-02 23:29:34,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:34,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68435508] [2021-05-02 23:29:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:34,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_319 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-02 23:29:34,477 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:34,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:34,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:34,525 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:34,548 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:34,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_321 1) 4294967296) 268435455) (< (mod v_main_~x~0_321 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_321} OutVars{main_~x~0=v_main_~x~0_321} AuxVars[] AssignedVars[] [2021-05-02 23:29:34,560 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:34,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:34,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:34,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:34,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:34,697 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:34,720 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:34,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:34,787 INFO 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:35,508 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:35,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68435508] [2021-05-02 23:29:35,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [68435508] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:35,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:35,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:29:35,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846804202] [2021-05-02 23:29:35,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:29:35,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:35,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:29:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:29:35,510 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:36,750 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:29:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:29:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-02 23:29:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:36,751 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:29:36,751 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:29:36,751 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1388.2ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:29:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:29:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:29:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-02 23:29:36,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-02 23:29:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:36,766 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-02 23:29:36,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-02 23:29:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:29:36,767 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:36,768 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:36,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:29:36,768 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash -45281440, now seen corresponding path program 22 times [2021-05-02 23:29:36,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:36,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617449143] [2021-05-02 23:29:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:36,776 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_345 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_345} OutVars{main_~x~0=v_main_~x~0_345} AuxVars[] AssignedVars[] [2021-05-02 23:29:36,778 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:36,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:36,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:36,856 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:36,886 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:36,888 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_347 4294967296) 65521) (< (mod (+ v_main_~x~0_347 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_347} OutVars{main_~x~0=v_main_~x~0_347} AuxVars[] AssignedVars[] [2021-05-02 23:29:36,890 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:36,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:36,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:37,252 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:37,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:37,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:37,321 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:37,344 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:37,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:37,438 INFO 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:38,232 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:38,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617449143] [2021-05-02 23:29:38,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1617449143] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:38,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:38,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:29:38,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805701041] [2021-05-02 23:29:38,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:29:38,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:29:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:29:38,233 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:39,634 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:29:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:29:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-05-02 23:29:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:39,635 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:29:39,635 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:29:39,636 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1567.3ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:29:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:29:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:29:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-02 23:29:39,641 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-02 23:29:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:39,641 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-02 23:29:39,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-02 23:29:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:29:39,642 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:39,642 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:39,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:29:39,642 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash 509541245, now seen corresponding path program 23 times [2021-05-02 23:29:39,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:39,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602197316] [2021-05-02 23:29:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:39,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_372 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-02 23:29:39,649 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:39,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:39,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:39,691 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:39,716 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:39,717 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_374 1) 4294967296) 268435455) (< (mod v_main_~x~0_374 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_374} OutVars{main_~x~0=v_main_~x~0_374} AuxVars[] AssignedVars[] [2021-05-02 23:29:39,720 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:39,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:39,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:41,839 WARN L205 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:41,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:41,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:41,913 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:41,937 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:42,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:42,019 INFO 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:42,937 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:42,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602197316] [2021-05-02 23:29:42,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [602197316] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:42,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:42,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:29:42,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472102153] [2021-05-02 23:29:42,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:29:42,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:29:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:29:42,939 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:44,337 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-05-02 23:29:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:29:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-02 23:29:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:44,338 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:29:44,338 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:29:44,338 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1688.3ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:29:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:29:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:29:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:29:44,344 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2021-05-02 23:29:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:44,344 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:29:44,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:29:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:29:44,344 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:44,345 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:44,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:29:44,345 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1118196826, now seen corresponding path program 24 times [2021-05-02 23:29:44,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:44,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2064170049] [2021-05-02 23:29:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:44,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_400 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-02 23:29:44,353 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:44,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:44,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:44,402 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:44,425 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:44,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_402 1) 4294967296) 268435455) (< (mod v_main_~x~0_402 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-02 23:29:44,432 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:44,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:44,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:45,089 WARN L205 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:45,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:45,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:45,178 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:45,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:45,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:45,316 INFO 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:46,762 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:46,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2064170049] [2021-05-02 23:29:46,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2064170049] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:46,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:46,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:29:46,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310436753] [2021-05-02 23:29:46,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:29:46,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:29:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:29:46,765 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:48,723 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:29:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:29:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-02 23:29:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:48,724 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:29:48,724 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:29:48,724 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2505.2ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:29:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:29:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:29:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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:29:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-02 23:29:48,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-02 23:29:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:48,730 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-02 23:29:48,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-02 23:29:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 23:29:48,731 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:48,731 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:48,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:29:48,731 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1920657911, now seen corresponding path program 25 times [2021-05-02 23:29:48,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:48,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477415383] [2021-05-02 23:29:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:48,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_429 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_429} OutVars{main_~x~0=v_main_~x~0_429} AuxVars[] AssignedVars[] [2021-05-02 23:29:48,742 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:48,743 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:48,767 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:48,790 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:48,814 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:48,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_431 1) 4294967296) 268435455) (< (mod v_main_~x~0_431 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_431} OutVars{main_~x~0=v_main_~x~0_431} AuxVars[] AssignedVars[] [2021-05-02 23:29:48,817 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:48,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:48,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:48,957 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:48,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:49,000 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:49,041 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:49,066 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:49,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:49,128 INFO 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:50,353 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:50,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477415383] [2021-05-02 23:29:50,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [477415383] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:50,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:50,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:29:50,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756251304] [2021-05-02 23:29:50,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:29:50,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:29:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:29:50,354 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:52,209 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-05-02 23:29:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:29:52,210 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-02 23:29:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:52,210 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:29:52,210 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:29:52,211 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2167.8ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:29:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:29:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:29:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-02 23:29:52,216 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-02 23:29:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:52,216 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-02 23:29:52,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-02 23:29:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:29:52,217 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:52,217 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:52,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:29:52,217 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash -8352684, now seen corresponding path program 26 times [2021-05-02 23:29:52,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:52,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704377171] [2021-05-02 23:29:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:52,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_459 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-02 23:29:52,226 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:52,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:52,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:52,270 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:52,322 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:52,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_461 1) 4294967296) 268435455) (< (mod v_main_~x~0_461 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-02 23:29:52,326 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:52,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:52,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:52,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:52,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:52,463 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:52,486 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:52,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:52,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:29:53,562 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:53,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704377171] [2021-05-02 23:29:53,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [704377171] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:53,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:53,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:29:53,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588141123] [2021-05-02 23:29:53,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:29:53,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:29:53,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:29:53,563 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:55,248 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-02 23:29:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:29:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 23:29:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:55,249 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:29:55,249 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:29:55,250 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1886.7ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:29:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:29:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:29:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:29:55,254 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-02 23:29:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:55,255 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:29:55,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:29:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:29:55,255 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:55,255 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:55,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:29:55,256 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1638337393, now seen corresponding path program 27 times [2021-05-02 23:29:55,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:55,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552321192] [2021-05-02 23:29:55,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:55,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_490 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-02 23:29:55,270 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:55,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:55,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:55,321 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:55,350 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:55,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_492 4294967296) 65521) (< (mod (+ v_main_~x~0_492 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-02 23:29:55,354 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:55,376 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:55,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:55,674 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:55,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:55,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:55,793 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:55,822 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:55,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:55,894 INFO 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:57,015 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:57,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552321192] [2021-05-02 23:29:57,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1552321192] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:57,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:57,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:29:57,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329642505] [2021-05-02 23:29:57,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:29:57,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:29:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:29:57,016 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:58,905 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:29:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:29:58,906 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 23:29:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:58,906 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:29:58,907 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:29:58,908 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 7 SyntacticMatches, 28 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2110.7ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:29:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:29:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:29:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-02 23:29:58,913 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-02 23:29:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:58,913 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-02 23:29:58,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-02 23:29:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:29:58,914 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:58,914 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:58,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:29:58,914 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash -735430834, now seen corresponding path program 28 times [2021-05-02 23:29:58,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:58,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167176968] [2021-05-02 23:29:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:58,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_522 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-02 23:29:58,926 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:58,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:58,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:58,971 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:58,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:58,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_524 1) 4294967296) 268435455) (< (mod v_main_~x~0_524 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-02 23:29:58,996 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:59,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:59,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:59,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:59,075 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:59,100 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:59,129 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,191 INFO 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:00,344 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:00,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167176968] [2021-05-02 23:30:00,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [167176968] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:00,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:00,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:30:00,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164974451] [2021-05-02 23:30:00,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:30:00,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:30:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:30:00,346 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:03,997 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-02 23:30:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:30:03,997 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-02 23:30:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:03,998 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:30:03,998 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:30:03,999 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 29 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2981.9ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:30:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:30:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-02 23:30:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-02 23:30:04,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-02 23:30:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,005 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-02 23:30:04,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-02 23:30:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 23:30:04,006 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,006 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:30:04,006 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1299062805, now seen corresponding path program 29 times [2021-05-02 23:30:04,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160571354] [2021-05-02 23:30:04,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,019 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_555 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-02 23:30:04,022 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:04,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:04,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:04,087 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:04,113 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:04,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_557 4294967296) 65521) (< (mod (+ v_main_~x~0_557 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_557} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[] [2021-05-02 23:30:04,116 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:04,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:04,136 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:04,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:04,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:04,294 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:04,331 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,437 INFO 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:06,525 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:06,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160571354] [2021-05-02 23:30:06,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [160571354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:06,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:06,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:30:06,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21101859] [2021-05-02 23:30:06,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:30:06,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:30:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:30:06,527 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:11,179 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-02 23:30:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:30:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-02 23:30:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:11,180 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:30:11,180 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:30:11,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 4431.5ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:30:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:30:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-02 23:30:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:30:11,189 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-02 23:30:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:11,189 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:30:11,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:30:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:30:11,190 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:11,190 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:11,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-02 23:30:11,190 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1783507640, now seen corresponding path program 30 times [2021-05-02 23:30:11,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:11,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134320432] [2021-05-02 23:30:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:11,201 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_589 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-02 23:30:11,203 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:11,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:11,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:11,267 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:11,319 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:11,322 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_591 1) 4294967296) 268435455) (< (mod v_main_~x~0_591 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_591} OutVars{main_~x~0=v_main_~x~0_591} AuxVars[] AssignedVars[] [2021-05-02 23:30:11,324 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:11,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:11,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:12,284 WARN L205 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:30:12,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:12,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:12,377 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:12,415 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:12,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:12,539 INFO 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:13,885 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:13,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2134320432] [2021-05-02 23:30:13,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2134320432] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:13,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:13,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:30:13,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250745793] [2021-05-02 23:30:13,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:30:13,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:30:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:30:13,887 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:16,234 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:30:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:30:16,235 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-02 23:30:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:16,235 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:30:16,235 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:30:16,236 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2598.7ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:30:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:30:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:30:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-02 23:30:16,241 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-02 23:30:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:16,241 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-02 23:30:16,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-02 23:30:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:30:16,242 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:16,242 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:16,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:30:16,242 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash 816441189, now seen corresponding path program 31 times [2021-05-02 23:30:16,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:16,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465272656] [2021-05-02 23:30:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:16,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_624 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_624} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[] [2021-05-02 23:30:16,250 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:16,250 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:16,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:16,297 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:16,323 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:16,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_626 1) 4294967296) 268435455) (< (mod v_main_~x~0_626 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_626} OutVars{main_~x~0=v_main_~x~0_626} AuxVars[] AssignedVars[] [2021-05-02 23:30:16,325 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:16,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:16,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:16,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:16,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:16,453 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:16,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:16,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:18,137 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:18,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465272656] [2021-05-02 23:30:18,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [465272656] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:18,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:18,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:30:18,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980021776] [2021-05-02 23:30:18,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:30:18,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:30:18,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:30:18,138 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:22,343 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-02 23:30:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:30:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-02 23:30:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:22,344 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:30:22,344 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:30:22,345 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 7 SyntacticMatches, 32 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 3695.3ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:30:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:30:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:30:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-02 23:30:22,350 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-02 23:30:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:22,351 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-02 23:30:22,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-02 23:30:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:30:22,351 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:22,351 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:22,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-02 23:30:22,351 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash -303700414, now seen corresponding path program 32 times [2021-05-02 23:30:22,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:22,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315615523] [2021-05-02 23:30:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:22,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_660 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_660} OutVars{main_~x~0=v_main_~x~0_660} AuxVars[] AssignedVars[] [2021-05-02 23:30:22,362 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:22,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:22,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:22,425 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:22,498 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:22,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_662 4294967296) 65521) (< (mod (+ v_main_~x~0_662 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_662} OutVars{main_~x~0=v_main_~x~0_662} AuxVars[] AssignedVars[] [2021-05-02 23:30:22,503 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:22,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:22,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:22,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:22,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:22,642 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:22,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:22,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:22,760 INFO 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:24,391 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:24,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315615523] [2021-05-02 23:30:24,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [315615523] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:24,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:24,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:30:24,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350100097] [2021-05-02 23:30:24,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:30:24,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:24,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:30:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:30:24,393 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:27,268 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-02 23:30:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:30:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-05-02 23:30:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:27,270 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:30:27,270 INFO L226 Difference]: Without dead ends: 79 [2021-05-02 23:30:27,271 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3011.4ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:30:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-02 23:30:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-02 23:30:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:30:27,278 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-02 23:30:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:27,278 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:30:27,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:30:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:30:27,279 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:27,279 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:27,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-02 23:30:27,279 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1277010399, now seen corresponding path program 33 times [2021-05-02 23:30:27,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:27,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633954953] [2021-05-02 23:30:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:27,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_697 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_697} OutVars{main_~x~0=v_main_~x~0_697} AuxVars[] AssignedVars[] [2021-05-02 23:30:27,292 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:27,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:27,320 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:27,355 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:27,396 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:27,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_699 4294967296) 65521) (< (mod (+ v_main_~x~0_699 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-02 23:30:27,399 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:27,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:27,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:27,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:27,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:27,592 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:27,614 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:27,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:29,126 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:29,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633954953] [2021-05-02 23:30:29,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1633954953] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:29,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:29,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:30:29,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459538858] [2021-05-02 23:30:29,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:30:29,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:30:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:30:29,127 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:31,654 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:30:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:30:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-02 23:30:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:31,655 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:30:31,655 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:30:31,656 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 7 SyntacticMatches, 34 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2714.2ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:30:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:30:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:30:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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:30:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-02 23:30:31,662 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-02 23:30:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:31,662 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-02 23:30:31,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-02 23:30:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:30:31,663 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:31,663 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:31,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:30:31,663 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -78321092, now seen corresponding path program 34 times [2021-05-02 23:30:31,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:31,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545552288] [2021-05-02 23:30:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:31,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_735 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-02 23:30:31,669 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:31,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:31,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:31,712 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:31,738 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:31,739 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_737 4294967296) 65521) (< (mod (+ v_main_~x~0_737 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_737} OutVars{main_~x~0=v_main_~x~0_737} AuxVars[] AssignedVars[] [2021-05-02 23:30:31,741 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:31,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:31,743 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:32,133 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:32,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:32,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:32,224 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:32,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:32,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:32,308 INFO 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:33,907 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:33,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545552288] [2021-05-02 23:30:33,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [545552288] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:33,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:33,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:30:33,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453323239] [2021-05-02 23:30:33,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:30:33,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:30:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:30:33,909 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:36,681 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-02 23:30:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:30:36,681 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 23:30:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:36,682 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:30:36,682 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:30:36,683 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 7 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2981.2ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:30:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:30:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:30:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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:30:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-02 23:30:36,690 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 79 [2021-05-02 23:30:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:36,690 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-02 23:30:36,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-02 23:30:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:30:36,690 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:36,691 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:36,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-02 23:30:36,691 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:36,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1176793255, now seen corresponding path program 35 times [2021-05-02 23:30:36,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:36,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884907040] [2021-05-02 23:30:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:36,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_774 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-02 23:30:36,701 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:36,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:36,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:36,762 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:36,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:36,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_776 4294967296) 65521) (< (mod (+ v_main_~x~0_776 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_776} OutVars{main_~x~0=v_main_~x~0_776} AuxVars[] AssignedVars[] [2021-05-02 23:30:36,792 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:36,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:36,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:36,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:36,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:36,974 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:37,009 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:37,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:38,770 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:38,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884907040] [2021-05-02 23:30:38,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1884907040] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:38,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:38,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:30:38,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530051328] [2021-05-02 23:30:38,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:30:38,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:38,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:30:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:30:38,772 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:43,037 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-05-02 23:30:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:30:43,038 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 23:30:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:43,039 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:30:43,039 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:30:43,039 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 6 SyntacticMatches, 37 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 3767.3ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:30:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:30:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:30:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:30:43,046 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-02 23:30:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:43,047 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:30:43,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:30:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:30:43,047 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:43,047 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:43,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:30:43,047 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -246587082, now seen corresponding path program 36 times [2021-05-02 23:30:43,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:43,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721842118] [2021-05-02 23:30:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:43,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_814 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-02 23:30:43,056 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:43,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:43,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:43,099 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:43,134 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:43,136 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_816 4294967296) 65521) (< (mod (+ v_main_~x~0_816 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_816} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[] [2021-05-02 23:30:43,138 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:43,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:43,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:43,601 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:30:43,634 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:43,643 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:43,690 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:43,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:43,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:43,792 INFO 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:45,533 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:45,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721842118] [2021-05-02 23:30:45,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [721842118] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:45,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:45,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:30:45,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213802928] [2021-05-02 23:30:45,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:30:45,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:30:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:30:45,536 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:48,880 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:30:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:30:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:30:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:48,882 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:30:48,882 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:30:48,883 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 3403.0ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:30:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:30:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:30:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-02 23:30:48,889 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-02 23:30:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:48,889 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-02 23:30:48,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-02 23:30:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:30:48,890 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:48,890 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:48,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-02 23:30:48,891 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash 328347603, now seen corresponding path program 37 times [2021-05-02 23:30:48,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:48,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [424637234] [2021-05-02 23:30:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:48,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_855 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-02 23:30:48,901 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:48,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:48,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:48,991 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:49,026 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:49,029 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_857 1) 4294967296) 268435455) (< (mod v_main_~x~0_857 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-02 23:30:49,031 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:49,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:49,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:49,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:49,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:49,167 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:49,195 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:49,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:49,285 INFO 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:51,198 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:51,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [424637234] [2021-05-02 23:30:51,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [424637234] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:51,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:51,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:30:51,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609851115] [2021-05-02 23:30:51,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:30:51,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:30:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:30:51,199 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:54,671 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-02 23:30:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:30:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-05-02 23:30:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:54,672 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:30:54,672 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:30:54,673 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3633.7ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:30:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:30:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:30:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-02 23:30:54,680 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-02 23:30:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:54,680 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-02 23:30:54,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-02 23:30:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:30:54,681 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:54,681 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:54,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-02 23:30:54,681 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1210201296, now seen corresponding path program 38 times [2021-05-02 23:30:54,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:54,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24153334] [2021-05-02 23:30:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:54,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_897 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-02 23:30:54,690 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:54,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:54,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:54,744 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:54,768 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:54,769 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_899 4294967296) 65521) (< (mod (+ v_main_~x~0_899 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_899} OutVars{main_~x~0=v_main_~x~0_899} AuxVars[] AssignedVars[] [2021-05-02 23:30:54,771 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:54,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:54,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:56,787 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:30:57,041 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:57,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:57,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:57,125 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:57,151 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:57,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:57,228 INFO 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:59,407 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:59,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24153334] [2021-05-02 23:30:59,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [24153334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:59,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:59,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:30:59,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147312449] [2021-05-02 23:30:59,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:30:59,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:59,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:30:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:30:59,408 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:02,857 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-02 23:31:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:31:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-02 23:31:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:02,858 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:31:02,858 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:31:02,859 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3863.6ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:31:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:31:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:31:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:31:02,864 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-02 23:31:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:02,864 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:31:02,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:31:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:31:02,865 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:02,865 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:02,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:31:02,865 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2008023885, now seen corresponding path program 39 times [2021-05-02 23:31:02,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:02,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063829974] [2021-05-02 23:31:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:02,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_940 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-02 23:31:02,873 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:02,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:02,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:02,920 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:02,945 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:02,947 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_942 4294967296) 65521) (< (mod (+ v_main_~x~0_942 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_942} OutVars{main_~x~0=v_main_~x~0_942} AuxVars[] AssignedVars[] [2021-05-02 23:31:02,948 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:02,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:02,950 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:03,391 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:31:03,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:03,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:03,479 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:03,505 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:03,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:03,589 INFO 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:31:05,710 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:05,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063829974] [2021-05-02 23:31:05,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2063829974] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:05,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:05,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:31:05,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800337728] [2021-05-02 23:31:05,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:31:05,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:31:05,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:31:05,712 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:09,240 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:31:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:31:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-02 23:31:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:09,242 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:31:09,242 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:31:09,242 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 6 SyntacticMatches, 41 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3829.8ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:31:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:31:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:31:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-02 23:31:09,249 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-02 23:31:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-02 23:31:09,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-02 23:31:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:31:09,250 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:09,250 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:09,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-02 23:31:09,250 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1948997590, now seen corresponding path program 40 times [2021-05-02 23:31:09,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:09,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684216998] [2021-05-02 23:31:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:09,256 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_984 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_984} OutVars{main_~x~0=v_main_~x~0_984} AuxVars[] AssignedVars[] [2021-05-02 23:31:09,257 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:09,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:09,288 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:09,302 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:09,327 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:09,328 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_986 1) 4294967296) 268435455) (< (mod v_main_~x~0_986 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_986} OutVars{main_~x~0=v_main_~x~0_986} AuxVars[] AssignedVars[] [2021-05-02 23:31:09,330 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:09,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:09,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:09,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:09,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:09,465 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:09,493 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,566 INFO 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:31:11,950 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:11,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684216998] [2021-05-02 23:31:11,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1684216998] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:11,951 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:11,951 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:31:11,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016497128] [2021-05-02 23:31:11,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:31:11,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:11,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:31:11,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:31:11,952 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:15,804 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-02 23:31:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:31:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-02 23:31:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:15,805 INFO L225 Difference]: With dead ends: 102 [2021-05-02 23:31:15,805 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:31:15,805 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 6 SyntacticMatches, 42 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 4263.1ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:31:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:31:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:31:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-02 23:31:15,811 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-02 23:31:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:15,811 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-02 23:31:15,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-02 23:31:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:31:15,811 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:15,812 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:15,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:31:15,812 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash 694389191, now seen corresponding path program 41 times [2021-05-02 23:31:15,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:15,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886055769] [2021-05-02 23:31:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:15,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1029 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1029} OutVars{main_~x~0=v_main_~x~0_1029} AuxVars[] AssignedVars[] [2021-05-02 23:31:15,818 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:15,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:15,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:15,854 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:15,876 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:15,877 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1031 1) 4294967296) 268435455) (< (mod v_main_~x~0_1031 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1031} OutVars{main_~x~0=v_main_~x~0_1031} AuxVars[] AssignedVars[] [2021-05-02 23:31:15,879 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:15,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:15,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:16,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:16,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:16,055 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:16,078 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:16,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:19,080 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:19,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886055769] [2021-05-02 23:31:19,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1886055769] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:19,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:19,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:31:19,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469179509] [2021-05-02 23:31:19,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:31:19,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:31:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:31:19,082 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:24,546 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-02 23:31:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:31:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-02 23:31:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:24,547 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:31:24,547 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:31:24,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 7 SyntacticMatches, 42 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 5536.1ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:31:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:31:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:31:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:31:24,555 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-02 23:31:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:24,555 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:31:24,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:31:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:31:24,556 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:24,556 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:24,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-02 23:31:24,556 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1631553500, now seen corresponding path program 42 times [2021-05-02 23:31:24,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:24,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421278533] [2021-05-02 23:31:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:24,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1075 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-02 23:31:24,564 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:24,576 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:24,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:24,634 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:24,666 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:24,667 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1077 1) 4294967296) 268435455) (< (mod v_main_~x~0_1077 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1077} OutVars{main_~x~0=v_main_~x~0_1077} AuxVars[] AssignedVars[] [2021-05-02 23:31:24,668 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:24,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:24,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:24,880 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:31:24,906 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:24,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:24,957 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:24,983 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:25,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:27,539 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:27,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421278533] [2021-05-02 23:31:27,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [421278533] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:27,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:27,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:31:27,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398934999] [2021-05-02 23:31:27,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:31:27,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:31:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:31:27,541 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:32,052 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:31:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:31:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-02 23:31:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:32,053 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:31:32,053 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:31:32,054 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 7 SyntacticMatches, 43 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 4662.5ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:31:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:31:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:31:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-02 23:31:32,059 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-02 23:31:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:32,059 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-02 23:31:32,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-02 23:31:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-02 23:31:32,060 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:32,060 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:32,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-02 23:31:32,060 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash 815481665, now seen corresponding path program 43 times [2021-05-02 23:31:32,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:32,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015428949] [2021-05-02 23:31:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:32,068 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1122 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-02 23:31:32,070 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:32,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:32,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:32,125 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:32,151 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:32,153 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1124 1) 4294967296) 268435455) (< (mod v_main_~x~0_1124 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1124} OutVars{main_~x~0=v_main_~x~0_1124} AuxVars[] AssignedVars[] [2021-05-02 23:31:32,154 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:32,155 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:32,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:32,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:32,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:32,323 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:32,344 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:32,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:35,413 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:35,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015428949] [2021-05-02 23:31:35,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2015428949] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:35,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:35,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:31:35,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009148751] [2021-05-02 23:31:35,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:31:35,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:35,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:31:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:31:35,414 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:40,730 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-05-02 23:31:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:31:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-02 23:31:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:40,731 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:31:40,731 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:31:40,731 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 6 SyntacticMatches, 45 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 5498.2ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:31:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:31:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-02 23:31:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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:31:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2021-05-02 23:31:40,737 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 97 [2021-05-02 23:31:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:40,738 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2021-05-02 23:31:40,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2021-05-02 23:31:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:31:40,738 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:40,738 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:40,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-02 23:31:40,739 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1225802978, now seen corresponding path program 44 times [2021-05-02 23:31:40,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:40,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012808733] [2021-05-02 23:31:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:40,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1170 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-02 23:31:40,751 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:40,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:40,768 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:40,794 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:40,827 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:40,829 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1172 1) 4294967296) 268435455) (< (mod v_main_~x~0_1172 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1172} OutVars{main_~x~0=v_main_~x~0_1172} AuxVars[] AssignedVars[] [2021-05-02 23:31:40,831 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:40,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:40,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:42,082 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:31:42,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:42,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:42,181 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:42,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:42,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:42,324 INFO 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:31:45,727 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:45,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012808733] [2021-05-02 23:31:45,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1012808733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:45,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:45,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:31:45,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268964528] [2021-05-02 23:31:45,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:31:45,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:31:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:31:45,729 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:51,174 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-05-02 23:31:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:31:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-02 23:31:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:51,175 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:31:51,175 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:31:51,176 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 6 SyntacticMatches, 46 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 5980.8ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:31:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:31:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-02 23:31:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:31:51,184 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 99 [2021-05-02 23:31:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:51,184 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:31:51,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:31:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:31:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:31:51,185 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:51,185 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:51,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-02 23:31:51,185 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -100290629, now seen corresponding path program 45 times [2021-05-02 23:31:51,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:51,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776273716] [2021-05-02 23:31:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:51,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1219 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-02 23:31:51,201 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:51,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:51,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:51,257 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:51,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:51,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1221 1) 4294967296) 268435455) (< (mod v_main_~x~0_1221 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-02 23:31:51,294 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:51,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:51,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:51,452 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:31:51,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:51,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:51,534 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:51,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:51,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:51,664 INFO 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:31:55,111 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:55,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776273716] [2021-05-02 23:31:55,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1776273716] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:55,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:55,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:31:55,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514978932] [2021-05-02 23:31:55,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:31:55,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:31:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:31:55,113 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:00,979 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:32:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:32:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-02 23:32:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:00,980 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:32:00,980 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:32:00,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 6208.5ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:32:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:32:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:32:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-02 23:32:00,989 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-02 23:32:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:00,989 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-02 23:32:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-02 23:32:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:32:00,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:00,990 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:00,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-02 23:32:00,990 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash -814681832, now seen corresponding path program 46 times [2021-05-02 23:32:00,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:00,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879774208] [2021-05-02 23:32:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:00,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1269 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1269} OutVars{main_~x~0=v_main_~x~0_1269} AuxVars[] AssignedVars[] [2021-05-02 23:32:01,000 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:01,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:01,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:01,069 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:01,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:01,110 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1271 1) 4294967296) 268435455) (< (mod v_main_~x~0_1271 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1271} OutVars{main_~x~0=v_main_~x~0_1271} AuxVars[] AssignedVars[] [2021-05-02 23:32:01,115 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:01,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:01,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:01,302 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:32:01,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:01,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:01,481 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:32:01,526 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:01,558 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:01,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:01,630 INFO 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:32:05,345 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:05,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879774208] [2021-05-02 23:32:05,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [879774208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:05,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:05,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:32:05,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020098227] [2021-05-02 23:32:05,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:32:05,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:32:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:32:05,346 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:11,779 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-02 23:32:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:32:11,779 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-02 23:32:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:11,780 INFO L225 Difference]: With dead ends: 114 [2021-05-02 23:32:11,780 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:32:11,781 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 6 SyntacticMatches, 48 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 6722.1ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:32:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:32:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-02 23:32:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-02 23:32:11,789 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-02 23:32:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:11,789 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-02 23:32:11,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-02 23:32:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:32:11,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:11,790 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:11,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-02 23:32:11,790 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash -149860555, now seen corresponding path program 47 times [2021-05-02 23:32:11,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:11,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517891514] [2021-05-02 23:32:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:11,798 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1320 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1320} OutVars{main_~x~0=v_main_~x~0_1320} AuxVars[] AssignedVars[] [2021-05-02 23:32:11,800 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:11,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:11,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:11,856 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:11,897 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:11,898 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1322 4294967296) 65521) (< (mod (+ v_main_~x~0_1322 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1322} OutVars{main_~x~0=v_main_~x~0_1322} AuxVars[] AssignedVars[] [2021-05-02 23:32:11,899 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:11,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:11,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:13,009 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:32:13,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:13,043 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:13,115 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:13,146 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:13,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:13,233 INFO 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:32:16,943 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:16,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517891514] [2021-05-02 23:32:16,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [517891514] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:16,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:16,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:32:16,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865105015] [2021-05-02 23:32:16,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:32:16,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:32:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:32:16,944 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:24,296 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-02 23:32:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:32:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2021-05-02 23:32:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:24,297 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:32:24,297 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:32:24,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 7074.7ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:32:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:32:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-02 23:32:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:32:24,305 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-02 23:32:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:24,306 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:32:24,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:32:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:32:24,306 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:24,306 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:24,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-02 23:32:24,307 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1206740462, now seen corresponding path program 48 times [2021-05-02 23:32:24,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:24,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [839353356] [2021-05-02 23:32:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:24,314 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1372 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-02 23:32:24,316 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:24,331 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:24,359 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:24,376 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:24,406 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:24,407 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1374 4294967296) 65521) (< (mod (+ v_main_~x~0_1374 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-02 23:32:24,409 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:24,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:24,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:24,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:24,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:24,541 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:24,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:24,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:24,669 INFO 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:32:29,180 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:29,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [839353356] [2021-05-02 23:32:29,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [839353356] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:29,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:29,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:32:29,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409202503] [2021-05-02 23:32:29,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:32:29,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:32:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:32:29,181 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:36,520 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:32:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:32:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-02 23:32:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:36,522 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:32:36,522 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:32:36,522 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 6 SyntacticMatches, 50 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 7852.2ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:32:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:32:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:32:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-02 23:32:36,531 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-02 23:32:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:36,531 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-02 23:32:36,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-02 23:32:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-02 23:32:36,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:36,532 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:36,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-02 23:32:36,532 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1038918063, now seen corresponding path program 49 times [2021-05-02 23:32:36,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:36,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087939621] [2021-05-02 23:32:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:36,542 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1425 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1425} OutVars{main_~x~0=v_main_~x~0_1425} AuxVars[] AssignedVars[] [2021-05-02 23:32:36,546 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:36,547 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:36,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:36,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:36,657 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:36,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1427 1) 4294967296) 268435455) (< (mod v_main_~x~0_1427 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1427} OutVars{main_~x~0=v_main_~x~0_1427} AuxVars[] AssignedVars[] [2021-05-02 23:32:36,661 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:36,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:36,664 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:37,258 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:32:37,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:37,285 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:37,355 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:37,389 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:37,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:37,480 INFO 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:32:41,347 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:41,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087939621] [2021-05-02 23:32:41,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1087939621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:41,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:41,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:32:41,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042093489] [2021-05-02 23:32:41,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:32:41,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:32:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:32:41,349 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:47,844 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-02 23:32:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:32:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2021-05-02 23:32:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:47,845 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:32:47,846 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:32:47,846 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 6878.5ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:32:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:32:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:32:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-02 23:32:47,854 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-02 23:32:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:47,854 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-02 23:32:47,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-02 23:32:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 23:32:47,855 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:47,855 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:47,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-02 23:32:47,855 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1251789300, now seen corresponding path program 50 times [2021-05-02 23:32:47,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:47,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514124513] [2021-05-02 23:32:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:47,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1479 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1479} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[] [2021-05-02 23:32:47,865 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:47,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:47,904 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:47,921 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:47,956 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:47,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1481 4294967296) 65521) (< (mod (+ v_main_~x~0_1481 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1481} OutVars{main_~x~0=v_main_~x~0_1481} AuxVars[] AssignedVars[] [2021-05-02 23:32:47,965 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:47,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:47,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:48,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:48,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:48,939 WARN L205 SmtUtils]: Spent 886.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-02 23:32:48,970 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:48,997 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:49,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:49,083 INFO 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:32:52,866 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:52,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514124513] [2021-05-02 23:32:52,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1514124513] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:52,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:52,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:32:52,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050950956] [2021-05-02 23:32:52,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:32:52,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:32:52,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:32:52,868 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:59,578 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-02 23:32:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:32:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-05-02 23:32:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:59,579 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:32:59,579 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:32:59,580 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 7 SyntacticMatches, 51 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 6867.2ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:32:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:32:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:32:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:32:59,585 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-02 23:32:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:59,586 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:32:59,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:32:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:32:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:32:59,586 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:59,586 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:59,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-02 23:32:59,586 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash 696657705, now seen corresponding path program 51 times [2021-05-02 23:32:59,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:59,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684548780] [2021-05-02 23:32:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:59,592 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1534 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-02 23:32:59,593 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:59,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:59,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:59,635 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:59,664 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:59,666 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1536 1) 4294967296) 268435455) (< (mod v_main_~x~0_1536 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1536} OutVars{main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[] [2021-05-02 23:32:59,667 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:59,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:59,685 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:59,805 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:32:59,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:59,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:59,894 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:59,925 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:00,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:00,012 INFO 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:33:04,383 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:04,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684548780] [2021-05-02 23:33:04,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1684548780] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:04,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:04,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:33:04,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979082604] [2021-05-02 23:33:04,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:33:04,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:33:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:33:04,384 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:14,085 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:33:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:33:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-02 23:33:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:14,087 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:33:14,087 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:33:14,088 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 6 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 8657.5ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 23:33:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:33:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:33:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-02 23:33:14,096 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-02 23:33:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:14,097 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-02 23:33:14,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-02 23:33:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-02 23:33:14,097 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:14,097 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:14,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-02 23:33:14,098 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 548488454, now seen corresponding path program 52 times [2021-05-02 23:33:14,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:14,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693470986] [2021-05-02 23:33:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:14,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1590 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-02 23:33:14,107 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:14,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:14,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:14,177 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:14,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:14,217 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1592 4294967296) 65521) (< (mod (+ v_main_~x~0_1592 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1592} OutVars{main_~x~0=v_main_~x~0_1592} AuxVars[] AssignedVars[] [2021-05-02 23:33:14,219 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:14,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:14,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:14,585 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:33:14,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:14,635 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:14,729 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:14,771 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:14,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:33:21,079 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:21,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693470986] [2021-05-02 23:33:21,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [693470986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:21,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:21,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:33:21,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973816258] [2021-05-02 23:33:21,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:33:21,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:33:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:33:21,080 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:31,856 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-02 23:33:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:33:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2021-05-02 23:33:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:31,858 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:33:31,858 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:33:31,859 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 6 SyntacticMatches, 54 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 10930.8ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:33:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:33:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-02 23:33:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-02 23:33:31,865 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-02 23:33:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:31,865 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-02 23:33:31,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-02 23:33:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 23:33:31,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:31,866 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:31,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-02 23:33:31,866 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -108240989, now seen corresponding path program 53 times [2021-05-02 23:33:31,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:31,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309485732] [2021-05-02 23:33:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:31,882 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1647 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-02 23:33:31,884 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:31,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:31,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:31,953 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:32,004 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:32,006 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1649 4294967296) 65521) (< (mod (+ v_main_~x~0_1649 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1649} OutVars{main_~x~0=v_main_~x~0_1649} AuxVars[] AssignedVars[] [2021-05-02 23:33:32,008 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:32,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:32,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:32,167 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:33:32,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:32,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:32,249 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:32,285 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:32,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:32,386 INFO 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:33:37,653 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:37,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309485732] [2021-05-02 23:33:37,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [309485732] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:37,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:37,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:33:37,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567425840] [2021-05-02 23:33:37,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:33:37,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:33:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:33:37,655 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:45,979 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-02 23:33:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:33:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-02 23:33:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:45,981 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:33:45,981 INFO L226 Difference]: Without dead ends: 121 [2021-05-02 23:33:45,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 55 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 9000.6ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-02 23:33:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-02 23:33:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-02 23:33:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:33:45,987 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-02 23:33:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:45,988 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:33:45,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:33:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:33:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:33:45,988 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:45,989 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:45,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-02 23:33:45,989 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 134956800, now seen corresponding path program 54 times [2021-05-02 23:33:45,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:45,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031073538] [2021-05-02 23:33:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:45,998 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1705 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-02 23:33:46,000 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:46,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:46,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:46,070 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:46,113 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:46,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1707 4294967296) 65521) (< (mod (+ v_main_~x~0_1707 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1707} OutVars{main_~x~0=v_main_~x~0_1707} AuxVars[] AssignedVars[] [2021-05-02 23:33:46,117 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:46,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:46,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:46,242 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:46,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:46,308 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:46,341 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:46,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:46,415 INFO 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:33:51,887 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:51,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031073538] [2021-05-02 23:33:51,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2031073538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:51,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:51,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:33:51,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620080895] [2021-05-02 23:33:51,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:33:51,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:33:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:33:51,888 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:01,994 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:34:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:34:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-02 23:34:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:01,995 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:34:01,996 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:34:01,996 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 7 SyntacticMatches, 55 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 9834.7ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:34:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:34:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:34:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-02 23:34:02,002 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-02 23:34:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:02,002 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-02 23:34:02,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-02 23:34:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 23:34:02,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:02,003 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:02,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-02 23:34:02,003 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1919798045, now seen corresponding path program 55 times [2021-05-02 23:34:02,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:02,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [361307817] [2021-05-02 23:34:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:02,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1764 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-02 23:34:02,021 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:02,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:02,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:02,080 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:02,121 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:02,122 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1766 4294967296) 65521) (< (mod (+ v_main_~x~0_1766 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1766} OutVars{main_~x~0=v_main_~x~0_1766} AuxVars[] AssignedVars[] [2021-05-02 23:34:02,124 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:02,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:02,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:02,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:02,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:02,366 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:02,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:02,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:02,519 INFO 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:34:09,386 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:09,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [361307817] [2021-05-02 23:34:09,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [361307817] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:09,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:09,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-02 23:34:09,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880468503] [2021-05-02 23:34:09,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 23:34:09,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 23:34:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:34:09,388 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:20,825 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-02 23:34:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:34:20,826 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 23:34:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:20,826 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:34:20,826 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:34:20,827 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 7 SyntacticMatches, 56 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 11867.5ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-02 23:34:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:34:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-02 23:34:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-02 23:34:20,849 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-02 23:34:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:20,849 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-02 23:34:20,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-02 23:34:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 23:34:20,850 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:20,850 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:20,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-02 23:34:20,851 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -834683910, now seen corresponding path program 56 times [2021-05-02 23:34:20,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:20,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [604686148] [2021-05-02 23:34:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:20,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1824 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-02 23:34:20,881 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:20,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:20,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:21,029 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:21,122 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:21,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1826 4294967296) 65521) (< (mod (+ v_main_~x~0_1826 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1826} OutVars{main_~x~0=v_main_~x~0_1826} AuxVars[] AssignedVars[] [2021-05-02 23:34:21,126 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:21,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:21,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:22,180 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:34:22,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:22,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:22,283 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:22,323 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:22,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:22,485 INFO 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:34:30,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:30,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [604686148] [2021-05-02 23:34:30,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [604686148] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:30,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:30,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:34:30,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902306172] [2021-05-02 23:34:30,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:34:30,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:30,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:34:30,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:34:30,659 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:42,095 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-02 23:34:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-02 23:34:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-02 23:34:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:42,096 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:34:42,096 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 23:34:42,097 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 6 SyntacticMatches, 58 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 13157.4ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:34:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 23:34:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-02 23:34:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:34:42,102 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-02 23:34:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:42,102 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:34:42,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:34:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:34:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:34:42,103 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:42,103 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:42,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-02 23:34:42,103 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2102978967, now seen corresponding path program 57 times [2021-05-02 23:34:42,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:42,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559271701] [2021-05-02 23:34:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:42,111 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1885 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-02 23:34:42,112 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:42,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:42,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:42,161 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:42,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:42,195 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1887 1) 4294967296) 268435455) (< (mod v_main_~x~0_1887 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1887} OutVars{main_~x~0=v_main_~x~0_1887} AuxVars[] AssignedVars[] [2021-05-02 23:34:42,196 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:42,197 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:42,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:42,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:42,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:42,339 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:42,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:42,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:34:49,699 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:49,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559271701] [2021-05-02 23:34:49,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559271701] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:49,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:49,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-02 23:34:49,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127298859] [2021-05-02 23:34:49,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 23:34:49,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 23:34:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:34:49,700 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:03,012 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-02 23:35:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-02 23:35:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-02 23:35:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:03,013 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:35:03,014 INFO L226 Difference]: Without dead ends: 129 [2021-05-02 23:35:03,015 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 7 SyntacticMatches, 58 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 12907.1ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-02 23:35:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-02 23:35:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-02 23:35:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-02 23:35:03,021 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-02 23:35:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:03,021 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-02 23:35:03,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-02 23:35:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-02 23:35:03,022 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:03,022 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:03,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-02 23:35:03,022 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:03,023 INFO L82 PathProgramCache]: Analyzing trace with hash -891477004, now seen corresponding path program 58 times [2021-05-02 23:35:03,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:03,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801509873] [2021-05-02 23:35:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:03,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1947 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-02 23:35:03,038 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:03,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:03,064 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:03,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:03,134 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:03,137 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1949 1) 4294967296) 268435455) (< (mod v_main_~x~0_1949 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_1949} OutVars{main_~x~0=v_main_~x~0_1949} AuxVars[] AssignedVars[] [2021-05-02 23:35:03,139 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:03,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:03,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:03,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:03,258 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:03,331 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:03,377 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:03,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:35:11,419 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:35:11,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801509873] [2021-05-02 23:35:11,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [801509873] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:35:11,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:35:11,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:35:11,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153861396] [2021-05-02 23:35:11,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:35:11,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:35:11,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:35:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:35:11,421 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:31,546 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-02 23:35:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-02 23:35:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2021-05-02 23:35:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:31,548 INFO L225 Difference]: With dead ends: 138 [2021-05-02 23:35:31,548 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:35:31,549 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 6 SyntacticMatches, 60 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 16057.9ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:35:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:35:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-02 23:35:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-02 23:35:31,556 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-02 23:35:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:31,556 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-02 23:35:31,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-02 23:35:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-02 23:35:31,557 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:31,557 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:31,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-02 23:35:31,557 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash -935576815, now seen corresponding path program 59 times [2021-05-02 23:35:31,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:31,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070654174] [2021-05-02 23:35:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:31,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2010 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-02 23:35:31,570 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:31,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:31,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:31,641 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:31,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:31,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2012 4294967296) 65521) (< (mod (+ v_main_~x~0_2012 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2012} OutVars{main_~x~0=v_main_~x~0_2012} AuxVars[] AssignedVars[] [2021-05-02 23:35:31,688 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:31,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:31,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:32,060 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:35:32,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:32,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:32,176 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:32,216 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:32,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:32,302 INFO 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:35:41,629 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:35:41,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070654174] [2021-05-02 23:35:41,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070654174] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:35:41,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:35:41,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-02 23:35:41,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044951701] [2021-05-02 23:35:41,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-02 23:35:41,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:35:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-02 23:35:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:35:41,630 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:58,233 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-02 23:35:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-02 23:35:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2021-05-02 23:35:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:58,236 INFO L225 Difference]: With dead ends: 140 [2021-05-02 23:35:58,236 INFO L226 Difference]: Without dead ends: 133 [2021-05-02 23:35:58,237 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 6 SyntacticMatches, 61 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 16239.5ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-02 23:35:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-02 23:35:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-02 23:35:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-02 23:35:58,253 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-02 23:35:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:58,253 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-02 23:35:58,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:35:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-02 23:35:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:35:58,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:58,254 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:58,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-02 23:35:58,254 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash -365822226, now seen corresponding path program 60 times [2021-05-02 23:35:58,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:58,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59303994] [2021-05-02 23:35:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:58,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2074 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2074} OutVars{main_~x~0=v_main_~x~0_2074} AuxVars[] AssignedVars[] [2021-05-02 23:35:58,286 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:58,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:58,356 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:58,395 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:58,460 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:58,463 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2076 4294967296) 65521) (< (mod (+ v_main_~x~0_2076 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2076} OutVars{main_~x~0=v_main_~x~0_2076} AuxVars[] AssignedVars[] [2021-05-02 23:35:58,466 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:58,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:58,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:58,946 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:35:58,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:58,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:59,076 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:59,141 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:59,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:36:08,452 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:36:08,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59303994] [2021-05-02 23:36:08,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [59303994] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:36:08,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:36:08,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:36:08,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102210519] [2021-05-02 23:36:08,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:36:08,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:36:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:36:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:36:08,454 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:36:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:36:29,511 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-02 23:36:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-02 23:36:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-02 23:36:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:36:29,514 INFO L225 Difference]: With dead ends: 142 [2021-05-02 23:36:29,515 INFO L226 Difference]: Without dead ends: 135 [2021-05-02 23:36:29,516 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 6 SyntacticMatches, 62 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 17569.7ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:36:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-02 23:36:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-02 23:36:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:36:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-02 23:36:29,523 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-02 23:36:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:36:29,523 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-02 23:36:29,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:36:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-02 23:36:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-02 23:36:29,524 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:36:29,524 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:36:29,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-02 23:36:29,524 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:36:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:36:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1707491211, now seen corresponding path program 61 times [2021-05-02 23:36:29,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:36:29,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [778079806] [2021-05-02 23:36:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:36:29,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2139 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2139} OutVars{main_~x~0=v_main_~x~0_2139} AuxVars[] AssignedVars[] [2021-05-02 23:36:29,538 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:36:29,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:29,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:36:29,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:36:29,701 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:29,704 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2141 4294967296) 65521) (< (mod (+ v_main_~x~0_2141 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2141} OutVars{main_~x~0=v_main_~x~0_2141} AuxVars[] AssignedVars[] [2021-05-02 23:36:29,706 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:36:29,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:29,747 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:30,537 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:36:30,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:36:30,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:36:30,656 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:36:30,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:30,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:36:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:30,866 INFO 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:36:44,331 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:36:44,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [778079806] [2021-05-02 23:36:44,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [778079806] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:36:44,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:36:44,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-02 23:36:44,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88776024] [2021-05-02 23:36:44,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 23:36:44,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:36:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 23:36:44,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:36:44,334 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:36:45,117 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-02 23:37:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:37:13,050 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-02 23:37:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 23:37:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-02 23:37:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:37:13,053 INFO L225 Difference]: With dead ends: 144 [2021-05-02 23:37:13,053 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:37:13,054 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 24653.8ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-02 23:37:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:37:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-02 23:37:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:37:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-02 23:37:13,067 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-02 23:37:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:37:13,067 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-02 23:37:13,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:37:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-02 23:37:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 23:37:13,068 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:37:13,068 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:37:13,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-02 23:37:13,068 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:37:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:37:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1296878824, now seen corresponding path program 62 times [2021-05-02 23:37:13,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:37:13,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [623367302] [2021-05-02 23:37:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:37:13,093 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2205 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-02 23:37:13,095 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:37:13,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:13,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:37:13,222 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:37:13,298 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:13,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2207 4294967296) 65521) (< (mod (+ v_main_~x~0_2207 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-02 23:37:13,303 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:37:13,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:13,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:13,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:37:13,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:37:13,607 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:37:13,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:37:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:37:31,034 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:37:31,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [623367302] [2021-05-02 23:37:31,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [623367302] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:37:31,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:37:31,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:37:31,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114620135] [2021-05-02 23:37:31,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:37:31,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:37:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:37:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:37:31,036 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:38:01,418 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-02 23:38:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-02 23:38:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-02 23:38:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:38:01,423 INFO L225 Difference]: With dead ends: 146 [2021-05-02 23:38:01,423 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:38:01,424 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 6 SyntacticMatches, 64 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 29042.6ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:38:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:38:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-02 23:38:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-02 23:38:01,433 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-02 23:38:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:38:01,433 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-02 23:38:01,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-02 23:38:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-02 23:38:01,435 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:38:01,435 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:38:01,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-05-02 23:38:01,435 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:38:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:38:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1835366149, now seen corresponding path program 63 times [2021-05-02 23:38:01,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:38:01,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673520610] [2021-05-02 23:38:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:38:01,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2272 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2272} OutVars{main_~x~0=v_main_~x~0_2272} AuxVars[] AssignedVars[] [2021-05-02 23:38:01,454 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:38:01,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:01,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:38:01,607 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:38:01,729 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:38:01,734 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:01,739 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2274 1) 4294967296) 268435455) (< (mod v_main_~x~0_2274 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_2274} OutVars{main_~x~0=v_main_~x~0_2274} AuxVars[] AssignedVars[] [2021-05-02 23:38:01,743 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:38:01,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:01,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:01,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:38:02,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:38:02,118 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:38:02,225 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:38:02,231 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:02,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:38:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:38:20,396 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:38:20,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673520610] [2021-05-02 23:38:20,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1673520610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:38:20,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:38:20,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-02 23:38:20,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627168052] [2021-05-02 23:38:20,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-02 23:38:20,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:38:20,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-02 23:38:20,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:38:20,398 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:38:51,208 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-02 23:38:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 23:38:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-02 23:38:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:38:51,211 INFO L225 Difference]: With dead ends: 148 [2021-05-02 23:38:51,211 INFO L226 Difference]: Without dead ends: 141 [2021-05-02 23:38:51,212 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 7 SyntacticMatches, 64 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 30071.3ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-02 23:38:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-02 23:38:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-02 23:38:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-02 23:38:51,221 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-02 23:38:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:38:51,221 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-02 23:38:51,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:38:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-02 23:38:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-02 23:38:51,222 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:38:51,222 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:38:51,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-02 23:38:51,223 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:38:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:38:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash -369357342, now seen corresponding path program 64 times [2021-05-02 23:38:51,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:38:51,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727873427] [2021-05-02 23:38:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:38:51,233 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2340 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-02 23:38:51,235 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:38:51,254 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:51,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:38:51,327 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:38:51,384 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:51,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2342 4294967296) 65521) (< (mod (+ v_main_~x~0_2342 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2342} OutVars{main_~x~0=v_main_~x~0_2342} AuxVars[] AssignedVars[] [2021-05-02 23:38:51,388 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:38:51,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:51,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:51,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:38:51,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:38:51,736 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:38:51,811 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:51,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:38:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:51,942 INFO 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:39:06,904 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:39:06,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727873427] [2021-05-02 23:39:06,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1727873427] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:39:06,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:39:06,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:39:06,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52443725] [2021-05-02 23:39:06,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:39:06,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:39:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:39:06,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:39:06,907 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:39:08,028 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-02 23:39:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:39:39,023 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-02 23:39:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-02 23:39:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2021-05-02 23:39:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:39:39,027 INFO L225 Difference]: With dead ends: 150 [2021-05-02 23:39:39,027 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:39:39,029 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 7 SyntacticMatches, 65 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 27258.1ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 23:39:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:39:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-02 23:39:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:39:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-02 23:39:39,039 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-02 23:39:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:39:39,039 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-02 23:39:39,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:39:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-02 23:39:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-02 23:39:39,040 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:39:39,040 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:39:39,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-02 23:39:39,041 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:39:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:39:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1689755265, now seen corresponding path program 65 times [2021-05-02 23:39:39,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:39:39,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106648644] [2021-05-02 23:39:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:39:39,058 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2409 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-02 23:39:39,065 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:39:39,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:39,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:39:39,160 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:39:39,234 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:39:39,237 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2411 1) 4294967296) 268435455) (< (mod v_main_~x~0_2411 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-02 23:39:39,239 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:39:39,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:39,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:39,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:39:39,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:39:39,509 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:39:39,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:39:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:39:39,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:39:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:39:39,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:39:53,509 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:39:53,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106648644] [2021-05-02 23:39:53,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2106648644] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:39:53,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:39:53,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-02 23:39:53,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378932048] [2021-05-02 23:39:53,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-02 23:39:53,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:39:53,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-02 23:39:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:39:53,511 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:40:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:40:22,561 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-02 23:40:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-02 23:40:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-02 23:40:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:40:22,564 INFO L225 Difference]: With dead ends: 152 [2021-05-02 23:40:22,564 INFO L226 Difference]: Without dead ends: 145 [2021-05-02 23:40:22,565 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 7 SyntacticMatches, 66 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 25191.1ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-02 23:40:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-02 23:40:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-02 23:40:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:40:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-02 23:40:22,575 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-02 23:40:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:40:22,575 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-02 23:40:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:40:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-02 23:40:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:40:22,576 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:40:22,576 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:40:22,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-02 23:40:22,576 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:40:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:40:22,576 INFO L82 PathProgramCache]: Analyzing trace with hash 718160348, now seen corresponding path program 66 times [2021-05-02 23:40:22,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:40:22,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596724813] [2021-05-02 23:40:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:40:22,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2479 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-02 23:40:22,588 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:40:22,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:22,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:40:22,681 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:40:22,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:40:22,762 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2481 1) 4294967296) 268435455) (< (mod v_main_~x~0_2481 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_2481} OutVars{main_~x~0=v_main_~x~0_2481} AuxVars[] AssignedVars[] [2021-05-02 23:40:22,765 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:40:22,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:22,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:23,164 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:40:23,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:40:23,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:40:23,317 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:40:23,381 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:40:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:40:23,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:40:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:40:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:40:51,310 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:40:51,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596724813] [2021-05-02 23:40:51,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1596724813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:40:51,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:40:51,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:40:51,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958792947] [2021-05-02 23:40:51,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:40:51,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:40:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:40:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:40:51,312 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:40:58,442 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:02,381 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:03,280 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:04,188 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:05,122 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:06,107 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:07,066 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:08,006 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:09,016 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:10,049 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:10,983 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:13,436 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:18,769 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:19,596 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:22,849 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:24,742 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:34,689 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-02 23:41:34,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-02 23:41:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-02 23:41:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:34,691 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:41:34,691 INFO L226 Difference]: Without dead ends: 147 [2021-05-02 23:41:34,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 6 SyntacticMatches, 68 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 44710.6ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-02 23:41:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-02 23:41:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-02 23:41:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:41:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-02 23:41:34,704 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-02 23:41:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:34,705 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-02 23:41:34,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:41:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-02 23:41:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-02 23:41:34,706 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:34,706 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:34,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-02 23:41:34,706 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash -262308103, now seen corresponding path program 67 times [2021-05-02 23:41:34,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:34,707 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999333034] [2021-05-02 23:41:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:34,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2550 4294967296) 65521) InVars {main_~x~0=v_main_~x~0_2550} OutVars{main_~x~0=v_main_~x~0_2550} AuxVars[] AssignedVars[] [2021-05-02 23:41:34,721 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:41:34,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:34,769 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:41:34,797 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:41:34,841 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:34,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2552 1) 4294967296) 268435455) (< (mod v_main_~x~0_2552 4294967296) 65521)) InVars {main_~x~0=v_main_~x~0_2552} OutVars{main_~x~0=v_main_~x~0_2552} AuxVars[] AssignedVars[] [2021-05-02 23:41:34,845 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:41:34,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:34,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:35,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:41:35,039 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:41:35,118 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:41:35,171 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:35,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.