/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-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:34:57,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:34:57,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:34:57,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:34:57,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:34:57,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:34:57,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:34:57,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:34:57,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:34:57,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:34:57,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:34:57,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:34:57,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:34:57,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:34:57,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:34:57,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:34:57,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:34:57,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:34:57,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:34:57,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:34:57,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:34:57,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:34:57,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:34:57,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:34:57,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:34:57,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:34:57,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:34:57,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:34:57,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:34:57,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:34:57,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:34:57,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:34:57,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:34:57,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:34:57,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:34:57,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:34:57,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:34:57,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:34:57,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:34:57,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:34:57,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:34:57,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:34:57,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:34:57,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:34:57,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:34:57,544 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:34:57,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:34:57,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:34:57,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:34:57,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:34:57,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:34:57,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:34:57,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:34:57,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:34:57,546 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:34:57,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:34:57,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:34:57,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:34:57,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:34:57,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:34:57,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:34:57,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:34:57,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:34:57,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:34:57,548 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:34:57,548 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-06 11:34:57,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:34:57,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:34:57,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:34:57,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:34:57,896 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:34:57,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2021-05-06 11:34:57,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979288c89/aef8f4e3b22a4bdf80d7ba8d9629af8d/FLAG8a6a2d404 [2021-05-06 11:34:58,590 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:34:58,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2021-05-06 11:34:58,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979288c89/aef8f4e3b22a4bdf80d7ba8d9629af8d/FLAG8a6a2d404 [2021-05-06 11:34:58,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979288c89/aef8f4e3b22a4bdf80d7ba8d9629af8d [2021-05-06 11:34:58,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:34:58,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:34:58,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:34:58,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:34:58,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:34:58,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:34:58" (1/1) ... [2021-05-06 11:34:58,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66faa45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:58, skipping insertion in model container [2021-05-06 11:34:58,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:34:58" (1/1) ... [2021-05-06 11:34:58,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:34:58,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:34:58,934 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-invgen/apache-get-tag.i[893,906] [2021-05-06 11:34:58,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:34:58,975 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:34:58,988 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-invgen/apache-get-tag.i[893,906] [2021-05-06 11:34:59,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:34:59,031 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:34:59,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59 WrapperNode [2021-05-06 11:34:59,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:34:59,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:34:59,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:34:59,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:34:59,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (1/1) ... [2021-05-06 11:34:59,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:34:59,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:34:59,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:34:59,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:34:59,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (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-06 11:34:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:34:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:34:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:34:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:34:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:34:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:34:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:34:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:34:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-06 11:34:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-06 11:34:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:34:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:34:59,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:34:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:34:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:34:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:34:59,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:34:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:34:59,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:34:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:34:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:34:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:34:59,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:34:59,451 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 11:34:59,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:34:59 BoogieIcfgContainer [2021-05-06 11:34:59,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:34:59,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:34:59,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:34:59,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:34:59,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:34:58" (1/3) ... [2021-05-06 11:34:59,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756e737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:34:59, skipping insertion in model container [2021-05-06 11:34:59,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:59" (2/3) ... [2021-05-06 11:34:59,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756e737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:34:59, skipping insertion in model container [2021-05-06 11:34:59,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:34:59" (3/3) ... [2021-05-06 11:34:59,459 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2021-05-06 11:34:59,464 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:34:59,467 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:34:59,480 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:34:59,497 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:34:59,497 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:34:59,497 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:34:59,497 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:34:59,497 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:34:59,497 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:34:59,497 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:34:59,497 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:34:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-06 11:34:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-06 11:34:59,514 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:59,515 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:59,515 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:59,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2021-05-06 11:34:59,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:59,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703549634] [2021-05-06 11:34:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:59,597 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:59,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:59,795 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-06 11:34:59,797 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:59,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703549634] [2021-05-06 11:34:59,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1703549634] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:59,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:59,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 11:34:59,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561005415] [2021-05-06 11:34:59,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 11:34:59,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 11:34:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:34:59,819 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-06 11:35:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:00,061 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2021-05-06 11:35:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 11:35:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-06 11:35:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:00,070 INFO L225 Difference]: With dead ends: 88 [2021-05-06 11:35:00,071 INFO L226 Difference]: Without dead ends: 43 [2021-05-06 11:35:00,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:35:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-06 11:35:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-06 11:35:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-06 11:35:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-06 11:35:00,113 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2021-05-06 11:35:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:00,113 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-06 11:35:00,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-06 11:35:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-06 11:35:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:35:00,114 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:00,114 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:00,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:35:00,115 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2021-05-06 11:35:00,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:00,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575052850] [2021-05-06 11:35:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:00,118 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:00,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:00,221 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-06 11:35:00,222 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:00,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575052850] [2021-05-06 11:35:00,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1575052850] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:00,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:00,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:35:00,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621922015] [2021-05-06 11:35:00,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:35:00,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:35:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:35:00,224 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:35:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:00,528 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2021-05-06 11:35:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:35:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2021-05-06 11:35:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:00,533 INFO L225 Difference]: With dead ends: 49 [2021-05-06 11:35:00,533 INFO L226 Difference]: Without dead ends: 47 [2021-05-06 11:35:00,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 110.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:35:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-06 11:35:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-06 11:35:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-06 11:35:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2021-05-06 11:35:00,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2021-05-06 11:35:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:00,563 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2021-05-06 11:35:00,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:35:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2021-05-06 11:35:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 11:35:00,565 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:00,565 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:00,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:35:00,566 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2021-05-06 11:35:00,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:00,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1967127533] [2021-05-06 11:35:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:00,578 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:00,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:00,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:35:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:00,750 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-06 11:35:00,750 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:00,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1967127533] [2021-05-06 11:35:00,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1967127533] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:00,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:00,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:35:00,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988715020] [2021-05-06 11:35:00,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:35:00,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:00,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:35:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:35:00,754 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:35:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:01,141 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2021-05-06 11:35:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:35:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-05-06 11:35:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:01,144 INFO L225 Difference]: With dead ends: 62 [2021-05-06 11:35:01,144 INFO L226 Difference]: Without dead ends: 50 [2021-05-06 11:35:01,144 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 194.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:35:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-06 11:35:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-05-06 11:35:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-06 11:35:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2021-05-06 11:35:01,154 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2021-05-06 11:35:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:01,154 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-05-06 11:35:01,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:35:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2021-05-06 11:35:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 11:35:01,155 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:01,155 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:01,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:35:01,156 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2021-05-06 11:35:01,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:01,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1690187670] [2021-05-06 11:35:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:01,158 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 11:35:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,241 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-06 11:35:01,241 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:01,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1690187670] [2021-05-06 11:35:01,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1690187670] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:01,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:01,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:35:01,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691476438] [2021-05-06 11:35:01,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:35:01,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:35:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:35:01,243 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:35:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:01,614 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2021-05-06 11:35:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:35:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-06 11:35:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:01,616 INFO L225 Difference]: With dead ends: 60 [2021-05-06 11:35:01,617 INFO L226 Difference]: Without dead ends: 58 [2021-05-06 11:35:01,617 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-06 11:35:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-06 11:35:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2021-05-06 11:35:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-06 11:35:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-05-06 11:35:01,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2021-05-06 11:35:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:01,629 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-05-06 11:35:01,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:35:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-05-06 11:35:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 11:35:01,630 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:01,631 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:01,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:35:01,631 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2021-05-06 11:35:01,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:01,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070474846] [2021-05-06 11:35:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:01,682 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.1 percent of original size [2021-05-06 11:35:01,712 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:01,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:01,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-06 11:35:01,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:01,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-06 11:35:01,759 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-06 11:35:01,777 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.1 percent of original size 82 [2021-05-06 11:35:01,799 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:35:01,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:35:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:35:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:01,899 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-06 11:35:02,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:02,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:05,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:05,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:09,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:10,870 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:10,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070474846] [2021-05-06 11:35:10,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070474846] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:10,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:10,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-06 11:35:10,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518668288] [2021-05-06 11:35:10,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-06 11:35:10,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-06 11:35:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=328, Unknown=6, NotChecked=0, Total=420 [2021-05-06 11:35:10,881 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 11:35:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:22,689 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2021-05-06 11:35:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-06 11:35:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2021-05-06 11:35:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:22,690 INFO L225 Difference]: With dead ends: 64 [2021-05-06 11:35:22,691 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:35:22,692 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 15564.3ms TimeCoverageRelationStatistics Valid=182, Invalid=681, Unknown=7, NotChecked=0, Total=870 [2021-05-06 11:35:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:35:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:35:22,692 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-06 11:35:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:35:22,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2021-05-06 11:35:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:22,693 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:35:22,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 11:35:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:35:22,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:35:22,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:35:22,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:35:29,269 WARN L205 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2021-05-06 11:35:41,527 WARN L205 SmtUtils]: Spent 12.13 s on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2021-05-06 11:35:45,728 WARN L205 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2021-05-06 11:35:46,353 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-06 11:35:46,354 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-06 11:35:46,354 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,354 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-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,354 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:35:46,355 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-06 11:35:46,355 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:46,355 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:46,355 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,355 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 77) the Hoare annotation is: true [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L56-1(line 56) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0))) [2021-05-06 11:35:46,355 INFO L194 CegarLoopUtils]: At program point L48-3(lines 48 72) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,356 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,356 INFO L194 CegarLoopUtils]: At program point L69(line 69) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,356 INFO L194 CegarLoopUtils]: At program point L32-2(lines 32 44) the Hoare annotation is: (or (and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0)) (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1)))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L49(lines 49 53) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L201 CegarLoopUtils]: At program point L74(lines 25 77) the Hoare annotation is: true [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,357 INFO L194 CegarLoopUtils]: At program point L66(lines 66 68) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L33(lines 33 37) the Hoare annotation is: (or (and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0)) (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1)))) [2021-05-06 11:35:46,358 INFO L201 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: true [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L54(lines 54 68) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,358 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 77) the Hoare annotation is: true [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,358 INFO L194 CegarLoopUtils]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= 0 main_~tagbuf_len~0) (<= |main_#t~nondet5| 2147483647) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-06 11:35:46,359 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L59(lines 59 63) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0))) [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L55(lines 55 64) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (or (and (< 0 main_~t~0) (< main_~t~0 (+ main_~tagbuf_len~0 1))) (= main_~t~0 0)) (not (= main_~tagbuf_len~0 main_~t~0))) [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (forall ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (or (not (= (ite (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) 1 0) |__VERIFIER_assert_#in~cond|)) (forall ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int)) (or (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (not (= (ite (<= 0 v_main_~t~0_54) 1 0) (ite (<= 0 v_main_~t~0_55) 1 0))) (and (or (not (< v_main_~t~0_54 (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~t~0_54))) (not (= v_main_~t~0_54 0))))))) (and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (and (= (ite (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) 1 0) |__VERIFIER_assert_#in~cond|) (exists ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int)) (and (not (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (= (ite (<= 0 v_main_~t~0_54) 1 0) (ite (<= 0 v_main_~t~0_55) 1 0)) (or (and (< v_main_~t~0_54 (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1)) (< 0 v_main_~t~0_54)) (= v_main_~t~0_54 0)) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1))))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-06 11:35:46,359 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (or (not (= (ite (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) 1 0) |__VERIFIER_assert_#in~cond|)) (forall ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int)) (or (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (not (= (ite (<= 0 v_main_~t~0_54) 1 0) (ite (<= 0 v_main_~t~0_55) 1 0))) (and (or (not (< v_main_~t~0_54 (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~t~0_54))) (not (= v_main_~t~0_54 0)))))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-06 11:35:46,359 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:35:46,360 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:35:46,361 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (forall ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (or (not (= (ite (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) 1 0) |__VERIFIER_assert_#in~cond|)) (forall ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int)) (or (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (not (= (ite (<= 0 v_main_~t~0_54) 1 0) (ite (<= 0 v_main_~t~0_55) 1 0))) (and (or (not (< v_main_~t~0_54 (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~t~0_54))) (not (= v_main_~t~0_54 0))))))) (and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (and (= (ite (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) 1 0) |__VERIFIER_assert_#in~cond|) (exists ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int)) (and (not (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (= (ite (<= 0 v_main_~t~0_54) 1 0) (ite (<= 0 v_main_~t~0_55) 1 0)) (or (and (< v_main_~t~0_54 (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1)) (< 0 v_main_~t~0_54)) (= v_main_~t~0_54 0)) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1))))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-06 11:35:46,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_32,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:35:46 BoogieIcfgContainer [2021-05-06 11:35:46,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:35:46,385 INFO L168 Benchmark]: Toolchain (without parser) took 47629.58 ms. Allocated memory was 182.5 MB in the beginning and 219.2 MB in the end (delta: 36.7 MB). Free memory was 148.2 MB in the beginning and 143.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 110.3 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:46,386 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 182.5 MB. Free memory is still 164.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:35:46,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.69 ms. Allocated memory is still 182.5 MB. Free memory was 148.0 MB in the beginning and 166.6 MB in the end (delta: -18.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:46,392 INFO L168 Benchmark]: Boogie Preprocessor took 48.38 ms. Allocated memory is still 182.5 MB. Free memory was 166.6 MB in the beginning and 165.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:46,392 INFO L168 Benchmark]: RCFGBuilder took 371.44 ms. Allocated memory is still 182.5 MB. Free memory was 165.2 MB in the beginning and 147.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:46,395 INFO L168 Benchmark]: TraceAbstraction took 46930.60 ms. Allocated memory was 182.5 MB in the beginning and 219.2 MB in the end (delta: 36.7 MB). Free memory was 146.3 MB in the beginning and 143.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 108.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:46,396 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.15 ms. Allocated memory is still 182.5 MB. Free memory is still 164.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 271.69 ms. Allocated memory is still 182.5 MB. Free memory was 148.0 MB in the beginning and 166.6 MB in the end (delta: -18.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.38 ms. Allocated memory is still 182.5 MB. Free memory was 166.6 MB in the beginning and 165.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 371.44 ms. Allocated memory is still 182.5 MB. Free memory was 165.2 MB in the beginning and 147.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 46930.60 ms. Allocated memory was 182.5 MB in the beginning and 219.2 MB in the end (delta: 36.7 MB). Free memory was 146.3 MB in the beginning and 143.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 108.0 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_~t~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,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, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23199.1ms, OverallIterations: 5, TraceHistogramMax: 4, EmptinessCheckTime: 11.8ms, AutomataDifference: 13160.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 23659.4ms, InitialAbstractionConstructionTime: 8.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 193 SDtfs, 237 SDslu, 223 SDs, 0 SdLazy, 682 SolverSat, 269 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 5608.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 16098.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 74.7ms AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 48 LocationsWithAnnotation, 258 PreInvPairs, 355 NumberOfFragments, 849 HoareAnnotationTreeSize, 258 FomulaSimplifications, 2181 FormulaSimplificationTreeSizeReduction, 354.7ms HoareSimplificationTime, 48 FomulaSimplificationsInter, 2426 FormulaSimplificationTreeSizeReductionInter, 23262.5ms 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: 32]: Loop Invariant Derived loop invariant: (0 <= tagbuf_len && t == 0) || (0 < t && t < tagbuf_len + 1) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 <= tagbuf_len && ((0 < t && t < tagbuf_len + 1) || t == 0) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_32,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_32,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_55,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] [2021-05-06 11:35:46,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_54,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || \old(cond) == cond) || (forall v_main_~tagbuf_len~0_32 : int, v_main_~t~0_55 : int :: !((if v_main_~t~0_55 <= v_main_~tagbuf_len~0_32 then 1 else 0) == \old(cond)) || (forall v_main_~t~0_54 : int, v_main_~tagbuf_len~0_BEFORE_RETURN_1 : int :: ((v_main_~t~0_54 == v_main_~tagbuf_len~0_BEFORE_RETURN_1 || !(0 <= v_main_~tagbuf_len~0_BEFORE_RETURN_1)) || !((if 0 <= v_main_~t~0_54 then 1 else 0) == (if 0 <= v_main_~t~0_55 then 1 else 0))) || ((!(v_main_~t~0_54 < v_main_~tagbuf_len~0_BEFORE_RETURN_1 + 1) || !(0 < v_main_~t~0_54)) && !(v_main_~t~0_54 == 0))))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! Received shutdown request...