/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_42-traces-ex-mini_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:52:55,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:52:55,075 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 21:52:55,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:52:55,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:52:55,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:52:55,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:52:55,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:52:55,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:52:55,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:52:55,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:52:55,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:52:55,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:52:55,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:52:55,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:52:55,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:55,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:55,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:52:55,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:52:55,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:52:55,110 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:52:55,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:52:55,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:52:55,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:52:55,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:52:55,320 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:52:55,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_42-traces-ex-mini_true.i [2025-04-13 21:52:56,567 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583551a1d/c69a462b2079402e9369532d27768bf3/FLAG48db6e3ab [2025-04-13 21:52:56,775 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:52:56,775 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_42-traces-ex-mini_true.i [2025-04-13 21:52:56,784 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583551a1d/c69a462b2079402e9369532d27768bf3/FLAG48db6e3ab [2025-04-13 21:52:57,719 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583551a1d/c69a462b2079402e9369532d27768bf3 [2025-04-13 21:52:57,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:52:57,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:52:57,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:57,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:52:57,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:52:57,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:57" (1/1) ... [2025-04-13 21:52:57,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bfbb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:57, skipping insertion in model container [2025-04-13 21:52:57,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:57" (1/1) ... [2025-04-13 21:52:57,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:52:57,878 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_42-traces-ex-mini_true.i[1091,1104] [2025-04-13 21:52:57,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:57,985 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:52:58,000 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_42-traces-ex-mini_true.i[1091,1104] [2025-04-13 21:52:58,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:58,070 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:52:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58 WrapperNode [2025-04-13 21:52:58,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:58,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:58,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:52:58,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:52:58,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,097 INFO L138 Inliner]: procedures = 162, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-04-13 21:52:58,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:58,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:52:58,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:52:58,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:52:58,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,128 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 21:52:58,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:52:58,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:52:58,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:52:58,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:52:58,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (1/1) ... [2025-04-13 21:52:58,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:58,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:58,170 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 21:52:58,175 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 21:52:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:52:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:52:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 21:52:58,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:52:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:52:58,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:52:58,191 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:52:58,280 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:52:58,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:52:58,384 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:52:58,385 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:52:58,385 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:52:58,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:52:58,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:58 BoogieIcfgContainer [2025-04-13 21:52:58,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:52:58,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:52:58,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:52:58,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:52:58,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:52:57" (1/3) ... [2025-04-13 21:52:58,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:58, skipping insertion in model container [2025-04-13 21:52:58,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:58" (2/3) ... [2025-04-13 21:52:58,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:58, skipping insertion in model container [2025-04-13 21:52:58,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:58" (3/3) ... [2025-04-13 21:52:58,511 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_42-traces-ex-mini_true.i [2025-04-13 21:52:58,520 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:52:58,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_42-traces-ex-mini_true.i that has 2 procedures, 27 locations, 25 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:52:58,521 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:52:58,547 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:52:58,569 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 26 transitions, 56 flow [2025-04-13 21:52:58,586 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 82 states, 81 states have (on average 1.7777777777777777) internal successors, (144), 81 states have internal predecessors, (144), 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 21:52:58,605 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:52:58,615 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;@6ed76db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:52:58,616 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 21:52:58,617 INFO L278 IsEmpty]: Start isEmpty. Operand has 82 states, 81 states have (on average 1.7777777777777777) internal successors, (144), 81 states have internal predecessors, (144), 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 21:52:58,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:52:58,623 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:58,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:58,624 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:58,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 288504421, now seen corresponding path program 1 times [2025-04-13 21:52:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:58,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038648393] [2025-04-13 21:52:58,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:58,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:52:58,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:52:58,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:58,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:58,898 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 21:52:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:58,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038648393] [2025-04-13 21:52:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038648393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:52:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925210763] [2025-04-13 21:52:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:58,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:58,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:58,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:58,916 INFO L87 Difference]: Start difference. First operand has 82 states, 81 states have (on average 1.7777777777777777) internal successors, (144), 81 states have internal predecessors, (144), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 21:52:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:58,963 INFO L93 Difference]: Finished difference Result 87 states and 148 transitions. [2025-04-13 21:52:58,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:58,965 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-04-13 21:52:58,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:58,970 INFO L225 Difference]: With dead ends: 87 [2025-04-13 21:52:58,970 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 21:52:58,972 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 21:52:58,974 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:58,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 21:52:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-13 21:52:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 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 21:52:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2025-04-13 21:52:59,001 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 9 [2025-04-13 21:52:59,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:59,001 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2025-04-13 21:52:59,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 21:52:59,002 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2025-04-13 21:52:59,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:52:59,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:59,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:59,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:52:59,004 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:59,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1426778449, now seen corresponding path program 1 times [2025-04-13 21:52:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:59,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005440740] [2025-04-13 21:52:59,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:52:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:52:59,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:59,221 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 21:52:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:59,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005440740] [2025-04-13 21:52:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005440740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:52:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64793987] [2025-04-13 21:52:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:59,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:52:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:59,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:52:59,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:52:59,223 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 21:52:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:59,262 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2025-04-13 21:52:59,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:59,262 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 21:52:59,263 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:59,264 INFO L225 Difference]: With dead ends: 63 [2025-04-13 21:52:59,264 INFO L226 Difference]: Without dead ends: 37 [2025-04-13 21:52:59,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:52:59,265 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:59,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-13 21:52:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-13 21:52:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 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) [2025-04-13 21:52:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-04-13 21:52:59,271 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 14 [2025-04-13 21:52:59,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:59,271 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-04-13 21:52:59,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 21:52:59,271 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2025-04-13 21:52:59,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:52:59,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:59,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:59,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:52:59,272 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:59,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -340279742, now seen corresponding path program 1 times [2025-04-13 21:52:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:59,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920432017] [2025-04-13 21:52:59,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:59,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:52:59,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:52:59,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:59,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:59,441 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 21:52:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:59,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920432017] [2025-04-13 21:52:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920432017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:59,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:52:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040360821] [2025-04-13 21:52:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:59,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:52:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:59,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:52:59,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:59,442 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:52:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:59,473 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2025-04-13 21:52:59,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:52:59,474 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:52:59,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:59,474 INFO L225 Difference]: With dead ends: 37 [2025-04-13 21:52:59,474 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:52:59,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:59,475 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:59,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:52:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:52:59,475 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 21:52:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:52:59,476 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2025-04-13 21:52:59,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:59,476 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:52:59,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:52:59,476 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:52:59,476 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:52:59,479 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-13 21:52:59,480 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-13 21:52:59,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:52:59,482 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 21:52:59,483 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:52:59,483 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:52:59,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:52:59 BasicIcfg [2025-04-13 21:52:59,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:52:59,487 INFO L158 Benchmark]: Toolchain (without parser) took 1765.11ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 44.6MB in the end (delta: 71.7MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2025-04-13 21:52:59,487 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:59,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.04ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 94.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:52:59,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.22ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 91.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:59,488 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 89.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:59,488 INFO L158 Benchmark]: IcfgBuilder took 360.74ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 52.9MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 21:52:59,488 INFO L158 Benchmark]: TraceAbstraction took 979.90ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 44.6MB in the end (delta: 7.5MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2025-04-13 21:52:59,490 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.18ms. Allocated memory is still 159.4MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.04ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 94.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.22ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 91.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 89.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 360.74ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 52.9MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 979.90ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 44.6MB in the end (delta: 7.5MB). Peak memory consumption was 7.5MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 38 locations, 36 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 15 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:52:59,505 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...