./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:53:24,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:53:24,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:53:24,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:53:24,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:53:24,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:53:24,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:53:24,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:53:24,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:53:24,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:53:24,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:53:24,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:53:24,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:53:24,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:53:24,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:53:24,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:53:24,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:53:24,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:53:24,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:53:24,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:53:24,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:53:24,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:53:24,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:53:24,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:53:24,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:53:24,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:53:24,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:53:24,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:24,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:53:24,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:53:24,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:53:24,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:53:24,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e [2024-11-09 02:53:24,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:53:24,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:53:24,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:53:24,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:53:24,499 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:53:24,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 02:53:25,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:53:25,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:53:25,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 02:53:25,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315a96df9/25d351cb3f8c4f1993d2f88f9e5f9986/FLAGfb74565b8 [2024-11-09 02:53:26,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315a96df9/25d351cb3f8c4f1993d2f88f9e5f9986 [2024-11-09 02:53:26,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:53:26,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:53:26,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:26,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:53:26,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:53:26,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e8aa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26, skipping insertion in model container [2024-11-09 02:53:26,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:53:26,582 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-1.i[33026,33039] [2024-11-09 02:53:26,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:26,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:53:26,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-1.i[33026,33039] [2024-11-09 02:53:26,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:26,679 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:53:26,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26 WrapperNode [2024-11-09 02:53:26,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:26,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:26,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:53:26,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:53:26,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,718 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-11-09 02:53:26,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:26,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:53:26,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:53:26,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:53:26,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 02:53:26,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:53:26,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:53:26,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:53:26,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:53:26,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (1/1) ... [2024-11-09 02:53:26,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:26,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:26,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:53:26,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:53:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:53:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 02:53:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 02:53:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 02:53:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 02:53:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:53:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:53:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:53:26,844 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:53:26,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:53:26,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:53:27,065 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:53:27,065 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:53:27,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:53:27,130 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:53:27,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:27 BoogieIcfgContainer [2024-11-09 02:53:27,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:53:27,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:53:27,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:53:27,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:53:27,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:53:26" (1/3) ... [2024-11-09 02:53:27,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af600df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:27, skipping insertion in model container [2024-11-09 02:53:27,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:26" (2/3) ... [2024-11-09 02:53:27,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af600df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:27, skipping insertion in model container [2024-11-09 02:53:27,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:27" (3/3) ... [2024-11-09 02:53:27,138 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-1.i [2024-11-09 02:53:27,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:53:27,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:53:27,151 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:53:27,180 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 02:53:27,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2024-11-09 02:53:27,230 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-09 02:53:27,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:53:27,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2024-11-09 02:53:27,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2024-11-09 02:53:27,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 49 flow [2024-11-09 02:53:27,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:27,250 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15a61c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:27,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 02:53:27,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:27,256 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-11-09 02:53:27,256 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:53:27,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:27,257 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:27,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -367970190, now seen corresponding path program 1 times [2024-11-09 02:53:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793307387] [2024-11-09 02:53:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793307387] [2024-11-09 02:53:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793307387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:53:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414164679] [2024-11-09 02:53:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:27,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:53:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:53:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:53:27,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:27,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 49 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:27,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:27,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:27,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:27,806 INFO L124 PetriNetUnfolderBase]: 151/284 cut-off events. [2024-11-09 02:53:27,806 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 02:53:27,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 284 events. 151/284 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 68 based on Foata normal form. 11/239 useless extension candidates. Maximal degree in co-relation 520. Up to 145 conditions per place. [2024-11-09 02:53:27,812 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 7 changer transitions 6/41 dead transitions. [2024-11-09 02:53:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 176 flow [2024-11-09 02:53:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-11-09 02:53:27,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-11-09 02:53:27,822 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 49 flow. Second operand 6 states and 70 transitions. [2024-11-09 02:53:27,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 176 flow [2024-11-09 02:53:27,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:53:27,826 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 83 flow [2024-11-09 02:53:27,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-09 02:53:27,831 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2024-11-09 02:53:27,831 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 83 flow [2024-11-09 02:53:27,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:27,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:27,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:27,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:53:27,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1477795366, now seen corresponding path program 1 times [2024-11-09 02:53:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99521427] [2024-11-09 02:53:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:27,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99521427] [2024-11-09 02:53:27,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99521427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:27,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:27,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510187672] [2024-11-09 02:53:27,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:27,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:27,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:27,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:27,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:27,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:27,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:28,037 INFO L124 PetriNetUnfolderBase]: 106/228 cut-off events. [2024-11-09 02:53:28,037 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-09 02:53:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 228 events. 106/228 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 877 event pairs, 27 based on Foata normal form. 13/226 useless extension candidates. Maximal degree in co-relation 355. Up to 85 conditions per place. [2024-11-09 02:53:28,039 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 16 selfloop transitions, 3 changer transitions 18/40 dead transitions. [2024-11-09 02:53:28,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 212 flow [2024-11-09 02:53:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:53:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:53:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-11-09 02:53:28,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-09 02:53:28,041 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 83 flow. Second operand 5 states and 60 transitions. [2024-11-09 02:53:28,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 212 flow [2024-11-09 02:53:28,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:28,043 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 76 flow [2024-11-09 02:53:28,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2024-11-09 02:53:28,044 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2024-11-09 02:53:28,044 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 76 flow [2024-11-09 02:53:28,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:28,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:28,045 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:53:28,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1171723523, now seen corresponding path program 1 times [2024-11-09 02:53:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308871964] [2024-11-09 02:53:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308871964] [2024-11-09 02:53:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308871964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107280515] [2024-11-09 02:53:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:28,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:28,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:28,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:28,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:53:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:28,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:53:28,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:28,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107280515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:28,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 02:53:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081236499] [2024-11-09 02:53:28,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:28,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:53:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:28,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:53:28,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:53:28,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:28,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 76 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:28,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:28,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:28,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:28,476 INFO L124 PetriNetUnfolderBase]: 59/128 cut-off events. [2024-11-09 02:53:28,476 INFO L125 PetriNetUnfolderBase]: For 41/42 co-relation queries the response was YES. [2024-11-09 02:53:28,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 128 events. 59/128 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 361 event pairs, 27 based on Foata normal form. 5/118 useless extension candidates. Maximal degree in co-relation 318. Up to 69 conditions per place. [2024-11-09 02:53:28,477 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 18 selfloop transitions, 4 changer transitions 9/34 dead transitions. [2024-11-09 02:53:28,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 179 flow [2024-11-09 02:53:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:53:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:53:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2024-11-09 02:53:28,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-11-09 02:53:28,480 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 76 flow. Second operand 7 states and 67 transitions. [2024-11-09 02:53:28,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 179 flow [2024-11-09 02:53:28,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 155 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-11-09 02:53:28,482 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 71 flow [2024-11-09 02:53:28,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2024-11-09 02:53:28,482 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2024-11-09 02:53:28,483 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 71 flow [2024-11-09 02:53:28,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:28,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:28,483 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:28,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:53:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:28,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 289914957, now seen corresponding path program 2 times [2024-11-09 02:53:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748296279] [2024-11-09 02:53:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748296279] [2024-11-09 02:53:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748296279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838284622] [2024-11-09 02:53:28,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:53:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:28,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:28,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:53:28,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:53:28,816 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:53:28,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:53:28,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:28,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:53:28,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838284622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:28,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:53:28,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 02:53:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681033989] [2024-11-09 02:53:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:53:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:53:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:53:28,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:28,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:28,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:28,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:28,994 INFO L124 PetriNetUnfolderBase]: 56/131 cut-off events. [2024-11-09 02:53:28,995 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-09 02:53:28,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 131 events. 56/131 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 27 based on Foata normal form. 5/127 useless extension candidates. Maximal degree in co-relation 343. Up to 60 conditions per place. [2024-11-09 02:53:28,998 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 16 selfloop transitions, 2 changer transitions 12/32 dead transitions. [2024-11-09 02:53:29,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 171 flow [2024-11-09 02:53:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2024-11-09 02:53:29,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-11-09 02:53:29,001 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 71 flow. Second operand 6 states and 59 transitions. [2024-11-09 02:53:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 171 flow [2024-11-09 02:53:29,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 156 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-09 02:53:29,002 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 66 flow [2024-11-09 02:53:29,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2024-11-09 02:53:29,003 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2024-11-09 02:53:29,005 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 66 flow [2024-11-09 02:53:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:29,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:29,006 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:29,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:53:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 02:53:29,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1043709431, now seen corresponding path program 1 times [2024-11-09 02:53:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532811934] [2024-11-09 02:53:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:29,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:29,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:29,245 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:29,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-09 02:53:29,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-09 02:53:29,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 02:53:29,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-09 02:53:29,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:53:29,249 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 02:53:29,279 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:53:29,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:53:29,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:53:29 BasicIcfg [2024-11-09 02:53:29,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:53:29,286 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:53:29,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:53:29,287 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:53:29,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:27" (3/4) ... [2024-11-09 02:53:29,289 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:53:29,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:53:29,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:53:29,328 INFO L158 Benchmark]: Toolchain (without parser) took 3082.36ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 68.9MB in the beginning and 139.0MB in the end (delta: -70.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:53:29,328 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:53:29,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.91ms. Allocated memory is still 146.8MB. Free memory was 68.6MB in the beginning and 107.4MB in the end (delta: -38.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 146.8MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,328 INFO L158 Benchmark]: Boogie Preprocessor took 41.28ms. Allocated memory is still 146.8MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,328 INFO L158 Benchmark]: RCFGBuilder took 370.36ms. Allocated memory is still 146.8MB. Free memory was 103.2MB in the beginning and 103.0MB in the end (delta: 261.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,329 INFO L158 Benchmark]: TraceAbstraction took 2152.16ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 102.4MB in the beginning and 142.1MB in the end (delta: -39.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,329 INFO L158 Benchmark]: Witness Printer took 41.18ms. Allocated memory is still 195.0MB. Free memory was 142.1MB in the beginning and 139.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:53:29,334 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.10ms. Allocated memory is still 146.8MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.91ms. Allocated memory is still 146.8MB. Free memory was 68.6MB in the beginning and 107.4MB in the end (delta: -38.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 146.8MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.28ms. Allocated memory is still 146.8MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.36ms. Allocated memory is still 146.8MB. Free memory was 103.2MB in the beginning and 103.0MB in the end (delta: 261.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2152.16ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 102.4MB in the beginning and 142.1MB in the end (delta: -39.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Witness Printer took 41.18ms. Allocated memory is still 195.0MB. Free memory was 142.1MB in the beginning and 139.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 1 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, limit=0, t1=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=0, t1=0, t2=1] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=2] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, limit=2] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, limit=2] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, limit=2] - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 2 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=1, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 5 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 02:53:29,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE