/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:15:26,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:15:26,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:15:26,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:15:26,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:15:26,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:15:26,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:15:26,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:15:26,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:15:26,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:15:26,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:15:26,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:15:26,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:15:26,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:15:26,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:15:26,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:15:26,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:15:26,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:15:26,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:15:26,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:15:26,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:15:26,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:15:26,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:15:26,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:15:26,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:15:26,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:15:26,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:15:26,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:15:26,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:15:26,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:15:26,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:15:26,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:15:26,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:15:26,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:15:26,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:15:26,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:15:26,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:15:26,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:15:26,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:15:26,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:15:26,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:15:26,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:15:26,684 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:15:26,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:15:26,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:15:26,689 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:15:26,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:15:26,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:15:26,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:15:26,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:15:26,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:15:26,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:15:26,691 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:15:26,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:15:26,692 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:15:26,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:15:26,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:15:26,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:15:26,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:15:26,693 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:15:27,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:15:27,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:15:27,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:15:27,167 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:15:27,169 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:15:27,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2021-05-03 00:15:27,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6643124/98c6bc5b24614c9584a67ad5c987b4e2/FLAGa14c74edb [2021-05-03 00:15:27,769 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:15:27,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2021-05-03 00:15:27,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6643124/98c6bc5b24614c9584a67ad5c987b4e2/FLAGa14c74edb [2021-05-03 00:15:28,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6643124/98c6bc5b24614c9584a67ad5c987b4e2 [2021-05-03 00:15:28,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:15:28,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:15:28,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:15:28,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:15:28,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:15:28,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce2c434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28, skipping insertion in model container [2021-05-03 00:15:28,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:15:28,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:15:28,353 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2021-05-03 00:15:28,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:15:28,398 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:15:28,414 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2021-05-03 00:15:28,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:15:28,461 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:15:28,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28 WrapperNode [2021-05-03 00:15:28,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:15:28,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:15:28,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:15:28,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:15:28,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... [2021-05-03 00:15:28,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:15:28,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:15:28,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:15:28,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:15:28,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:15:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:15:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:15:28,634 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:15:28,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:15:28,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:15:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:15:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:15:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:15:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:15:28,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:15:28,883 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-05-03 00:15:28,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:15:28 BoogieIcfgContainer [2021-05-03 00:15:28,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:15:28,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:15:28,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:15:28,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:15:28,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:15:28" (1/3) ... [2021-05-03 00:15:28,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da28d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:15:28, skipping insertion in model container [2021-05-03 00:15:28,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:28" (2/3) ... [2021-05-03 00:15:28,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da28d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:15:28, skipping insertion in model container [2021-05-03 00:15:28,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:15:28" (3/3) ... [2021-05-03 00:15:28,911 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2021-05-03 00:15:28,916 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:15:28,919 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:15:28,937 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:15:28,965 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:15:28,965 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:15:28,965 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:15:28,965 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:15:28,965 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:15:28,965 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:15:28,965 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:15:28,966 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:15:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:15:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:15:28,986 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:28,986 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:28,987 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2021-05-03 00:15:28,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:28,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516926538] [2021-05-03 00:15:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:29,046 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:15:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:29,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:29,280 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:29,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516926538] [2021-05-03 00:15:29,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1516926538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:29,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:29,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:15:29,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078279578] [2021-05-03 00:15:29,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:15:29,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:15:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:15:29,306 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:29,416 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2021-05-03 00:15:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:15:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-03 00:15:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:29,426 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:15:29,426 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:15:29,432 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:15:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:15:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-03 00:15:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-05-03 00:15:29,497 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2021-05-03 00:15:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:29,498 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-05-03 00:15:29,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-05-03 00:15:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:15:29,499 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:29,500 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:29,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:15:29,507 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2021-05-03 00:15:29,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:29,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18745158] [2021-05-03 00:15:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:29,522 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:15:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:29,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:29,710 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:29,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18745158] [2021-05-03 00:15:29,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [18745158] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:29,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:29,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:15:29,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246830933] [2021-05-03 00:15:29,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:15:29,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:15:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:15:29,715 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:29,826 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2021-05-03 00:15:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:15:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-03 00:15:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:29,827 INFO L225 Difference]: With dead ends: 49 [2021-05-03 00:15:29,828 INFO L226 Difference]: Without dead ends: 32 [2021-05-03 00:15:29,829 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:15:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-03 00:15:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-05-03 00:15:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-05-03 00:15:29,835 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2021-05-03 00:15:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:29,835 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-05-03 00:15:29,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-05-03 00:15:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:15:29,836 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:29,836 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:29,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:15:29,836 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2021-05-03 00:15:29,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:29,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681024783] [2021-05-03 00:15:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:29,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_10 4294967296) 10) InVars {main_~v~0=v_main_~v~0_10} OutVars{main_~v~0=v_main_~v~0_10} AuxVars[] AssignedVars[] [2021-05-03 00:15:29,885 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:29,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:29,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:29,978 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:30,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:30,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:30,352 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:30,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681024783] [2021-05-03 00:15:30,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1681024783] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:30,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:30,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:15:30,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121854389] [2021-05-03 00:15:30,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:15:30,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:15:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:15:30,355 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:30,590 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2021-05-03 00:15:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:15:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-03 00:15:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:30,593 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:15:30,593 INFO L226 Difference]: Without dead ends: 34 [2021-05-03 00:15:30,594 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 201.6ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-03 00:15:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2021-05-03 00:15:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-05-03 00:15:30,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2021-05-03 00:15:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:30,608 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-05-03 00:15:30,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-05-03 00:15:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:15:30,609 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:30,609 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:30,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:15:30,610 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:30,610 INFO L82 PathProgramCache]: Analyzing trace with hash 831837050, now seen corresponding path program 2 times [2021-05-03 00:15:30,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:30,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060654206] [2021-05-03 00:15:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:30,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_14 4294967296) 10) InVars {main_~v~0=v_main_~v~0_14} OutVars{main_~v~0=v_main_~v~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,619 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:30,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:30,664 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:30,798 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-03 00:15:30,800 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:30,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_16 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_16} OutVars{main_~v~0=v_main_~v~0_16} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,805 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:30,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:30,849 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:30,872 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:31,069 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:31,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060654206] [2021-05-03 00:15:31,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2060654206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:31,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:31,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:15:31,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011782841] [2021-05-03 00:15:31,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:15:31,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:15:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:15:31,071 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:31,287 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2021-05-03 00:15:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:15:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-03 00:15:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:31,288 INFO L225 Difference]: With dead ends: 56 [2021-05-03 00:15:31,288 INFO L226 Difference]: Without dead ends: 36 [2021-05-03 00:15:31,289 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 184.3ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-05-03 00:15:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2021-05-03 00:15:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-05-03 00:15:31,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2021-05-03 00:15:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:31,298 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-05-03 00:15:31,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-05-03 00:15:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:15:31,299 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:31,300 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:31,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:15:31,300 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1164455000, now seen corresponding path program 3 times [2021-05-03 00:15:31,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:31,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066002986] [2021-05-03 00:15:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:31,307 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_21 4294967296) 10) InVars {main_~v~0=v_main_~v~0_21} OutVars{main_~v~0=v_main_~v~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:15:31,313 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:31,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:31,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:31,359 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:31,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:31,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_23 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_23} OutVars{main_~v~0=v_main_~v~0_23} AuxVars[] AssignedVars[] [2021-05-03 00:15:31,387 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:31,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:31,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:31,447 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:31,467 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:31,705 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:31,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066002986] [2021-05-03 00:15:31,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1066002986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:31,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:31,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:15:31,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13717269] [2021-05-03 00:15:31,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:15:31,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:15:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:31,707 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:31,928 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2021-05-03 00:15:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:15:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-03 00:15:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:31,929 INFO L225 Difference]: With dead ends: 60 [2021-05-03 00:15:31,929 INFO L226 Difference]: Without dead ends: 38 [2021-05-03 00:15:31,930 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 231.9ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:15:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-03 00:15:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2021-05-03 00:15:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-05-03 00:15:31,936 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-05-03 00:15:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:31,936 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-05-03 00:15:31,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-05-03 00:15:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:15:31,937 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:31,937 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:31,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:15:31,938 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1312242250, now seen corresponding path program 4 times [2021-05-03 00:15:31,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:31,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720558422] [2021-05-03 00:15:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:31,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_29 4294967296) 10) InVars {main_~v~0=v_main_~v~0_29} OutVars{main_~v~0=v_main_~v~0_29} AuxVars[] AssignedVars[] [2021-05-03 00:15:31,945 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:31,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:31,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:31,981 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:32,002 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:32,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_31 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_31} OutVars{main_~v~0=v_main_~v~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:15:32,006 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:32,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:32,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:32,055 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:32,077 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:32,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:32,320 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:32,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720558422] [2021-05-03 00:15:32,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1720558422] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:32,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:32,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:15:32,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291731300] [2021-05-03 00:15:32,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:15:32,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:15:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:15:32,322 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:32,615 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2021-05-03 00:15:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:15:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-03 00:15:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:32,616 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:15:32,616 INFO L226 Difference]: Without dead ends: 40 [2021-05-03 00:15:32,617 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 307.0ms TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:15:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-03 00:15:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-05-03 00:15:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-03 00:15:32,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2021-05-03 00:15:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:32,622 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-03 00:15:32,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-03 00:15:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:15:32,623 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:32,623 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:32,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:15:32,623 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2006417516, now seen corresponding path program 5 times [2021-05-03 00:15:32,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:32,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328664329] [2021-05-03 00:15:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:32,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_38 4294967296) 10) InVars {main_~v~0=v_main_~v~0_38} OutVars{main_~v~0=v_main_~v~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:15:32,629 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:32,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:32,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:32,669 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:32,691 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:32,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_40 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_40} OutVars{main_~v~0=v_main_~v~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:15:32,695 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:32,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:32,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:32,736 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:32,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:32,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:32,992 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:32,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328664329] [2021-05-03 00:15:32,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1328664329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:32,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:32,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:15:32,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460407571] [2021-05-03 00:15:32,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:15:32,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:32,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:15:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:32,993 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:33,305 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2021-05-03 00:15:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:15:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-03 00:15:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:33,307 INFO L225 Difference]: With dead ends: 68 [2021-05-03 00:15:33,307 INFO L226 Difference]: Without dead ends: 42 [2021-05-03 00:15:33,307 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 315.3ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:15:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-03 00:15:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-05-03 00:15:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-03 00:15:33,313 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2021-05-03 00:15:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:33,314 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-03 00:15:33,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-03 00:15:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:15:33,314 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:33,314 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:33,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:15:33,315 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 906050034, now seen corresponding path program 6 times [2021-05-03 00:15:33,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:33,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [73625629] [2021-05-03 00:15:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:33,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_48 4294967296) 10) InVars {main_~v~0=v_main_~v~0_48} OutVars{main_~v~0=v_main_~v~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:15:33,322 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:33,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:33,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:33,358 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:33,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:33,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_50 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_50} OutVars{main_~v~0=v_main_~v~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:15:33,383 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:33,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:33,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:33,420 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:33,443 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:33,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:33,718 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:33,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [73625629] [2021-05-03 00:15:33,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [73625629] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:33,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:33,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:15:33,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960390935] [2021-05-03 00:15:33,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:15:33,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:15:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:15:33,720 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:34,103 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2021-05-03 00:15:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:15:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-03 00:15:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:34,104 INFO L225 Difference]: With dead ends: 72 [2021-05-03 00:15:34,105 INFO L226 Difference]: Without dead ends: 44 [2021-05-03 00:15:34,105 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 374.8ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:15:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-03 00:15:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2021-05-03 00:15:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-03 00:15:34,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2021-05-03 00:15:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-03 00:15:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-03 00:15:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:15:34,114 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:34,114 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:34,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:15:34,114 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash -531311408, now seen corresponding path program 7 times [2021-05-03 00:15:34,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:34,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613638473] [2021-05-03 00:15:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:34,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_59 4294967296) 10) InVars {main_~v~0=v_main_~v~0_59} OutVars{main_~v~0=v_main_~v~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:15:34,122 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:34,130 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:34,164 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:34,184 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:34,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_61 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_61} OutVars{main_~v~0=v_main_~v~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:15:34,187 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:34,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:34,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:34,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:34,561 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:34,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613638473] [2021-05-03 00:15:34,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1613638473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:34,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:34,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:15:34,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321424803] [2021-05-03 00:15:34,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:15:34,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:15:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:15:34,563 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:35,008 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-05-03 00:15:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:15:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-03 00:15:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:35,010 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:15:35,010 INFO L226 Difference]: Without dead ends: 46 [2021-05-03 00:15:35,010 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 400.9ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:15:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-05-03 00:15:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2021-05-03 00:15:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-03 00:15:35,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2021-05-03 00:15:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-03 00:15:35,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-03 00:15:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:15:35,018 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:35,018 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:35,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:15:35,018 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1143812142, now seen corresponding path program 8 times [2021-05-03 00:15:35,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:35,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [130452635] [2021-05-03 00:15:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:35,024 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_71 4294967296) 10) InVars {main_~v~0=v_main_~v~0_71} OutVars{main_~v~0=v_main_~v~0_71} AuxVars[] AssignedVars[] [2021-05-03 00:15:35,025 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:35,026 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:35,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:35,074 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:35,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:35,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_73 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_73} OutVars{main_~v~0=v_main_~v~0_73} AuxVars[] AssignedVars[] [2021-05-03 00:15:35,111 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:35,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:35,247 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:15:35,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:35,262 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:35,285 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:35,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:35,696 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:35,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [130452635] [2021-05-03 00:15:35,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [130452635] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:35,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:35,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:15:35,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283724645] [2021-05-03 00:15:35,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:15:35,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:35,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:15:35,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:15:35,699 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:36,244 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2021-05-03 00:15:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:15:36,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-03 00:15:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:36,247 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:15:36,248 INFO L226 Difference]: Without dead ends: 48 [2021-05-03 00:15:36,249 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 532.1ms TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:15:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-03 00:15:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2021-05-03 00:15:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-03 00:15:36,272 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2021-05-03 00:15:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:36,273 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-03 00:15:36,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-03 00:15:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-03 00:15:36,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:36,275 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:36,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:15:36,276 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash 324807692, now seen corresponding path program 9 times [2021-05-03 00:15:36,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:36,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67184037] [2021-05-03 00:15:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:36,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~v~0_84 4294967296) 10) InVars {main_~v~0=v_main_~v~0_84} OutVars{main_~v~0=v_main_~v~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:15:36,296 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:15:36,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:36,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:15:36,382 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:15:36,404 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:36,406 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod (+ v_main_~v~0_86 1) 4294967296) 10) InVars {main_~v~0=v_main_~v~0_86} OutVars{main_~v~0=v_main_~v~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:15:36,408 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size [2021-05-03 00:15:36,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:36,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-03 00:15:36,452 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.8 percent of original size 61 [2021-05-03 00:15:36,474 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:36,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:36,943 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:36,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67184037] [2021-05-03 00:15:36,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [67184037] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:36,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:36,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:15:36,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692417560] [2021-05-03 00:15:36,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:15:36,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:15:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:15:36,945 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:37,746 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2021-05-03 00:15:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:15:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-03 00:15:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:37,747 INFO L225 Difference]: With dead ends: 81 [2021-05-03 00:15:37,747 INFO L226 Difference]: Without dead ends: 0 [2021-05-03 00:15:37,748 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 740.1ms TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:15:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-03 00:15:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-03 00:15:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-03 00:15:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-03 00:15:37,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2021-05-03 00:15:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:37,749 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-03 00:15:37,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-03 00:15:37,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-03 00:15:37,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:15:37,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-03 00:15:38,907 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2021-05-03 00:15:39,033 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2021-05-03 00:15:39,038 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-05-03 00:15:39,038 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-05-03 00:15:39,038 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,038 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,038 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:15:39,039 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: (or (= main_~v~0 6) (= 7 main_~v~0) (= main_~v~0 0) (= 5 main_~v~0) (= main_~v~0 8) (= main_~v~0 3) (= main_~v~0 4) (= main_~v~0 1) (= main_~v~0 9) (= main_~v~0 2)) [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L23-3(line 23) the Hoare annotation is: (or (= main_~v~0 6) (= 7 main_~v~0) (= main_~v~0 0) (= 5 main_~v~0) (= main_~v~0 8) (= main_~v~0 3) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1)))) (= main_~v~0 4) (= main_~v~0 1) (= main_~v~0 9) (= main_~v~0 2)) [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1)))) [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L19-2(lines 19 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L19-3(lines 19 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,039 INFO L201 CegarLoopUtils]: At program point L19-4(lines 19 25) the Hoare annotation is: true [2021-05-03 00:15:39,039 INFO L194 CegarLoopUtils]: At program point L24(lines 22 25) the Hoare annotation is: (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1)))) [2021-05-03 00:15:39,040 INFO L194 CegarLoopUtils]: At program point L20-2(lines 20 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,040 INFO L194 CegarLoopUtils]: At program point L20-3(lines 20 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,040 INFO L194 CegarLoopUtils]: At program point L21-2(lines 21 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,040 INFO L194 CegarLoopUtils]: At program point L21-3(lines 21 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,041 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2021-05-03 00:15:39,041 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point L22-2(lines 22 25) the Hoare annotation is: (or (= main_~v~0 0) (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* 4294967296 .cse0) (* 4294967296 (div (+ (* main_~v~0 (- 1)) 10) (- 4294967296))) 10) main_~v~0) (< 0 (+ .cse0 1))))) [2021-05-03 00:15:39,041 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point L7(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point L6(lines 6 8) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2021-05-03 00:15:39,041 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) [2021-05-03 00:15:39,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:15:39 BoogieIcfgContainer [2021-05-03 00:15:39,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-03 00:15:39,072 INFO L168 Benchmark]: Toolchain (without parser) took 10924.45 ms. Allocated memory was 182.5 MB in the beginning and 320.9 MB in the end (delta: 138.4 MB). Free memory was 147.2 MB in the beginning and 259.8 MB in the end (delta: -112.6 MB). Peak memory consumption was 171.7 MB. Max. memory is 8.0 GB. [2021-05-03 00:15:39,072 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 182.5 MB. Free memory was 164.2 MB in the beginning and 164.1 MB in the end (delta: 102.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-03 00:15:39,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.01 ms. Allocated memory is still 182.5 MB. Free memory was 146.9 MB in the beginning and 137.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-03 00:15:39,072 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 ms. Allocated memory is still 182.5 MB. Free memory was 137.5 MB in the beginning and 165.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. [2021-05-03 00:15:39,072 INFO L168 Benchmark]: RCFGBuilder took 373.60 ms. Allocated memory is still 182.5 MB. Free memory was 165.5 MB in the beginning and 150.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-05-03 00:15:39,072 INFO L168 Benchmark]: TraceAbstraction took 10164.52 ms. Allocated memory was 182.5 MB in the beginning and 320.9 MB in the end (delta: 138.4 MB). Free memory was 149.8 MB in the beginning and 259.8 MB in the end (delta: -110.0 MB). Peak memory consumption was 174.6 MB. Max. memory is 8.0 GB. [2021-05-03 00:15:39,073 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 182.5 MB. Free memory was 164.2 MB in the beginning and 164.1 MB in the end (delta: 102.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 313.01 ms. Allocated memory is still 182.5 MB. Free memory was 146.9 MB in the beginning and 137.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.88 ms. Allocated memory is still 182.5 MB. Free memory was 137.5 MB in the beginning and 165.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 373.60 ms. Allocated memory is still 182.5 MB. Free memory was 165.5 MB in the beginning and 150.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10164.52 ms. Allocated memory was 182.5 MB in the beginning and 320.9 MB in the end (delta: 138.4 MB). Free memory was 149.8 MB in the beginning and 259.8 MB in the end (delta: -110.0 MB). Peak memory consumption was 174.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8788.2ms, OverallIterations: 11, TraceHistogramMax: 9, EmptinessCheckTime: 16.5ms, AutomataDifference: 3734.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1286.6ms, InitialAbstractionConstructionTime: 10.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 265 SDtfs, 508 SDslu, 459 SDs, 0 SdLazy, 3042 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1516.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 53 SyntacticMatches, 46 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 3426.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=10, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 130.1ms AutomataMinimizationTime, 11 MinimizatonAttempts, 72 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 94 PreInvPairs, 138 NumberOfFragments, 474 HoareAnnotationTreeSize, 94 FomulaSimplifications, 572751 FormulaSimplificationTreeSizeReduction, 394.7ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 1434 FormulaSimplificationTreeSizeReductionInter, 872.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: v == 0 || (4294967296 * (v / 4294967296) + 4294967296 * ((v * -1 + 10) / -4294967296) + 10 <= v && 0 < v / 4294967296 + 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: v == 0 || (4294967296 * (v / 4294967296) + 4294967296 * ((v * -1 + 10) / -4294967296) + 10 <= v && 0 < v / 4294967296 + 1) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((v == 6 || 7 == v) || v == 0) || 5 == v) || v == 8) || v == 3) || (4294967296 * (v / 4294967296) + 4294967296 * ((v * -1 + 10) / -4294967296) + 10 <= v && 0 < v / 4294967296 + 1)) || v == 4) || v == 1) || v == 9) || v == 2 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: v == 0 || (4294967296 * (v / 4294967296) + 4294967296 * ((v * -1 + 10) / -4294967296) + 10 <= v && 0 < v / 4294967296 + 1) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v == 0 || (4294967296 * (v / 4294967296) + 4294967296 * ((v * -1 + 10) / -4294967296) + 10 <= v && 0 < v / 4294967296 + 1) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (cond + 2 <= 0 || (!(2 <= \old(cond)) && !(\old(cond) + 2 <= 0))) || 2 <= cond RESULT: Ultimate proved your program to be correct! Received shutdown request...