/usr/bin/java -ea -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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:29:34,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:29:34,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:29:34,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:29:34,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:29:34,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:29:34,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:29:34,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:29:34,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:29:34,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:29:34,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:29:34,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:29:34,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:29:34,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:29:34,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:29:34,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:29:34,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:29:34,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:29:34,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:29:34,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:29:34,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:29:34,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:29:34,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:29:34,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:29:34,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:29:34,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:29:34,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:29:34,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:29:34,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:29:34,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:29:34,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:29:34,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:29:34,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:29:34,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:29:34,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:29:34,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:29:34,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:29:34,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:29:34,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:29:34,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:29:34,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:29:34,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:29:34,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:29:34,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:29:34,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:29:34,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:29:34,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:29:34,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:29:34,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:29:34,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:29:34,928 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:29:34,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:29:34,929 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:29:34,929 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; [2022-04-28 09:29:35,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:29:35,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:29:35,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:29:35,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:29:35,151 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:29:35,152 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 [2022-04-28 09:29:35,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918c029c/997c2cf3b2f64608aca849fbf37eadfb/FLAGe0fc2ab05 [2022-04-28 09:29:35,564 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:29:35,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-28 09:29:35,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918c029c/997c2cf3b2f64608aca849fbf37eadfb/FLAGe0fc2ab05 [2022-04-28 09:29:36,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918c029c/997c2cf3b2f64608aca849fbf37eadfb [2022-04-28 09:29:36,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:29:36,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:29:36,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:29:36,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:29:36,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:29:36,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22db5b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36, skipping insertion in model container [2022-04-28 09:29:36,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:29:36,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:29:36,170 WARN L230 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] [2022-04-28 09:29:36,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:29:36,199 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:29:36,219 WARN L230 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] [2022-04-28 09:29:36,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:29:36,245 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:29:36,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36 WrapperNode [2022-04-28 09:29:36,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:29:36,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:29:36,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:29:36,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:29:36,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:29:36,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:29:36,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:29:36,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:29:36,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (1/1) ... [2022-04-28 09:29:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:29:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:29:36,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:29:36,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:29:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:29:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:29:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:29:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:29:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:29:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:29:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:29:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:29:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:29:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:29:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:29:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:29:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:29:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:29:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:29:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:29:36,458 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:29:36,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:29:36,731 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:29:36,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:29:36,736 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:29:36,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:29:36 BoogieIcfgContainer [2022-04-28 09:29:36,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:29:36,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:29:36,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:29:36,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:29:36,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:29:36" (1/3) ... [2022-04-28 09:29:36,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c9a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:29:36, skipping insertion in model container [2022-04-28 09:29:36,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:29:36" (2/3) ... [2022-04-28 09:29:36,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c9a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:29:36, skipping insertion in model container [2022-04-28 09:29:36,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:29:36" (3/3) ... [2022-04-28 09:29:36,750 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-04-28 09:29:36,759 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:29:36,760 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:29:36,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:29:36,808 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c6afd53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23995788 [2022-04-28 09:29:36,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:29:36,823 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) [2022-04-28 09:29:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:29:36,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:36,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:36,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2022-04-28 09:29:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:36,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199975061] [2022-04-28 09:29:36,845 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:29:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 2 times [2022-04-28 09:29:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:36,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888716537] [2022-04-28 09:29:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:36,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {51#true} is VALID [2022-04-28 09:29:36,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 09:29:36,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-28 09:29:36,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:36,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {51#true} is VALID [2022-04-28 09:29:36,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 09:29:36,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-28 09:29:36,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret11 := main(); {51#true} is VALID [2022-04-28 09:29:36,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {51#true} is VALID [2022-04-28 09:29:36,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume ~tagbuf_len~0 >= 1; {51#true} is VALID [2022-04-28 09:29:36,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {51#true} is VALID [2022-04-28 09:29:36,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-04-28 09:29:36,966 INFO L272 TraceCheckUtils]: 9: Hoare triple {52#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {52#false} is VALID [2022-04-28 09:29:36,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2022-04-28 09:29:36,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2022-04-28 09:29:36,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-28 09:29:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:29:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:36,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888716537] [2022-04-28 09:29:36,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888716537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:36,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:36,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:29:36,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199975061] [2022-04-28 09:29:36,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199975061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:36,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:36,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:29:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588370226] [2022-04-28 09:29:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:36,974 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 [2022-04-28 09:29:36,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:36,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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) [2022-04-28 09:29:36,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:36,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:29:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:37,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:29:37,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:29:37,003 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) [2022-04-28 09:29:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:37,170 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-04-28 09:29:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:29:37,171 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 [2022-04-28 09:29:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-28 09:29:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-28 09:29:37,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-04-28 09:29:37,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:37,374 INFO L225 Difference]: With dead ends: 88 [2022-04-28 09:29:37,374 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 09:29:37,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:29:37,381 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:37,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:29:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 09:29:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 09:29:37,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:37,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second 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) [2022-04-28 09:29:37,422 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second 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) [2022-04-28 09:29:37,422 INFO L87 Difference]: Start difference. First operand 43 states. Second 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) [2022-04-28 09:29:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:37,426 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-28 09:29:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 09:29:37,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:37,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:37,428 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 43 states. [2022-04-28 09:29:37,428 INFO L87 Difference]: Start difference. First 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) Second operand 43 states. [2022-04-28 09:29:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:37,457 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-28 09:29:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 09:29:37,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:37,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:37,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:37,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:37,466 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) [2022-04-28 09:29:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-28 09:29:37,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-28 09:29:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:37,486 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-28 09:29:37,487 INFO L496 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) [2022-04-28 09:29:37,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-28 09:29:37,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 09:29:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:29:37,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:37,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:37,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:29:37,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2022-04-28 09:29:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:37,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768009671] [2022-04-28 09:29:37,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:29:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 2 times [2022-04-28 09:29:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:37,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556697138] [2022-04-28 09:29:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:37,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:37,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {407#true} is VALID [2022-04-28 09:29:37,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-28 09:29:37,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-28 09:29:37,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:37,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {407#true} is VALID [2022-04-28 09:29:37,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-28 09:29:37,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-28 09:29:37,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret11 := main(); {407#true} is VALID [2022-04-28 09:29:37,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {407#true} is VALID [2022-04-28 09:29:37,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume ~tagbuf_len~0 >= 1; {407#true} is VALID [2022-04-28 09:29:37,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {412#(<= 0 main_~t~0)} is VALID [2022-04-28 09:29:37,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= 0 main_~t~0)} assume !false; {412#(<= 0 main_~t~0)} is VALID [2022-04-28 09:29:37,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {412#(<= 0 main_~t~0)} is VALID [2022-04-28 09:29:37,664 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {413#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:37,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {414#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:37,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {408#false} is VALID [2022-04-28 09:29:37,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-28 09:29:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:29:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556697138] [2022-04-28 09:29:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556697138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:37,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:37,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:29:37,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768009671] [2022-04-28 09:29:37,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768009671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:29:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935983053] [2022-04-28 09:29:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:37,668 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 [2022-04-28 09:29:37,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:37,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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) [2022-04-28 09:29:37,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:29:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:29:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:29:37,678 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) [2022-04-28 09:29:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:38,088 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-28 09:29:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:29:38,089 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 [2022-04-28 09:29:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-28 09:29:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-28 09:29:38,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-28 09:29:38,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:38,153 INFO L225 Difference]: With dead ends: 49 [2022-04-28 09:29:38,153 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:29:38,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:29:38,154 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:38,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:29:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:29:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 09:29:38,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:38,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second 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) [2022-04-28 09:29:38,174 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second 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) [2022-04-28 09:29:38,175 INFO L87 Difference]: Start difference. First operand 47 states. Second 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) [2022-04-28 09:29:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:38,177 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 09:29:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 09:29:38,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:38,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:38,178 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 47 states. [2022-04-28 09:29:38,178 INFO L87 Difference]: Start difference. First 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) Second operand 47 states. [2022-04-28 09:29:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:38,180 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 09:29:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 09:29:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:38,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:38,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:38,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:38,181 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) [2022-04-28 09:29:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 09:29:38,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-28 09:29:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:38,183 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 09:29:38,183 INFO L496 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) [2022-04-28 09:29:38,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 09:29:38,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 09:29:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:29:38,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:38,236 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:38,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:29:38,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2022-04-28 09:29:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:38,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754412641] [2022-04-28 09:29:38,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:29:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 2 times [2022-04-28 09:29:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:38,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387748071] [2022-04-28 09:29:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:38,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {712#true} is VALID [2022-04-28 09:29:38,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 09:29:38,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-28 09:29:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 09:29:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:38,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-28 09:29:38,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-28 09:29:38,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 09:29:38,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {718#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:38,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:38,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {712#true} is VALID [2022-04-28 09:29:38,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 09:29:38,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-28 09:29:38,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret11 := main(); {712#true} is VALID [2022-04-28 09:29:38,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {712#true} is VALID [2022-04-28 09:29:38,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#true} assume ~tagbuf_len~0 >= 1; {712#true} is VALID [2022-04-28 09:29:38,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:38,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:38,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume ~t~0 == ~tagbuf_len~0; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:38,318 INFO L272 TraceCheckUtils]: 10: Hoare triple {718#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {712#true} is VALID [2022-04-28 09:29:38,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-28 09:29:38,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-28 09:29:38,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 09:29:38,319 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {712#true} {718#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:38,320 INFO L272 TraceCheckUtils]: 15: Hoare triple {718#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:38,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {724#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:38,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {713#false} is VALID [2022-04-28 09:29:38,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-28 09:29:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:29:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387748071] [2022-04-28 09:29:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387748071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:38,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:38,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:29:38,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754412641] [2022-04-28 09:29:38,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754412641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:38,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:38,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:29:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596310952] [2022-04-28 09:29:38,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:38,323 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 [2022-04-28 09:29:38,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:38,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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) [2022-04-28 09:29:38,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:38,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:29:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:38,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:29:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:29:38,335 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) [2022-04-28 09:29:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:38,913 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-28 09:29:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:29:38,913 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 [2022-04-28 09:29:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 09:29:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 09:29:38,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-28 09:29:38,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:38,981 INFO L225 Difference]: With dead ends: 62 [2022-04-28 09:29:38,981 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 09:29:38,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:29:38,984 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:38,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:29:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 09:29:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-28 09:29:39,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:39,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second 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) [2022-04-28 09:29:39,027 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second 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) [2022-04-28 09:29:39,028 INFO L87 Difference]: Start difference. First operand 50 states. Second 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) [2022-04-28 09:29:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:39,033 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 09:29:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 09:29:39,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:39,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:39,034 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 50 states. [2022-04-28 09:29:39,034 INFO L87 Difference]: Start difference. First 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) Second operand 50 states. [2022-04-28 09:29:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:39,036 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 09:29:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 09:29:39,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:39,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:39,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:39,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:39,037 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) [2022-04-28 09:29:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-28 09:29:39,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-28 09:29:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-28 09:29:39,038 INFO L496 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) [2022-04-28 09:29:39,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 52 transitions. [2022-04-28 09:29:39,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-28 09:29:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:29:39,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:39,092 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:39,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:29:39,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2022-04-28 09:29:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:39,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678761756] [2022-04-28 09:29:39,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:29:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 2 times [2022-04-28 09:29:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:39,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215981129] [2022-04-28 09:29:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:39,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1044#true} is VALID [2022-04-28 09:29:39,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 09:29:39,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-28 09:29:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:29:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:39,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-28 09:29:39,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-28 09:29:39,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 09:29:39,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:39,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1044#true} is VALID [2022-04-28 09:29:39,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 09:29:39,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-28 09:29:39,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret11 := main(); {1044#true} is VALID [2022-04-28 09:29:39,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1044#true} is VALID [2022-04-28 09:29:39,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#true} assume ~tagbuf_len~0 >= 1; {1049#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:39,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume 0 != #t~nondet3;havoc #t~nondet3; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1044#true} is VALID [2022-04-28 09:29:39,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-28 09:29:39,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-28 09:29:39,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 09:29:39,156 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1044#true} {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-28 09:29:39,156 INFO L272 TraceCheckUtils]: 16: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1055#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:39,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {1055#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1056#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:39,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {1056#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1045#false} is VALID [2022-04-28 09:29:39,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2022-04-28 09:29:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:29:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:39,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215981129] [2022-04-28 09:29:39,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215981129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:39,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:39,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:29:39,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:39,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678761756] [2022-04-28 09:29:39,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678761756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:39,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:39,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:29:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801764708] [2022-04-28 09:29:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:39,159 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 [2022-04-28 09:29:39,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:39,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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) [2022-04-28 09:29:39,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:29:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:39,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:29:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:29:39,171 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) [2022-04-28 09:29:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:39,663 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 09:29:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:29:39,663 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 [2022-04-28 09:29:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 09:29:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-28 09:29:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 09:29:39,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-28 09:29:39,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:39,721 INFO L225 Difference]: With dead ends: 60 [2022-04-28 09:29:39,721 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 09:29:39,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:29:39,722 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:39,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:29:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 09:29:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-28 09:29:39,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:39,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second 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) [2022-04-28 09:29:39,762 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second 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) [2022-04-28 09:29:39,762 INFO L87 Difference]: Start difference. First operand 58 states. Second 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) [2022-04-28 09:29:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:39,764 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-28 09:29:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-28 09:29:39,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:39,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:39,765 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 58 states. [2022-04-28 09:29:39,765 INFO L87 Difference]: Start difference. First 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) Second operand 58 states. [2022-04-28 09:29:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:39,767 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-28 09:29:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-28 09:29:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:39,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:39,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:39,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:39,768 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) [2022-04-28 09:29:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 09:29:39,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-28 09:29:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:39,769 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-28 09:29:39,770 INFO L496 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) [2022-04-28 09:29:39,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 09:29:39,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 09:29:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 09:29:39,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:39,840 INFO L195 NwaCegarLoop]: 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] [2022-04-28 09:29:39,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:29:39,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2022-04-28 09:29:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:39,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250858053] [2022-04-28 09:29:39,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:29:39,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:29:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 2 times [2022-04-28 09:29:39,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321387943] [2022-04-28 09:29:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1421#true} is VALID [2022-04-28 09:29:40,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1421#true} {1421#true} #156#return; {1421#true} is VALID [2022-04-28 09:29:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:29:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #128#return; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:29:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #130#return; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:29:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} #132#return; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:40,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1421#true} is VALID [2022-04-28 09:29:40,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #156#return; {1421#true} is VALID [2022-04-28 09:29:40,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret11 := main(); {1421#true} is VALID [2022-04-28 09:29:40,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1421#true} is VALID [2022-04-28 09:29:40,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {1421#true} assume ~tagbuf_len~0 >= 1; {1426#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {1426#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1427#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {1427#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !false; {1427#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1427#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1421#true} {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #128#return; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,053 INFO L272 TraceCheckUtils]: 16: Hoare triple {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,054 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1421#true} {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #130#return; {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume !false; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume 0 != #t~nondet3;havoc #t~nondet3; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,056 INFO L272 TraceCheckUtils]: 25: Hoare triple {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,057 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1421#true} {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} #132#return; {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-28 09:29:40,057 INFO L272 TraceCheckUtils]: 30: Hoare triple {1437#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1442#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:40,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {1442#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1443#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:40,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {1443#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1422#false} is VALID [2022-04-28 09:29:40,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-04-28 09:29:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:29:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:40,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321387943] [2022-04-28 09:29:40,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321387943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:29:40,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409078020] [2022-04-28 09:29:40,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:29:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:29:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:29:40,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:29:40,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:29:40,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:29:40,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:29:40,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:29:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:40,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:29:40,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2022-04-28 09:29:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1421#true} is VALID [2022-04-28 09:29:40,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #156#return; {1421#true} is VALID [2022-04-28 09:29:40,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret11 := main(); {1421#true} is VALID [2022-04-28 09:29:40,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1421#true} is VALID [2022-04-28 09:29:40,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1421#true} assume ~tagbuf_len~0 >= 1; {1426#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {1426#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1469#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-28 09:29:40,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1469#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !false; {1469#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-28 09:29:40,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {1469#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:40,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:40,601 INFO L272 TraceCheckUtils]: 11: Hoare triple {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,602 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1421#true} {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #128#return; {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:40,602 INFO L272 TraceCheckUtils]: 16: Hoare triple {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,603 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1421#true} {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #130#return; {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:40,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {1476#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:40,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !false; {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:40,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:40,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume 0 != #t~nondet3;havoc #t~nondet3; {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:40,605 INFO L272 TraceCheckUtils]: 25: Hoare triple {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,606 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1421#true} {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} #132#return; {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:40,606 INFO L272 TraceCheckUtils]: 30: Hoare triple {1513#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:29:40,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:40,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {1545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1422#false} is VALID [2022-04-28 09:29:40,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-04-28 09:29:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:29:40,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:29:40,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-04-28 09:29:40,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {1545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1422#false} is VALID [2022-04-28 09:29:40,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:40,792 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:29:40,793 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1421#true} {1561#(<= main_~t~0 main_~tagbuf_len~0)} #132#return; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,793 INFO L272 TraceCheckUtils]: 25: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,796 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1421#true} {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #130#return; {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,796 INFO L272 TraceCheckUtils]: 16: Hoare triple {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,815 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1421#true} {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #128#return; {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-28 09:29:40,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-28 09:29:40,816 INFO L272 TraceCheckUtils]: 11: Hoare triple {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1421#true} is VALID [2022-04-28 09:29:40,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1589#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {1426#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1561#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {1421#true} assume ~tagbuf_len~0 >= 1; {1426#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:40,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1421#true} is VALID [2022-04-28 09:29:40,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret11 := main(); {1421#true} is VALID [2022-04-28 09:29:40,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #156#return; {1421#true} is VALID [2022-04-28 09:29:40,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 09:29:40,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1421#true} is VALID [2022-04-28 09:29:40,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2022-04-28 09:29:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 09:29:40,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409078020] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:29:40,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:29:40,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-28 09:29:40,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:40,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250858053] [2022-04-28 09:29:40,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250858053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:40,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:40,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:29:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467312712] [2022-04-28 09:29:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:40,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 09:29:40,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:40,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:29:40,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:29:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:29:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:29:40,842 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:29:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:41,692 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-04-28 09:29:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:29:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 09:29:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:29:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-04-28 09:29:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:29:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-04-28 09:29:41,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 103 transitions. [2022-04-28 09:29:41,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:41,778 INFO L225 Difference]: With dead ends: 86 [2022-04-28 09:29:41,778 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 09:29:41,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:29:41,779 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:41,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 57 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:29:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 09:29:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-28 09:29:41,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:41,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 09:29:41,861 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 09:29:41,862 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 09:29:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:41,864 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-28 09:29:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-28 09:29:41,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:41,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:41,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-28 09:29:41,865 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-28 09:29:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:41,867 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-28 09:29:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-28 09:29:41,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:41,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:41,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:41,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 09:29:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-28 09:29:41,870 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-28 09:29:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:41,870 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-28 09:29:41,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:29:41,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-28 09:29:41,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 09:29:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 09:29:41,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:41,957 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:41,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 09:29:42,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:29:42,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 110874648, now seen corresponding path program 1 times [2022-04-28 09:29:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:42,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994764101] [2022-04-28 09:29:42,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:29:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 110874648, now seen corresponding path program 2 times [2022-04-28 09:29:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:42,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188593237] [2022-04-28 09:29:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {2192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2162#true} is VALID [2022-04-28 09:29:42,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2162#true} {2162#true} #156#return; {2162#true} is VALID [2022-04-28 09:29:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:29:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #132#return; {2162#true} is VALID [2022-04-28 09:29:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:29:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #134#return; {2162#true} is VALID [2022-04-28 09:29:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:29:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2175#(not (= main_~tagbuf_len~0 main_~t~0))} #140#return; {2175#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-28 09:29:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#true} ~cond := #in~cond; {2193#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:42,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {2193#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:42,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:42,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} {2175#(not (= main_~tagbuf_len~0 main_~t~0))} #142#return; {2184#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:29:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2185#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {2185#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:42,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2162#true} call ULTIMATE.init(); {2192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:42,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2162#true} is VALID [2022-04-28 09:29:42,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #156#return; {2162#true} is VALID [2022-04-28 09:29:42,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret11 := main(); {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {2162#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {2162#true} assume ~tagbuf_len~0 >= 1; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2162#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#true} assume !false; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {2162#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {2162#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2162#true} {2162#true} #132#return; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L272 TraceCheckUtils]: 16: Hoare triple {2162#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2162#true} {2162#true} #134#return; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2162#true} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {2162#true} assume !false; {2162#true} is VALID [2022-04-28 09:29:42,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {2162#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2175#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {2175#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2175#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {2175#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {2175#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,260 INFO L272 TraceCheckUtils]: 26: Hoare triple {2175#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,261 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2162#true} {2175#(not (= main_~tagbuf_len~0 main_~t~0))} #140#return; {2175#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,261 INFO L272 TraceCheckUtils]: 31: Hoare triple {2175#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {2162#true} ~cond := #in~cond; {2193#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:42,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {2193#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:42,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:42,262 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} {2175#(not (= main_~tagbuf_len~0 main_~t~0))} #142#return; {2184#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:42,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {2184#(not (<= main_~tagbuf_len~0 main_~t~0))} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {2185#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:42,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {2185#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {2185#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:42,263 INFO L272 TraceCheckUtils]: 38: Hoare triple {2185#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,264 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2162#true} {2185#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {2185#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:42,264 INFO L272 TraceCheckUtils]: 43: Hoare triple {2185#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:42,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {2190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:42,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {2191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2163#false} is VALID [2022-04-28 09:29:42,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2022-04-28 09:29:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 09:29:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:42,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188593237] [2022-04-28 09:29:42,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188593237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:29:42,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658091752] [2022-04-28 09:29:42,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:29:42,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:29:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:29:42,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:29:42,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:29:42,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:29:42,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:29:42,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:29:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:42,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:29:42,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {2162#true} call ULTIMATE.init(); {2162#true} is VALID [2022-04-28 09:29:42,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2162#true} is VALID [2022-04-28 09:29:42,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #156#return; {2162#true} is VALID [2022-04-28 09:29:42,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret11 := main(); {2162#true} is VALID [2022-04-28 09:29:42,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {2162#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2162#true} is VALID [2022-04-28 09:29:42,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {2162#true} assume ~tagbuf_len~0 >= 1; {2215#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 09:29:42,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {2219#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-28 09:29:42,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !false; {2219#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-28 09:29:42,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {2219#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:42,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} assume 0 != #t~nondet3;havoc #t~nondet3; {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:42,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,943 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2162#true} {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #132#return; {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:42,944 INFO L272 TraceCheckUtils]: 16: Hoare triple {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,944 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2162#true} {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #134#return; {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-28 09:29:42,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {2263#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !false; {2263#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {2263#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} assume 0 != #t~nondet7;havoc #t~nondet7; {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,946 INFO L272 TraceCheckUtils]: 26: Hoare triple {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,947 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2162#true} {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} #140#return; {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,947 INFO L272 TraceCheckUtils]: 31: Hoare triple {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,948 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2162#true} {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} #142#return; {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} is VALID [2022-04-28 09:29:42,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {2270#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (not (= main_~tagbuf_len~0 main_~t~0)) (<= main_~t~0 1))} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} is VALID [2022-04-28 09:29:42,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} assume !(~t~0 == ~tagbuf_len~0); {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} is VALID [2022-04-28 09:29:42,949 INFO L272 TraceCheckUtils]: 38: Hoare triple {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2162#true} is VALID [2022-04-28 09:29:42,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#true} ~cond := #in~cond; {2162#true} is VALID [2022-04-28 09:29:42,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {2162#true} assume !(0 == ~cond); {2162#true} is VALID [2022-04-28 09:29:42,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {2162#true} assume true; {2162#true} is VALID [2022-04-28 09:29:42,950 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2162#true} {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} #148#return; {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} is VALID [2022-04-28 09:29:42,951 INFO L272 TraceCheckUtils]: 43: Hoare triple {2310#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 2))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2332#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:29:42,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {2332#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2336#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:42,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {2336#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2163#false} is VALID [2022-04-28 09:29:42,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2022-04-28 09:29:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:29:42,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:29:42,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658091752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:42,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:29:42,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-04-28 09:29:42,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:42,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994764101] [2022-04-28 09:29:42,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994764101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:42,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:42,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:29:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727546824] [2022-04-28 09:29:42,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-28 09:29:42,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:42,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:29:42,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:42,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:29:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:29:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:29:42,977 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:29:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:43,585 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2022-04-28 09:29:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:29:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-28 09:29:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:29:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-28 09:29:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:29:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-28 09:29:43,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-04-28 09:29:43,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:43,684 INFO L225 Difference]: With dead ends: 111 [2022-04-28 09:29:43,684 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 09:29:43,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:29:43,685 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:43,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 235 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:29:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 09:29:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-04-28 09:29:43,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:43,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 09:29:43,849 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 09:29:43,849 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 09:29:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:43,852 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-04-28 09:29:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 141 transitions. [2022-04-28 09:29:43,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:43,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:43,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) Second operand 107 states. [2022-04-28 09:29:43,853 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) Second operand 107 states. [2022-04-28 09:29:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:43,856 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-04-28 09:29:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 141 transitions. [2022-04-28 09:29:43,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:43,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:43,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:43,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 09:29:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2022-04-28 09:29:43,859 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 47 [2022-04-28 09:29:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:43,860 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2022-04-28 09:29:43,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 09:29:43,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 137 transitions. [2022-04-28 09:29:44,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2022-04-28 09:29:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 09:29:44,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:29:44,001 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:29:44,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 09:29:44,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 09:29:44,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:29:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:29:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -392317006, now seen corresponding path program 1 times [2022-04-28 09:29:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490655673] [2022-04-28 09:29:44,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:29:44,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:29:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash -392317006, now seen corresponding path program 2 times [2022-04-28 09:29:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:29:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245606297] [2022-04-28 09:29:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:29:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:29:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:29:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2986#true} is VALID [2022-04-28 09:29:44,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2986#true} {2986#true} #156#return; {2986#true} is VALID [2022-04-28 09:29:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:29:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #128#return; {2986#true} is VALID [2022-04-28 09:29:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:29:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #130#return; {2986#true} is VALID [2022-04-28 09:29:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:29:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #132#return; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 09:29:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:44,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #134#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:29:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #140#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 09:29:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #142#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:29:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} #148#return; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:29:44,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #156#return; {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret11 := main(); {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {2986#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {2986#true} assume ~tagbuf_len~0 >= 1; {2986#true} is VALID [2022-04-28 09:29:44,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {2986#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {2986#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {2986#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2986#true} {2986#true} #128#return; {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L272 TraceCheckUtils]: 16: Hoare triple {2986#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,456 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2986#true} {2986#true} #130#return; {2986#true} is VALID [2022-04-28 09:29:44,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {2986#true} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {2986#true} is VALID [2022-04-28 09:29:44,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:44,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet3;havoc #t~nondet3; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,465 INFO L272 TraceCheckUtils]: 25: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,466 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2986#true} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #132#return; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,466 INFO L272 TraceCheckUtils]: 30: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {2986#true} ~cond := #in~cond; {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:44,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,470 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #134#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} assume !false; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,472 INFO L272 TraceCheckUtils]: 40: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,472 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2986#true} {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #140#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,472 INFO L272 TraceCheckUtils]: 45: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,473 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2986#true} {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #142#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} assume !(~t~0 == ~tagbuf_len~0); {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,474 INFO L272 TraceCheckUtils]: 52: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,475 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2986#true} {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} #148#return; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,475 INFO L272 TraceCheckUtils]: 57: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3023#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:44,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {3023#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2987#false} is VALID [2022-04-28 09:29:44,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2022-04-28 09:29:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-28 09:29:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:29:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245606297] [2022-04-28 09:29:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245606297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:29:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288474613] [2022-04-28 09:29:44,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:29:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:29:44,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:29:44,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:29:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:29:44,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:29:44,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:29:44,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:29:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:29:44,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:29:44,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2022-04-28 09:29:44,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #156#return; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret11 := main(); {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {2986#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {2986#true} assume ~tagbuf_len~0 >= 1; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {2986#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {2986#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L272 TraceCheckUtils]: 11: Hoare triple {2986#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2986#true} {2986#true} #128#return; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L272 TraceCheckUtils]: 16: Hoare triple {2986#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2986#true} {2986#true} #130#return; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2986#true} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:44,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {2986#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L272 TraceCheckUtils]: 25: Hoare triple {2986#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2986#true} {2986#true} #132#return; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L272 TraceCheckUtils]: 30: Hoare triple {2986#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2986#true} {2986#true} #134#return; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {2986#true} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {2986#true} is VALID [2022-04-28 09:29:44,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:44,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,818 INFO L272 TraceCheckUtils]: 40: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,859 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2986#true} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #140#return; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,859 INFO L272 TraceCheckUtils]: 45: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {2986#true} ~cond := #in~cond; {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:44,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {3025#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:44,867 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #142#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:44,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} assume !(~t~0 == ~tagbuf_len~0); {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,868 INFO L272 TraceCheckUtils]: 52: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:44,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:44,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:44,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:44,868 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2986#true} {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} #148#return; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:44,869 INFO L272 TraceCheckUtils]: 57: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:29:44,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {3200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:44,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {3204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2987#false} is VALID [2022-04-28 09:29:44,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2022-04-28 09:29:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 09:29:44,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:29:45,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2022-04-28 09:29:45,268 INFO L290 TraceCheckUtils]: 59: Hoare triple {3204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2987#false} is VALID [2022-04-28 09:29:45,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {3200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:29:45,269 INFO L272 TraceCheckUtils]: 57: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:29:45,269 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2986#true} {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} #148#return; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:45,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,270 INFO L272 TraceCheckUtils]: 52: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} assume !(~t~0 == ~tagbuf_len~0); {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:45,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {3009#(< main_~t~0 (+ main_~tagbuf_len~0 1))} is VALID [2022-04-28 09:29:45,271 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #142#return; {3008#(not (<= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:45,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:45,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {3253#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3022#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:29:45,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {2986#true} ~cond := #in~cond; {3253#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:29:45,272 INFO L272 TraceCheckUtils]: 45: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,272 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2986#true} {2999#(not (= main_~tagbuf_len~0 main_~t~0))} #140#return; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:45,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,273 INFO L272 TraceCheckUtils]: 40: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:45,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {2999#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2999#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {2986#true} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2986#true} {2986#true} #134#return; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L272 TraceCheckUtils]: 30: Hoare triple {2986#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2986#true} {2986#true} #132#return; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L272 TraceCheckUtils]: 25: Hoare triple {2986#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {2986#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {2986#true} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2986#true} {2986#true} #130#return; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L272 TraceCheckUtils]: 16: Hoare triple {2986#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2986#true} {2986#true} #128#return; {2986#true} is VALID [2022-04-28 09:29:45,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#true} assume !(0 == ~cond); {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#true} ~cond := #in~cond; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {2986#true} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {2986#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {2986#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {2986#true} assume !false; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {2986#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {2986#true} assume ~tagbuf_len~0 >= 1; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2986#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret11 := main(); {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #156#return; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2022-04-28 09:29:45,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2986#true} is VALID [2022-04-28 09:29:45,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2022-04-28 09:29:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 09:29:45,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288474613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:29:45,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:29:45,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-04-28 09:29:45,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:29:45,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490655673] [2022-04-28 09:29:45,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490655673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:29:45,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:29:45,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:29:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745585657] [2022-04-28 09:29:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:29:45,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2022-04-28 09:29:45,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:29:45,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 09:29:45,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:45,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:29:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:29:45,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:29:45,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:29:45,305 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 09:29:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:45,972 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-04-28 09:29:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:29:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2022-04-28 09:29:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:29:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 09:29:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 09:29:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 09:29:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 09:29:45,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-04-28 09:29:46,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:46,024 INFO L225 Difference]: With dead ends: 103 [2022-04-28 09:29:46,024 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:29:46,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:29:46,025 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:29:46,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:29:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:29:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:29:46,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:29:46,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-28 09:29:46,025 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-28 09:29:46,026 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-28 09:29:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:46,026 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:29:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:29:46,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:46,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:46,026 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-28 09:29:46,026 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-28 09:29:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:29:46,026 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:29:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:29:46,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:46,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:29:46,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:29:46,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:29:46,026 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) [2022-04-28 09:29:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:29:46,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2022-04-28 09:29:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:29:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:29:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 09:29:46,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:29:46,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:29:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:29:46,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:29:46,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:29:46,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:29:46,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:29:46,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:29:47,072 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:29:47,073 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,073 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,073 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 77) the Hoare annotation is: true [2022-04-28 09:29:47,073 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,073 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,073 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (let ((.cse0 (<= 0 main_~t~0))) (or (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= main_~t~0 2) .cse0) (and (not (<= main_~tagbuf_len~0 main_~t~0)) .cse0))) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (<= 0 main_~t~0))) (or (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= main_~t~0 2) .cse0) (and (not (<= main_~tagbuf_len~0 main_~t~0)) .cse0))) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L49(lines 49 53) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L902 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L66(lines 66 68) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L895 garLoopResultBuilder]: At program point L33(lines 33 37) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,074 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L54(lines 54 68) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 77) the Hoare annotation is: true [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L38(lines 38 40) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L59(lines 59 63) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point L55(lines 55 64) the Hoare annotation is: (and (not (<= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-04-28 09:29:47,075 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,075 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 09:29:47,076 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:29:47,076 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 09:29:47,076 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:29:47,076 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:29:47,076 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 09:29:47,078 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 09:29:47,079 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:29:47,081 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:29:47,081 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:29:47,081 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:29:47,082 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:29:47,082 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:29:47,082 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:29:47,083 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:29:47,100 INFO L163 areAnnotationChecker]: CFG has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:29:47,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:29:47 BoogieIcfgContainer [2022-04-28 09:29:47,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:29:47,107 INFO L158 Benchmark]: Toolchain (without parser) took 11094.39ms. Allocated memory was 158.3MB in the beginning and 278.9MB in the end (delta: 120.6MB). Free memory was 108.7MB in the beginning and 186.6MB in the end (delta: -78.0MB). Peak memory consumption was 106.7MB. Max. memory is 8.0GB. [2022-04-28 09:29:47,107 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 158.3MB. Free memory was 125.2MB in the beginning and 125.0MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:29:47,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.91ms. Allocated memory is still 158.3MB. Free memory was 108.4MB in the beginning and 133.5MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 09:29:47,108 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 158.3MB. Free memory was 133.5MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:29:47,108 INFO L158 Benchmark]: RCFGBuilder took 452.51ms. Allocated memory is still 158.3MB. Free memory was 131.9MB in the beginning and 117.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 09:29:47,108 INFO L158 Benchmark]: TraceAbstraction took 10361.02ms. Allocated memory was 158.3MB in the beginning and 278.9MB in the end (delta: 120.6MB). Free memory was 116.8MB in the beginning and 186.6MB in the end (delta: -69.8MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. [2022-04-28 09:29:47,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 158.3MB. Free memory was 125.2MB in the beginning and 125.0MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.91ms. Allocated memory is still 158.3MB. Free memory was 108.4MB in the beginning and 133.5MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 158.3MB. Free memory was 133.5MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 452.51ms. Allocated memory is still 158.3MB. Free memory was 131.9MB in the beginning and 117.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10361.02ms. Allocated memory was 158.3MB in the beginning and 278.9MB in the end (delta: 120.6MB). Free memory was 116.8MB in the beginning and 186.6MB in the end (delta: -69.8MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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. OverallTime: 10.3s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 296 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 270 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 378 PreInvPairs, 566 NumberOfFragments, 321 HoareAnnotationTreeSize, 378 FomulaSimplifications, 910 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 48 FomulaSimplificationsInter, 2067 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: t < tagbuf_len + 1 && 0 <= t - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (t < tagbuf_len + 1 && 1 <= tagbuf_len) && 0 <= t - 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: \old(cond) == cond || \old(cond) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:29:47,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...