/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:26:30,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:26:30,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:26:30,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:26:30,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:26:30,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:26:30,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:26:30,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:26:30,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:26:30,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:26:30,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:26:30,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:26:30,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:26:30,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:26:30,417 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:26:30,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:26:30,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:26:30,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:30,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:30,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:30,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:26:30,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:26:30,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:26:30,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:26:30,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:26:30,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:26:30,653 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:26:30,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 17:26:31,942 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065190715/291e0aaddf6842e3a104937de6110e9f/FLAG7c111c857 [2025-04-13 17:26:32,212 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:26:32,212 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 17:26:32,219 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065190715/291e0aaddf6842e3a104937de6110e9f/FLAG7c111c857 [2025-04-13 17:26:32,943 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065190715/291e0aaddf6842e3a104937de6110e9f [2025-04-13 17:26:32,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:26:32,946 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:26:32,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:32,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:26:32,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:26:32,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:32" (1/1) ... [2025-04-13 17:26:32,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719368e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:32, skipping insertion in model container [2025-04-13 17:26:32,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:32" (1/1) ... [2025-04-13 17:26:32,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:26:33,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2025-04-13 17:26:33,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:33,191 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:26:33,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2025-04-13 17:26:33,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:33,255 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:26:33,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33 WrapperNode [2025-04-13 17:26:33,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:33,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:33,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:26:33,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:26:33,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,291 INFO L138 Inliner]: procedures = 162, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-04-13 17:26:33,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:33,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:26:33,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:26:33,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:26:33,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,323 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-13 17:26:33,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:26:33,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:26:33,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:26:33,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:26:33,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (1/1) ... [2025-04-13 17:26:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:33,371 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) [2025-04-13 17:26:33,373 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 [2025-04-13 17:26:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:26:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:26:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 17:26:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:26:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:26:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:26:33,391 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:26:33,490 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:26:33,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:26:33,671 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:26:33,672 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:26:33,672 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:26:33,862 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:26:33,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:33 BoogieIcfgContainer [2025-04-13 17:26:33,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:26:33,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:26:33,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:26:33,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:26:33,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:26:32" (1/3) ... [2025-04-13 17:26:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679903c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:33, skipping insertion in model container [2025-04-13 17:26:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:33" (2/3) ... [2025-04-13 17:26:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679903c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:33, skipping insertion in model container [2025-04-13 17:26:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:33" (3/3) ... [2025-04-13 17:26:33,871 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 17:26:33,882 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:26:33,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i that has 2 procedures, 42 locations, 40 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 17:26:33,883 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:26:33,919 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 17:26:33,943 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 41 transitions, 89 flow [2025-04-13 17:26:33,970 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 272 states, 270 states have (on average 1.885185185185185) internal successors, (509), 271 states have internal predecessors, (509), 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) [2025-04-13 17:26:33,993 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:26:34,000 INFO L340 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=FINITE_AUTOMATA, 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;@61bf6733, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:26:34,000 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:26:34,002 INFO L278 IsEmpty]: Start isEmpty. Operand has 272 states, 270 states have (on average 1.885185185185185) internal successors, (509), 271 states have internal predecessors, (509), 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) [2025-04-13 17:26:34,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:26:34,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,006 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:26:34,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -668790403, now seen corresponding path program 1 times [2025-04-13 17:26:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947474363] [2025-04-13 17:26:34,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:26:34,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:26:34,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:34,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:34,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947474363] [2025-04-13 17:26:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947474363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:26:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780916163] [2025-04-13 17:26:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:34,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:26:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:34,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:26:34,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:34,261 INFO L87 Difference]: Start difference. First operand has 272 states, 270 states have (on average 1.885185185185185) internal successors, (509), 271 states have internal predecessors, (509), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-04-13 17:26:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:34,341 INFO L93 Difference]: Finished difference Result 326 states and 593 transitions. [2025-04-13 17:26:34,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:26:34,343 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-13 17:26:34,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:34,349 INFO L225 Difference]: With dead ends: 326 [2025-04-13 17:26:34,349 INFO L226 Difference]: Without dead ends: 167 [2025-04-13 17:26:34,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:34,357 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:34,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-13 17:26:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-04-13 17:26:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.7454545454545454) internal successors, (288), 166 states have internal predecessors, (288), 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) [2025-04-13 17:26:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 288 transitions. [2025-04-13 17:26:34,398 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 288 transitions. Word has length 7 [2025-04-13 17:26:34,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:34,398 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 288 transitions. [2025-04-13 17:26:34,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-04-13 17:26:34,398 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 288 transitions. [2025-04-13 17:26:34,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:26:34,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:26:34,399 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:26:34,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1766483156, now seen corresponding path program 1 times [2025-04-13 17:26:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589179771] [2025-04-13 17:26:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:26:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:34,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:34,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589179771] [2025-04-13 17:26:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589179771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:34,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:26:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219556431] [2025-04-13 17:26:34,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:34,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:26:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:34,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:26:34,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:34,507 INFO L87 Difference]: Start difference. First operand 167 states and 288 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-13 17:26:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:34,571 INFO L93 Difference]: Finished difference Result 237 states and 400 transitions. [2025-04-13 17:26:34,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:26:34,572 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-04-13 17:26:34,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:34,573 INFO L225 Difference]: With dead ends: 237 [2025-04-13 17:26:34,573 INFO L226 Difference]: Without dead ends: 148 [2025-04-13 17:26:34,573 INFO L436 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 [2025-04-13 17:26:34,574 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:34,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-13 17:26:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-04-13 17:26:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.6827586206896552) internal successors, (244), 147 states have internal predecessors, (244), 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) [2025-04-13 17:26:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 244 transitions. [2025-04-13 17:26:34,603 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 244 transitions. Word has length 14 [2025-04-13 17:26:34,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:34,603 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 244 transitions. [2025-04-13 17:26:34,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-13 17:26:34,604 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 244 transitions. [2025-04-13 17:26:34,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:26:34,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:26:34,604 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:26:34,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 223627513, now seen corresponding path program 1 times [2025-04-13 17:26:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214417490] [2025-04-13 17:26:34,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:26:34,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:26:34,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:34,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:34,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214417490] [2025-04-13 17:26:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214417490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:34,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:34,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72707650] [2025-04-13 17:26:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:34,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:34,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:34,802 INFO L87 Difference]: Start difference. First operand 148 states and 244 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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) [2025-04-13 17:26:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:34,859 INFO L93 Difference]: Finished difference Result 218 states and 352 transitions. [2025-04-13 17:26:34,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:34,860 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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) Word has length 15 [2025-04-13 17:26:34,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:34,861 INFO L225 Difference]: With dead ends: 218 [2025-04-13 17:26:34,861 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 17:26:34,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:34,862 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:34,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 17:26:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-13 17:26:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.6610169491525424) internal successors, (196), 119 states have internal predecessors, (196), 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) [2025-04-13 17:26:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 196 transitions. [2025-04-13 17:26:34,867 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 196 transitions. Word has length 15 [2025-04-13 17:26:34,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:34,867 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 196 transitions. [2025-04-13 17:26:34,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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) [2025-04-13 17:26:34,867 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 196 transitions. [2025-04-13 17:26:34,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:26:34,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:26:34,868 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:26:34,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -583156921, now seen corresponding path program 1 times [2025-04-13 17:26:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245868458] [2025-04-13 17:26:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:26:34,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:26:34,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:34,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:35,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245868458] [2025-04-13 17:26:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245868458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040116786] [2025-04-13 17:26:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:35,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:35,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:35,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:35,006 INFO L87 Difference]: Start difference. First operand 120 states and 196 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) [2025-04-13 17:26:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:35,039 INFO L93 Difference]: Finished difference Result 132 states and 212 transitions. [2025-04-13 17:26:35,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:35,040 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) Word has length 22 [2025-04-13 17:26:35,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:35,041 INFO L225 Difference]: With dead ends: 132 [2025-04-13 17:26:35,041 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 17:26:35,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:35,042 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:35,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 19 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 17:26:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-13 17:26:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 81 states have internal predecessors, (138), 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) [2025-04-13 17:26:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2025-04-13 17:26:35,064 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 22 [2025-04-13 17:26:35,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:35,064 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2025-04-13 17:26:35,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) [2025-04-13 17:26:35,064 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2025-04-13 17:26:35,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:26:35,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:35,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:35,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:26:35,065 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:26:35,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -32740224, now seen corresponding path program 1 times [2025-04-13 17:26:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:35,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881672906] [2025-04-13 17:26:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:35,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:26:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:26:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:35,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881672906] [2025-04-13 17:26:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881672906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548539455] [2025-04-13 17:26:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:35,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:35,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:35,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:35,234 INFO L87 Difference]: Start difference. First operand 82 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2025-04-13 17:26:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:35,270 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2025-04-13 17:26:35,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:35,271 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-04-13 17:26:35,271 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:35,271 INFO L225 Difference]: With dead ends: 82 [2025-04-13 17:26:35,271 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:26:35,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:35,272 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:35,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 16 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:26:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:26:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:26:35,273 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2025-04-13 17:26:35,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:35,273 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:26:35,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2025-04-13 17:26:35,273 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:26:35,273 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:26:35,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:26:35,277 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 17:26:35,277 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:26:35,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:26:35,282 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 17:26:35,284 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:26:35,284 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:26:35,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:26:35 BasicIcfg [2025-04-13 17:26:35,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:26:35,289 INFO L158 Benchmark]: Toolchain (without parser) took 2343.00ms. Allocated memory is still 125.8MB. Free memory was 84.6MB in the beginning and 46.5MB in the end (delta: 38.0MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. [2025-04-13 17:26:35,289 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:26:35,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.65ms. Allocated memory is still 125.8MB. Free memory was 84.6MB in the beginning and 61.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:26:35,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.45ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 59.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:26:35,290 INFO L158 Benchmark]: Boogie Preprocessor took 49.10ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:26:35,290 INFO L158 Benchmark]: RCFGBuilder took 521.21ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 82.0MB in the end (delta: -24.0MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2025-04-13 17:26:35,290 INFO L158 Benchmark]: TraceAbstraction took 1424.75ms. Allocated memory is still 125.8MB. Free memory was 82.0MB in the beginning and 46.5MB in the end (delta: 35.5MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2025-04-13 17:26:35,291 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.22ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.65ms. Allocated memory is still 125.8MB. Free memory was 84.6MB in the beginning and 61.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.45ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 59.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 49.10ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 521.21ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 82.0MB in the end (delta: -24.0MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1424.75ms. Allocated memory is still 125.8MB. Free memory was 82.0MB in the beginning and 46.5MB in the end (delta: 35.5MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 61 locations, 60 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 69 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:26:35,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...