/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:45:35,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:45:35,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:45:35,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:45:35,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:45:35,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:45:35,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:45:35,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:45:35,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:45:35,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:45:35,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:45:35,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:45:35,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:45:35,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:45:35,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:45:35,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:45:35,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:45:35,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:45:35,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:45:35,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:45:35,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:45:35,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:45:35,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:45:35,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:45:35,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:45:35,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:45:35,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:45:35,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:45:35,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:45:35,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:45:35,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:45:35,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:45:35,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:45:35,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:45:35,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:45:35,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:45:35,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:45:35,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:45:35,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:45:35,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:45:35,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:45:35,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:45:35,139 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:45:35,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:45:35,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:45:35,142 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:45:35,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:45:35,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:45:35,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:45:35,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:45:35,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:45:35,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:45:35,143 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:45:35,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:45:35,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:45:35,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:45:35,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:45:35,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:45:35,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:45:35,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:45:35,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:45:35,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:45:35,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:45:35,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:45:35,145 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:45:35,145 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:45:35,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:45:35,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:45:35,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:45:35,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:45:35,527 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:45:35,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet.i [2021-05-02 23:45:35,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb522f495/40e8fba291cc4151bd93e8ef0ae2f1d2/FLAGd78d06ac3 [2021-05-02 23:45:36,050 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:45:36,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i [2021-05-02 23:45:36,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb522f495/40e8fba291cc4151bd93e8ef0ae2f1d2/FLAGd78d06ac3 [2021-05-02 23:45:36,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb522f495/40e8fba291cc4151bd93e8ef0ae2f1d2 [2021-05-02 23:45:36,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:45:36,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:45:36,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:45:36,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:45:36,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:45:36,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3904051c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36, skipping insertion in model container [2021-05-02 23:45:36,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:45:36,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:45:36,673 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i[891,904] [2021-05-02 23:45:36,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:45:36,700 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:45:36,714 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i[891,904] [2021-05-02 23:45:36,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:45:36,738 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:45:36,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36 WrapperNode [2021-05-02 23:45:36,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:45:36,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:45:36,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:45:36,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:45:36,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... [2021-05-02 23:45:36,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:45:36,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:45:36,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:45:36,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:45:36,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:45:36,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:45:36,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:45:36,907 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:45:36,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:45:36,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:45:36,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:45:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:45:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:45:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:45:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:45:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:45:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:45:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:45:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:45:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:45:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:45:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:45:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:45:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:45:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:45:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:45:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:45:37,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:45:37,251 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:45:37,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:45:37 BoogieIcfgContainer [2021-05-02 23:45:37,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:45:37,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:45:37,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:45:37,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:45:37,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:45:36" (1/3) ... [2021-05-02 23:45:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caed98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:45:37, skipping insertion in model container [2021-05-02 23:45:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:45:36" (2/3) ... [2021-05-02 23:45:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caed98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:45:37, skipping insertion in model container [2021-05-02 23:45:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:45:37" (3/3) ... [2021-05-02 23:45:37,278 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i [2021-05-02 23:45:37,284 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:45:37,288 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:45:37,341 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:45:37,383 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:45:37,384 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:45:37,384 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:45:37,384 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:45:37,384 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:45:37,384 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:45:37,384 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:45:37,384 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:45:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:45:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:45:37,426 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:45:37,427 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:45:37,428 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:45:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:45:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2089905556, now seen corresponding path program 1 times [2021-05-02 23:45:37,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:45:37,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515365226] [2021-05-02 23:45:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:45:37,549 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:45:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:37,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:45:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:45:37,848 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:45:37,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515365226] [2021-05-02 23:45:37,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1515365226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:45:37,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:45:37,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:45:37,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105236725] [2021-05-02 23:45:37,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:45:37,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:45:37,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:45:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:45:37,873 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:45:38,061 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-05-02 23:45:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:45:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:45:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:45:38,074 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:45:38,075 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:45:38,079 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 130.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:45:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:45:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-05-02 23:45:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-05-02 23:45:38,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2021-05-02 23:45:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:45:38,136 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-05-02 23:45:38,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-05-02 23:45:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:45:38,137 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:45:38,138 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:45:38,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:45:38,139 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:45:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:45:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash -545306800, now seen corresponding path program 1 times [2021-05-02 23:45:38,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:45:38,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626339016] [2021-05-02 23:45:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:45:38,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_7 1000000) (<= |v_main_#t~nondet3_4| 2147483647) (<= 1 |v_main_#t~nondet3_4|) (<= 0 (+ |v_main_#t~nondet3_4| 2147483648)) (< |v_main_#t~nondet3_4| 1000000)) InVars {main_~i~0=v_main_~i~0_7, main_#t~nondet3=|v_main_#t~nondet3_4|} OutVars{main_~i~0=v_main_~i~0_7, main_#t~nondet3=|v_main_#t~nondet3_4|} AuxVars[] AssignedVars[] [2021-05-02 23:45:38,305 WARN L240 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size [2021-05-02 23:45:38,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:38,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:38,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-02 23:45:38,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:45:38,382 WARN L245 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size 80 [2021-05-02 23:45:38,420 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:38,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:45:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:45:38,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:38,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:38,558 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:45:38,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626339016] [2021-05-02 23:45:38,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1626339016] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:45:38,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:45:38,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:45:38,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726859771] [2021-05-02 23:45:38,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:45:38,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:45:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:45:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:45:38,562 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:45:38,736 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-05-02 23:45:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:45:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:45:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:45:38,738 INFO L225 Difference]: With dead ends: 21 [2021-05-02 23:45:38,738 INFO L226 Difference]: Without dead ends: 16 [2021-05-02 23:45:38,742 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 144.4ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:45:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-02 23:45:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-02 23:45:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-05-02 23:45:38,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2021-05-02 23:45:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:45:38,753 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-05-02 23:45:38,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-05-02 23:45:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:45:38,757 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:45:38,757 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:45:38,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:45:38,759 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:45:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:45:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1046323724, now seen corresponding path program 2 times [2021-05-02 23:45:38,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:45:38,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734331394] [2021-05-02 23:45:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:45:38,795 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 0 (+ |v_main_#t~nondet3_8| 2147483648)) (<= |v_main_#t~nondet3_8| 2147483647) (< v_main_~j~0_8 1000000) (<= 1 v_main_~j~0_8) (< (+ v_main_~j~0_8 v_main_~i~0_11) 1000000)) InVars {main_~i~0=v_main_~i~0_11, main_#t~nondet3=|v_main_#t~nondet3_8|, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_11, main_#t~nondet3=|v_main_#t~nondet3_8|, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:45:38,814 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size [2021-05-02 23:45:38,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:38,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-02 23:45:38,923 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size 87 [2021-05-02 23:45:38,979 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:39,003 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 0 (+ |v_main_#t~nondet3_10| 2147483648)) (< |v_main_#t~nondet3_10| 1000000) (< v_main_~i~0_13 1000000) (<= 1 |v_main_#t~nondet3_10|) (<= |v_main_#t~nondet3_10| 2147483647)) InVars {main_~i~0=v_main_~i~0_13, main_#t~nondet3=|v_main_#t~nondet3_10|} OutVars{main_~i~0=v_main_~i~0_13, main_#t~nondet3=|v_main_#t~nondet3_10|} AuxVars[] AssignedVars[] [2021-05-02 23:45:39,014 WARN L240 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size [2021-05-02 23:45:39,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:39,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:39,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-02 23:45:39,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:45:39,101 WARN L245 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size 80 [2021-05-02 23:45:39,137 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:39,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:45:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:45:39,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:39,433 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:45:39,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734331394] [2021-05-02 23:45:39,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [734331394] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:45:39,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:45:39,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:45:39,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715100887] [2021-05-02 23:45:39,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:45:39,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:45:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:45:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:45:39,436 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:45:39,750 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2021-05-02 23:45:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:45:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 23:45:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:45:39,752 INFO L225 Difference]: With dead ends: 23 [2021-05-02 23:45:39,752 INFO L226 Difference]: Without dead ends: 18 [2021-05-02 23:45:39,753 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 391.1ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:45:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-05-02 23:45:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-05-02 23:45:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-05-02 23:45:39,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2021-05-02 23:45:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:45:39,758 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-05-02 23:45:39,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-05-02 23:45:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:45:39,759 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:45:39,759 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:45:39,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:45:39,760 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:45:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:45:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1594899912, now seen corresponding path program 3 times [2021-05-02 23:45:39,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:45:39,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541065026] [2021-05-02 23:45:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:45:39,773 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~j~0_15 1000000) (< (+ v_main_~j~0_15 v_main_~i~0_18) 1000000) (<= |v_main_#t~nondet3_15| 2147483647) (<= 1 v_main_~j~0_15) (<= 0 (+ |v_main_#t~nondet3_15| 2147483648))) InVars {main_~i~0=v_main_~i~0_18, main_#t~nondet3=|v_main_#t~nondet3_15|, main_~j~0=v_main_~j~0_15} OutVars{main_~i~0=v_main_~i~0_18, main_#t~nondet3=|v_main_#t~nondet3_15|, main_~j~0=v_main_~j~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:45:39,779 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size [2021-05-02 23:45:39,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:39,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-02 23:45:39,835 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size 87 [2021-05-02 23:45:39,872 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:39,881 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_20 1000000) (< |v_main_#t~nondet3_17| 1000000) (<= |v_main_#t~nondet3_17| 2147483647) (<= 0 (+ |v_main_#t~nondet3_17| 2147483648)) (<= 1 |v_main_#t~nondet3_17|)) InVars {main_~i~0=v_main_~i~0_20, main_#t~nondet3=|v_main_#t~nondet3_17|} OutVars{main_~i~0=v_main_~i~0_20, main_#t~nondet3=|v_main_#t~nondet3_17|} AuxVars[] AssignedVars[] [2021-05-02 23:45:39,889 WARN L240 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size [2021-05-02 23:45:39,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:39,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:39,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-02 23:45:39,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:45:39,960 WARN L245 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size 80 [2021-05-02 23:45:39,994 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:40,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:45:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:45:40,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:40,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:40,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:40,358 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:45:40,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541065026] [2021-05-02 23:45:40,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [541065026] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:45:40,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:45:40,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:45:40,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578252231] [2021-05-02 23:45:40,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:45:40,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:45:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:45:40,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:45:40,361 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:40,615 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2021-05-02 23:45:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:45:40,942 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2021-05-02 23:45:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:45:40,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:45:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:45:40,944 INFO L225 Difference]: With dead ends: 25 [2021-05-02 23:45:40,944 INFO L226 Difference]: Without dead ends: 20 [2021-05-02 23:45:40,945 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 633.4ms TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:45:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-02 23:45:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-02 23:45:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-05-02 23:45:40,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2021-05-02 23:45:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:45:40,955 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-05-02 23:45:40,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-05-02 23:45:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:45:40,956 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:45:40,956 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:45:40,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:45:40,956 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:45:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:45:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash 495639172, now seen corresponding path program 4 times [2021-05-02 23:45:40,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:45:40,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548401089] [2021-05-02 23:45:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:45:40,970 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~i~0_26 v_main_~j~0_23) 1000000) (<= |v_main_#t~nondet3_23| 2147483647) (<= 1 v_main_~j~0_23) (<= 0 (+ |v_main_#t~nondet3_23| 2147483648)) (< v_main_~j~0_23 1000000)) InVars {main_~i~0=v_main_~i~0_26, main_#t~nondet3=|v_main_#t~nondet3_23|, main_~j~0=v_main_~j~0_23} OutVars{main_~i~0=v_main_~i~0_26, main_#t~nondet3=|v_main_#t~nondet3_23|, main_~j~0=v_main_~j~0_23} AuxVars[] AssignedVars[] [2021-05-02 23:45:40,976 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size [2021-05-02 23:45:40,979 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:40,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-02 23:45:41,053 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.6 percent of original size 87 [2021-05-02 23:45:41,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:41,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~i~0_28 1000000) (<= 1 |v_main_#t~nondet3_25|) (<= 0 (+ |v_main_#t~nondet3_25| 2147483648)) (<= |v_main_#t~nondet3_25| 2147483647) (< |v_main_#t~nondet3_25| 1000000)) InVars {main_~i~0=v_main_~i~0_28, main_#t~nondet3=|v_main_#t~nondet3_25|} OutVars{main_~i~0=v_main_~i~0_28, main_#t~nondet3=|v_main_#t~nondet3_25|} AuxVars[] AssignedVars[] [2021-05-02 23:45:41,102 WARN L240 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size [2021-05-02 23:45:41,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:41,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:45:41,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-02 23:45:41,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-05-02 23:45:41,173 WARN L245 tifierPushTermWalker]: treesize reduction 50, result has 61.5 percent of original size 80 [2021-05-02 23:45:41,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:45:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:41,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:45:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:45:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:45:41,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,264 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,398 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:45:41,740 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:45:41,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548401089] [2021-05-02 23:45:41,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [548401089] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:45:41,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:45:41,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:45:41,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433144148] [2021-05-02 23:45:41,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:45:41,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:45:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:45:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:45:41,742 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:45:42,270 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-05-02 23:45:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:45:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 23:45:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:45:42,271 INFO L225 Difference]: With dead ends: 20 [2021-05-02 23:45:42,271 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:45:42,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 833.7ms TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:45:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:45:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:45:42,272 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-02 23:45:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:45:42,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-05-02 23:45:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:45:42,273 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:45:42,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:45:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:45:42,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:45:42,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:45:42,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:45:42,664 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-05-02 23:45:42,904 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-05-02 23:45:42,978 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:45:42,979 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:45:42,979 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:45:42,979 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,979 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-02 23:45:42,979 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,979 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,979 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,980 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,980 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:45:42,980 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:45:42,980 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:45:42,980 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:45:42,980 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:45:42,980 INFO L201 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-05-02 23:45:42,980 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2021-05-02 23:45:42,980 INFO L194 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= 0 (+ main_~j~0 2147483648))) (.cse1 (< main_~i~0 1000000)) (.cse2 (<= main_~j~0 2147483647))) (or (and .cse0 .cse1 .cse2 (exists ((v_main_~j~0_21 Int)) (and (<= 1 v_main_~j~0_21) (< main_~i~0 (+ v_main_~j~0_21 1000000)) (< v_main_~j~0_21 1000000) (<= (+ v_main_~j~0_21 1) main_~i~0))) (= main_~k~0 2)) (and (exists ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (and (< v_main_~j~0_28 1000000) (< main_~i~0 (+ v_main_~j~0_29 1000000)) (<= 1 v_main_~j~0_28) (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 1000000)) (<= (+ v_main_~j~0_29 v_main_~j~0_28 1) main_~i~0) (<= 1 v_main_~j~0_29) (< v_main_~j~0_29 1000000))) .cse0 .cse1 .cse2) (and .cse0 (= main_~k~0 0) (= main_~i~0 0) .cse2) (and .cse0 (<= 1 main_~i~0) (= main_~k~0 1) .cse1 .cse2))) [2021-05-02 23:45:42,980 INFO L194 CegarLoopUtils]: At program point L27-2(lines 27 32) the Hoare annotation is: (let ((.cse1 (< main_~i~0 (+ main_~j~0 1000000))) (.cse0 (<= 1 main_~j~0)) (.cse2 (< main_~j~0 1000000))) (or (and .cse0 .cse1 (<= (+ main_~j~0 1) main_~i~0) .cse2 (= main_~k~0 2)) (and .cse0 (exists ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (and (< main_~i~0 (+ v_main_~j~0_29 main_~j~0 1000000)) (< v_main_~j~0_28 1000000) (<= 1 v_main_~j~0_28) (<= (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1) main_~i~0) (<= 1 v_main_~j~0_29) (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1000000)) (< v_main_~j~0_29 1000000))) .cse1 .cse2) (and (= main_~k~0 0) (= main_~i~0 0)) (and .cse0 (= main_~k~0 3) (exists ((v_main_~j~0_21 Int)) (and (<= 1 v_main_~j~0_21) (< v_main_~j~0_21 1000000) (< main_~i~0 (+ main_~j~0 v_main_~j~0_21 1000000)) (<= (+ main_~j~0 v_main_~j~0_21 1) main_~i~0))) .cse1 .cse2) (and .cse0 (= main_~k~0 1) (= main_~i~0 main_~j~0) .cse2))) [2021-05-02 23:45:42,981 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 35) the Hoare annotation is: true [2021-05-02 23:45:42,981 INFO L194 CegarLoopUtils]: At program point L27-3(lines 27 32) the Hoare annotation is: (and (<= 1000000 main_~i~0) (exists ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (and (< main_~i~0 (+ v_main_~j~0_29 main_~j~0 1000000)) (< v_main_~j~0_28 1000000) (<= 1 v_main_~j~0_28) (<= (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1) main_~i~0) (<= 1 v_main_~j~0_29) (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1000000)) (< v_main_~j~0_29 1000000))) (< main_~i~0 (+ main_~j~0 1000000)) (< main_~j~0 1000000)) [2021-05-02 23:45:42,981 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 35) the Hoare annotation is: true [2021-05-02 23:45:42,981 INFO L201 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2021-05-02 23:45:42,981 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:45:42,981 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2021-05-02 23:45:42,981 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (or (not (< main_~i~0 (+ main_~j~0 1000000))) (forall ((v_main_~k~0_34 Int)) (not (= (ite (<= v_main_~k~0_34 1000000) 1 0) |__VERIFIER_assert_#in~cond|))) (forall ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (or (not (< main_~i~0 (+ v_main_~j~0_29 main_~j~0 1000000))) (not (< v_main_~j~0_28 1000000)) (not (<= (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1) main_~i~0)) (not (<= 1 v_main_~j~0_29)) (not (<= 1 v_main_~j~0_28)) (not (< v_main_~j~0_29 1000000)) (not (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1000000))))) (not (<= 1000000 main_~i~0)) (and (= __VERIFIER_assert_~cond 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (not (< main_~j~0 1000000))) [2021-05-02 23:45:42,981 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (or (not (< main_~i~0 (+ main_~j~0 1000000))) (forall ((v_main_~k~0_34 Int)) (not (= (ite (<= v_main_~k~0_34 1000000) 1 0) |__VERIFIER_assert_#in~cond|))) (forall ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (or (not (< main_~i~0 (+ v_main_~j~0_29 main_~j~0 1000000))) (not (< v_main_~j~0_28 1000000)) (not (<= (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1) main_~i~0)) (not (<= 1 v_main_~j~0_29)) (not (<= 1 v_main_~j~0_28)) (not (< v_main_~j~0_29 1000000)) (not (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1000000))))) (not (<= 1000000 main_~i~0)) (not (< main_~j~0 1000000))) [2021-05-02 23:45:42,981 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (not (< main_~i~0 (+ main_~j~0 1000000))) (forall ((v_main_~k~0_34 Int)) (not (= (ite (<= v_main_~k~0_34 1000000) 1 0) |__VERIFIER_assert_#in~cond|))) (forall ((v_main_~j~0_29 Int) (v_main_~j~0_28 Int)) (or (not (< main_~i~0 (+ v_main_~j~0_29 main_~j~0 1000000))) (not (< v_main_~j~0_28 1000000)) (not (<= (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1) main_~i~0)) (not (<= 1 v_main_~j~0_29)) (not (<= 1 v_main_~j~0_28)) (not (< v_main_~j~0_29 1000000)) (not (< main_~i~0 (+ v_main_~j~0_29 v_main_~j~0_28 main_~j~0 1000000))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1000000 main_~i~0)) (not (< main_~j~0 1000000))) [2021-05-02 23:45:42,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:42,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:42,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:42,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:42,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:42,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:45:43 BoogieIcfgContainer [2021-05-02 23:45:43,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:45:43,008 INFO L168 Benchmark]: Toolchain (without parser) took 6530.48 ms. Allocated memory was 199.2 MB in the beginning and 298.8 MB in the end (delta: 99.6 MB). Free memory was 164.8 MB in the beginning and 204.7 MB in the end (delta: -39.9 MB). Peak memory consumption was 120.3 MB. Max. memory is 8.0 GB. [2021-05-02 23:45:43,008 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 199.2 MB. Free memory is still 181.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:45:43,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.87 ms. Allocated memory is still 199.2 MB. Free memory was 164.6 MB in the beginning and 155.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:45:43,009 INFO L168 Benchmark]: Boogie Preprocessor took 89.81 ms. Allocated memory is still 199.2 MB. Free memory was 155.2 MB in the beginning and 182.7 MB in the end (delta: -27.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:45:43,009 INFO L168 Benchmark]: RCFGBuilder took 421.25 ms. Allocated memory is still 199.2 MB. Free memory was 182.7 MB in the beginning and 168.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-05-02 23:45:43,009 INFO L168 Benchmark]: TraceAbstraction took 5752.69 ms. Allocated memory was 199.2 MB in the beginning and 298.8 MB in the end (delta: 99.6 MB). Free memory was 168.6 MB in the beginning and 204.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 125.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:45:43,015 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.13 ms. Allocated memory is still 199.2 MB. Free memory is still 181.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 255.87 ms. Allocated memory is still 199.2 MB. Free memory was 164.6 MB in the beginning and 155.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 89.81 ms. Allocated memory is still 199.2 MB. Free memory was 155.2 MB in the beginning and 182.7 MB in the end (delta: -27.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 421.25 ms. Allocated memory is still 199.2 MB. Free memory was 182.7 MB in the beginning and 168.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5752.69 ms. Allocated memory was 199.2 MB in the beginning and 298.8 MB in the end (delta: 99.6 MB). Free memory was 168.6 MB in the beginning and 204.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 125.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4894.3ms, OverallIterations: 5, TraceHistogramMax: 4, EmptinessCheckTime: 25.5ms, AutomataDifference: 1834.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 703.6ms, InitialAbstractionConstructionTime: 21.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 71 SDslu, 136 SDs, 0 SdLazy, 324 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 339.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2133.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 65.4ms AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 44 PreInvPairs, 67 NumberOfFragments, 524 HoareAnnotationTreeSize, 44 FomulaSimplifications, 280 FormulaSimplificationTreeSizeReduction, 73.8ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 852 FormulaSimplificationTreeSizeReductionInter, 605.9ms 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: 27]: Loop Invariant [2021-05-02 23:45:43,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] [2021-05-02 23:45:43,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_21,QUANTIFIED] Derived loop invariant: (((((((1 <= j && i < j + 1000000) && j + 1 <= i) && j < 1000000) && k == 2) || (((1 <= j && (\exists v_main_~j~0_29 : int, v_main_~j~0_28 : int :: (((((i < v_main_~j~0_29 + j + 1000000 && v_main_~j~0_28 < 1000000) && 1 <= v_main_~j~0_28) && v_main_~j~0_29 + v_main_~j~0_28 + j + 1 <= i) && 1 <= v_main_~j~0_29) && i < v_main_~j~0_29 + v_main_~j~0_28 + j + 1000000) && v_main_~j~0_29 < 1000000)) && i < j + 1000000) && j < 1000000)) || (k == 0 && i == 0)) || ((((1 <= j && k == 3) && (\exists v_main_~j~0_21 : int :: ((1 <= v_main_~j~0_21 && v_main_~j~0_21 < 1000000) && i < j + v_main_~j~0_21 + 1000000) && j + v_main_~j~0_21 + 1 <= i)) && i < j + 1000000) && j < 1000000)) || (((1 <= j && k == 1) && i == j) && j < 1000000) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...