./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test24-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test24-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba9918f9236391a08a9d6d8a63aa823d4042d99b397d7843518d83dccab2fbf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:27:56,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:27:56,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:27:56,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:27:56,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:27:56,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:27:56,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:27:56,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:27:56,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:27:56,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:27:56,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:27:56,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:27:56,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:27:56,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:27:56,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:27:56,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:27:56,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:27:56,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:27:56,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:27:56,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:27:56,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:27:56,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:27:56,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:27:56,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:27:56,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:27:56,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:27:56,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:27:56,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:27:56,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:27:56,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:27:56,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:27:56,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:27:56,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:27:56,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:27:56,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:27:56,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:27:56,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:27:56,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:27:56,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:27:56,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:27:56,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:27:56,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:27:56,927 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba9918f9236391a08a9d6d8a63aa823d4042d99b397d7843518d83dccab2fbf8 [2024-11-11 19:27:57,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:27:57,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:27:57,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:27:57,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:27:57,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:27:57,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-2.c [2024-11-11 19:27:58,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:27:58,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:27:58,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c [2024-11-11 19:27:58,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cd8a537/f2bc0f4f6f7a428db47b7dbec891f4d3/FLAGb86334cb8 [2024-11-11 19:27:58,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cd8a537/f2bc0f4f6f7a428db47b7dbec891f4d3 [2024-11-11 19:27:58,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:27:58,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:27:58,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:27:58,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:27:58,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:27:58,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:27:58" (1/1) ... [2024-11-11 19:27:58,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a8ed8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:58, skipping insertion in model container [2024-11-11 19:27:58,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:27:58" (1/1) ... [2024-11-11 19:27:58,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:27:59,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c[807,820] [2024-11-11 19:27:59,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:27:59,171 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:27:59,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c[807,820] [2024-11-11 19:27:59,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:27:59,206 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:27:59,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59 WrapperNode [2024-11-11 19:27:59,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:27:59,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:27:59,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:27:59,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:27:59,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,235 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-11 19:27:59,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:27:59,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:27:59,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:27:59,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:27:59,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,263 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-11 19:27:59,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:27:59,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:27:59,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:27:59,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:27:59,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (1/1) ... [2024-11-11 19:27:59,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:27:59,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:59,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:27:59,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:27:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:27:59,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:27:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:27:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:27:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:27:59,412 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:27:59,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:27:59,538 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-11 19:27:59,538 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:27:59,547 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:27:59,547 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:27:59,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:59 BoogieIcfgContainer [2024-11-11 19:27:59,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:27:59,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:27:59,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:27:59,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:27:59,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:27:58" (1/3) ... [2024-11-11 19:27:59,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b73dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:27:59, skipping insertion in model container [2024-11-11 19:27:59,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:59" (2/3) ... [2024-11-11 19:27:59,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b73dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:27:59, skipping insertion in model container [2024-11-11 19:27:59,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:59" (3/3) ... [2024-11-11 19:27:59,554 INFO L112 eAbstractionObserver]: Analyzing ICFG test24-2.c [2024-11-11 19:27:59,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:27:59,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:27:59,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:27:59,648 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3390b680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:27:59,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:27:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:27:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:27:59,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:59,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:59,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1829445793, now seen corresponding path program 1 times [2024-11-11 19:27:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780430305] [2024-11-11 19:27:59,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780430305] [2024-11-11 19:27:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780430305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:27:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:27:59,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:27:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579776243] [2024-11-11 19:27:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:27:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:27:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:27:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:27:59,894 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:27:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:59,920 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-11 19:27:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:27:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:27:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:59,928 INFO L225 Difference]: With dead ends: 32 [2024-11-11 19:27:59,928 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 19:27:59,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:27:59,933 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:59,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:27:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 19:27:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-11 19:27:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:27:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-11 19:27:59,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-11-11 19:27:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:59,959 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-11 19:27:59,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:27:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-11 19:27:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 19:27:59,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:59,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:27:59,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1835948819, now seen corresponding path program 1 times [2024-11-11 19:27:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314159915] [2024-11-11 19:27:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314159915] [2024-11-11 19:28:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314159915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323963349] [2024-11-11 19:28:00,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:00,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:28:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:28:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:00,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 19:28:00,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323963349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:00,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 19:28:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363839600] [2024-11-11 19:28:00,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:28:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:28:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:28:00,287 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:00,309 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-11 19:28:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:28:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-11 19:28:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:00,310 INFO L225 Difference]: With dead ends: 29 [2024-11-11 19:28:00,311 INFO L226 Difference]: Without dead ends: 20 [2024-11-11 19:28:00,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:28:00,312 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:00,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-11 19:28:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-11 19:28:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-11 19:28:00,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2024-11-11 19:28:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:00,320 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-11 19:28:00,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-11 19:28:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 19:28:00,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:00,321 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:00,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:28:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:00,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:00,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1825935181, now seen corresponding path program 2 times [2024-11-11 19:28:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:00,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245352822] [2024-11-11 19:28:00,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245352822] [2024-11-11 19:28:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245352822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434348882] [2024-11-11 19:28:00,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:28:00,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:00,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:28:00,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:28:00,758 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:28:00,758 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:28:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 19:28:00,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434348882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:00,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 19:28:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102751120] [2024-11-11 19:28:00,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:28:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:28:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:28:00,864 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:00,907 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-11 19:28:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 19:28:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-11 19:28:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:00,911 INFO L225 Difference]: With dead ends: 41 [2024-11-11 19:28:00,911 INFO L226 Difference]: Without dead ends: 32 [2024-11-11 19:28:00,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:28:00,912 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:00,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-11 19:28:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-11 19:28:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-11 19:28:00,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 19 [2024-11-11 19:28:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-11 19:28:00,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-11 19:28:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 19:28:00,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:00,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:00,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:28:01,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 19:28:01,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:01,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2028479167, now seen corresponding path program 3 times [2024-11-11 19:28:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777840862] [2024-11-11 19:28:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777840862] [2024-11-11 19:28:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777840862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583326157] [2024-11-11 19:28:01,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:28:01,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:01,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:01,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:28:01,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:28:01,705 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-11 19:28:01,705 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:28:01,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 19:28:01,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:01,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583326157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:01,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-11-11 19:28:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80820173] [2024-11-11 19:28:01,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 19:28:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 19:28:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-11 19:28:01,965 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:02,023 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-11-11 19:28:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 19:28:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 19:28:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:02,024 INFO L225 Difference]: With dead ends: 61 [2024-11-11 19:28:02,024 INFO L226 Difference]: Without dead ends: 52 [2024-11-11 19:28:02,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-11 19:28:02,025 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:02,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-11 19:28:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-11 19:28:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-11 19:28:02,042 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 31 [2024-11-11 19:28:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:02,042 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-11 19:28:02,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-11 19:28:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 19:28:02,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:02,045 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:02,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:28:02,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:02,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:02,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1081145555, now seen corresponding path program 4 times [2024-11-11 19:28:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304662240] [2024-11-11 19:28:02,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:28:02,336 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 19:28:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:28:02,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 19:28:02,437 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 19:28:02,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:28:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:28:02,442 INFO L421 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-11 19:28:02,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:28:02,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:28:02 BoogieIcfgContainer [2024-11-11 19:28:02,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:28:02,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:28:02,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:28:02,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:28:02,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:59" (3/4) ... [2024-11-11 19:28:02,484 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 19:28:02,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:28:02,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:28:02,536 INFO L158 Benchmark]: Toolchain (without parser) took 3570.31ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 86.4MB in the beginning and 132.9MB in the end (delta: -46.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:28:02,536 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:28:02,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.95ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 73.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.73ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 71.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,537 INFO L158 Benchmark]: Boogie Preprocessor took 41.37ms. Allocated memory is still 159.4MB. Free memory was 71.9MB in the beginning and 70.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,537 INFO L158 Benchmark]: RCFGBuilder took 269.94ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 127.7MB in the end (delta: -57.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,537 INFO L158 Benchmark]: TraceAbstraction took 2930.39ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 127.0MB in the beginning and 136.1MB in the end (delta: -9.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,537 INFO L158 Benchmark]: Witness Printer took 55.23ms. Allocated memory is still 205.5MB. Free memory was 136.1MB in the beginning and 132.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:28:02,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.95ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 73.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.73ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 71.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.37ms. Allocated memory is still 159.4MB. Free memory was 71.9MB in the beginning and 70.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.94ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 127.7MB in the end (delta: -57.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2930.39ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 127.0MB in the beginning and 136.1MB in the end (delta: -9.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Witness Printer took 55.23ms. Allocated memory is still 205.5MB. Free memory was 136.1MB in the beginning and 132.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 39]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] struct dummy ad1[20], *ad2; [L18] int i, j, *pa; [L19] j=0 VAL [ad1={5:0}, j=0] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=1] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=2] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=3] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=4] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=5] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=6] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=7] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=8] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=9] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=10] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=11] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=12] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=13] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=14] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=15] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=16] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=17] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=18] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=19] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=20] [L19] COND FALSE !(j<20) VAL [ad1={5:0}] [L23] i = __VERIFIER_nondet_int() [L24] COND TRUE i >= 0 && i < 10 [L25] ad2 = ad1 [L26] ad1[i].a = i [L27] pa = &ad1[i].a [L28] EXPR ad2[i].a [L28] i = ad2[i].a + 10 [L29] EXPR \read(*pa) [L29] COND FALSE !(i < *pa) [L32] CALL, EXPR check(ad1, i) [L12] EXPR ad1[b].a [L12] return ad1[b].a == b; [L32] RET, EXPR check(ad1, i) [L32] COND TRUE !check(ad1, i) [L39] reach_error() VAL [pa={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 53 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 429 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/351 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-11 19:28:02,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE