/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:10:33,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:10:33,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:10:33,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:10:33,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:10:33,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:10:33,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:10:33,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:10:33,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:10:33,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:10:33,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:10:33,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:10:33,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:10:33,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:10:33,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:10:33,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:10:33,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:10:33,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:10:33,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:10:33,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:10:33,234 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:10:33,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:10:33,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:10:33,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:10:33,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:10:33,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:10:33,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:10:33,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:10:33,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:10:33,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:10:33,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:10:33,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:10:33,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:10:33,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:10:33,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:10:33,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:10:33,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:10:33,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:10:33,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:10:33,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:10:33,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:10:33,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:10:33,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:10:33,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:10:33,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:10:33,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:10:33,259 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:10:33,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:10:33,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:10:33,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:33,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:10:33,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:10:33,262 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:10:33,262 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:10:33,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:10:33,262 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:10:33,262 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 03:10:33,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:10:33,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:10:33,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:10:33,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:10:33,475 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:10:33,476 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 03:10:33,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6018025f7/3306f131b5454700aeb7a661af1f000f/FLAGf39e6d1ab [2022-04-28 03:10:33,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:10:33,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-28 03:10:33,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6018025f7/3306f131b5454700aeb7a661af1f000f/FLAGf39e6d1ab [2022-04-28 03:10:34,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6018025f7/3306f131b5454700aeb7a661af1f000f [2022-04-28 03:10:34,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:10:34,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:10:34,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:34,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:10:34,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:10:34,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e39ffaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34, skipping insertion in model container [2022-04-28 03:10:34,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:10:34,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:10:34,413 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 03:10:34,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:34,449 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:10:34,465 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 03:10:34,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:34,491 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:10:34,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34 WrapperNode [2022-04-28 03:10:34,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:34,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:10:34,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:10:34,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:10:34,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:10:34,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:10:34,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:10:34,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:10:34,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (1/1) ... [2022-04-28 03:10:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:34,593 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 03:10:34,623 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 03:10:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:10:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:10:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:10:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:10:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:10:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:10:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:10:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:10:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:10:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:10:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:10:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:10:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:10:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:10:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:10:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:10:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:10:34,711 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:10:34,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:10:34,944 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:10:34,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:10:34,949 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:10:34,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:34 BoogieIcfgContainer [2022-04-28 03:10:34,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:10:34,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:10:34,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:10:34,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:10:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:10:34" (1/3) ... [2022-04-28 03:10:34,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66742216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:34, skipping insertion in model container [2022-04-28 03:10:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:34" (2/3) ... [2022-04-28 03:10:34,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66742216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:34, skipping insertion in model container [2022-04-28 03:10:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:34" (3/3) ... [2022-04-28 03:10:34,971 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-04-28 03:10:34,980 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:10:34,980 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:10:35,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:10:35,027 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@25caf830, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2fe54af0 [2022-04-28 03:10:35,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:10:35,042 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 03:10:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:10:35,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:35,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:35,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2022-04-28 03:10:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:35,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911861012] [2022-04-28 03:10:35,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 2 times [2022-04-28 03:10:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:35,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379870835] [2022-04-28 03:10:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,226 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 03:10:35,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 03:10:35,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-28 03:10:35,227 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 03:10:35,228 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 03:10:35,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 03:10:35,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-28 03:10:35,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret11 := main(); {51#true} is VALID [2022-04-28 03:10:35,228 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 03:10:35,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume ~tagbuf_len~0 >= 1; {51#true} is VALID [2022-04-28 03:10:35,229 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 03:10:35,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-04-28 03:10:35,230 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 03:10:35,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2022-04-28 03:10:35,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2022-04-28 03:10:35,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-28 03:10:35,231 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 03:10:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:35,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379870835] [2022-04-28 03:10:35,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379870835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:35,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:35,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:10:35,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:35,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911861012] [2022-04-28 03:10:35,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911861012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:35,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:35,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:10:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509776841] [2022-04-28 03:10:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:35,239 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 03:10:35,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:35,242 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 03:10:35,275 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 03:10:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:10:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:10:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:10:35,291 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 03:10:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,501 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-04-28 03:10:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:10:35,502 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 03:10:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:35,503 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 03:10:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-28 03:10:35,513 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 03:10:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-28 03:10:35,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-04-28 03:10:35,655 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 03:10:35,662 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:10:35,662 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:10:35,665 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 03:10:35,667 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 03:10:35,668 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 03:10:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:10:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:10:35,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:35,719 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 03:10:35,735 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 03:10:35,736 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 03:10:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,754 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-28 03:10:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 03:10:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:35,755 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 03:10:35,756 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 03:10:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,760 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-28 03:10:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 03:10:35,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:35,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:35,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:35,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:35,761 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 03:10:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-28 03:10:35,765 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-28 03:10:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:35,766 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-28 03:10:35,766 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 03:10:35,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-28 03:10:35,828 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 03:10:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 03:10:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:10:35,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:35,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:35,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:10:35,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2022-04-28 03:10:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:35,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152068991] [2022-04-28 03:10:35,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 2 times [2022-04-28 03:10:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618591498] [2022-04-28 03:10:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,014 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 03:10:36,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-28 03:10:36,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-28 03:10:36,016 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 03:10:36,017 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 03:10:36,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-28 03:10:36,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-28 03:10:36,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret11 := main(); {407#true} is VALID [2022-04-28 03:10:36,018 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 03:10:36,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume ~tagbuf_len~0 >= 1; {407#true} is VALID [2022-04-28 03:10:36,018 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 03:10:36,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= 0 main_~t~0)} assume !false; {412#(<= 0 main_~t~0)} is VALID [2022-04-28 03:10:36,019 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 03:10:36,020 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 03:10:36,021 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 03:10:36,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {408#false} is VALID [2022-04-28 03:10:36,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-28 03:10:36,021 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 03:10:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:36,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618591498] [2022-04-28 03:10:36,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618591498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:36,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:36,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152068991] [2022-04-28 03:10:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152068991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614151861] [2022-04-28 03:10:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:36,025 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 03:10:36,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:36,025 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 03:10:36,051 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 03:10:36,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:36,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:36,053 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 03:10:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,537 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-28 03:10:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:36,537 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 03:10:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:36,538 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 03:10:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-28 03:10:36,540 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 03:10:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-28 03:10:36,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-28 03:10:36,594 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 03:10:36,596 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:10:36,596 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:10:36,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:36,597 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 03:10:36,598 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 03:10:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:10:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:10:36,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:36,619 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 03:10:36,619 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 03:10:36,620 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 03:10:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,622 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 03:10:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 03:10:36,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,623 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 03:10:36,624 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 03:10:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,626 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 03:10:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 03:10:36,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:36,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:36,627 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 03:10:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 03:10:36,629 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-28 03:10:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:36,629 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 03:10:36,630 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 03:10:36,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 03:10:36,689 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 03:10:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 03:10:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:10:36,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:36,692 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 03:10:36,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:10:36,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2022-04-28 03:10:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708677109] [2022-04-28 03:10:36,693 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 2 times [2022-04-28 03:10:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:36,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782803409] [2022-04-28 03:10:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,762 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 03:10:36,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 03:10:36,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-28 03:10:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 03:10:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-28 03:10:36,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-28 03:10:36,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 03:10:36,768 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 03:10:36,768 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 03:10:36,769 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 03:10:36,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 03:10:36,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-28 03:10:36,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret11 := main(); {712#true} is VALID [2022-04-28 03:10:36,769 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 03:10:36,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#true} assume ~tagbuf_len~0 >= 1; {712#true} is VALID [2022-04-28 03:10:36,770 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 03:10:36,770 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 03:10:36,770 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 03:10:36,771 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 03:10:36,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-28 03:10:36,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-28 03:10:36,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-28 03:10:36,772 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 03:10:36,772 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 03:10:36,773 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 03:10:36,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {713#false} is VALID [2022-04-28 03:10:36,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-28 03:10:36,773 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 03:10:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:36,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782803409] [2022-04-28 03:10:36,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782803409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:36,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:36,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708677109] [2022-04-28 03:10:36,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708677109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347786897] [2022-04-28 03:10:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:36,775 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 03:10:36,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:36,776 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 03:10:36,789 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 03:10:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:36,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:36,790 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 03:10:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,336 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-28 03:10:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:10:37,337 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 03:10:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:37,338 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 03:10:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 03:10:37,342 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 03:10:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 03:10:37,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-28 03:10:37,408 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 03:10:37,413 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:10:37,413 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:10:37,414 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 03:10:37,416 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 03:10:37,418 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 03:10:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:10:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-28 03:10:37,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:37,447 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 03:10:37,448 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 03:10:37,448 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 03:10:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,453 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 03:10:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 03:10:37,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:37,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:37,461 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 03:10:37,461 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 03:10:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,463 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 03:10:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 03:10:37,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:37,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:37,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:37,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:37,464 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 03:10:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-28 03:10:37,465 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-28 03:10:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:37,465 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-28 03:10:37,465 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 03:10:37,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 52 transitions. [2022-04-28 03:10:37,505 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 03:10:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-28 03:10:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:10:37,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:37,506 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 03:10:37,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:10:37,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2022-04-28 03:10:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:37,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644884404] [2022-04-28 03:10:37,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 2 times [2022-04-28 03:10:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:37,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128304309] [2022-04-28 03:10:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,578 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 03:10:37,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 03:10:37,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-28 03:10:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:10:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-28 03:10:37,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-28 03:10:37,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 03:10:37,584 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 03:10:37,585 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 03:10:37,585 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 03:10:37,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 03:10:37,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-28 03:10:37,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret11 := main(); {1044#true} is VALID [2022-04-28 03:10:37,585 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 03:10:37,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#true} assume ~tagbuf_len~0 >= 1; {1049#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-28 03:10:37,588 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 03:10:37,588 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 03:10:37,589 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 03:10:37,589 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 03:10:37,589 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 03:10:37,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-28 03:10:37,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-28 03:10:37,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-28 03:10:37,590 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 03:10:37,594 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 03:10:37,594 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 03:10:37,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {1056#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1045#false} is VALID [2022-04-28 03:10:37,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2022-04-28 03:10:37,595 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 03:10:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128304309] [2022-04-28 03:10:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128304309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:37,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644884404] [2022-04-28 03:10:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644884404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999926667] [2022-04-28 03:10:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:37,596 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 03:10:37,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:37,596 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 03:10:37,608 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 03:10:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:37,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:37,609 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 03:10:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,018 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 03:10:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:38,019 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 03:10:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:38,035 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 03:10:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 03:10:38,037 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 03:10:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 03:10:38,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-28 03:10:38,081 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 03:10:38,082 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:10:38,083 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:10:38,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:10:38,083 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 03:10:38,084 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 03:10:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:10:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-28 03:10:38,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:38,137 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 03:10:38,137 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 03:10:38,137 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 03:10:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,140 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-28 03:10:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-28 03:10:38,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:38,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:38,141 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 03:10:38,141 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 03:10:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,144 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-28 03:10:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-28 03:10:38,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:38,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:38,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:38,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:38,145 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 03:10:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:10:38,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-28 03:10:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:38,147 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-28 03:10:38,147 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 03:10:38,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 03:10:38,208 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 03:10:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 03:10:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:10:38,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:38,209 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 03:10:38,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:10:38,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2022-04-28 03:10:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:38,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401263552] [2022-04-28 03:10:40,865 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:10:41,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:10:41,073 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 03:10:41,076 INFO L158 Benchmark]: Toolchain (without parser) took 6829.40ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 144.9MB in the beginning and 192.5MB in the end (delta: -47.5MB). Peak memory consumption was 109.4MB. Max. memory is 8.0GB. [2022-04-28 03:10:41,076 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:10:41,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.77ms. Allocated memory is still 192.9MB. Free memory was 144.8MB in the beginning and 169.1MB in the end (delta: -24.3MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-04-28 03:10:41,076 INFO L158 Benchmark]: Boogie Preprocessor took 45.48ms. Allocated memory is still 192.9MB. Free memory was 169.1MB in the beginning and 167.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:10:41,077 INFO L158 Benchmark]: RCFGBuilder took 411.62ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 152.8MB in the end (delta: 14.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 03:10:41,077 INFO L158 Benchmark]: TraceAbstraction took 6123.07ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 152.3MB in the beginning and 192.5MB in the end (delta: -40.2MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. [2022-04-28 03:10:41,078 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.11ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.77ms. Allocated memory is still 192.9MB. Free memory was 144.8MB in the beginning and 169.1MB in the end (delta: -24.3MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.48ms. Allocated memory is still 192.9MB. Free memory was 169.1MB in the beginning and 167.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.62ms. Allocated memory is still 192.9MB. Free memory was 167.4MB in the beginning and 152.8MB in the end (delta: 14.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6123.07ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 152.3MB in the beginning and 192.5MB in the end (delta: -40.2MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:10:41,098 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...