./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/weaver/popl20-bad-counter-queue.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:49:08,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:49:08,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:49:08,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:49:08,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:49:08,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:49:08,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:49:08,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:49:08,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:49:08,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:49:08,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:49:08,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:49:08,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:49:08,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:49:08,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:49:08,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:49:08,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:49:08,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:49:08,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:49:08,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:49:08,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:49:08,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:49:08,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:49:08,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:49:08,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:49:08,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:49:08,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:49:08,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:49:08,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:49:08,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:49:08,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:49:08,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:49:08,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:49:08,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:49:08,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:49:08,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:49:08,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:49:08,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:49:08,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:49:08,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:49:08,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:49:08,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:49:08,573 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-19 01:49:08,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:49:08,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:49:08,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:49:08,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:49:08,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:49:08,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-19 01:49:10,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:49:10,532 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:49:10,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-19 01:49:10,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6164233/279b0f6b4d2d4154bfdc0bd1f9e5dbee/FLAG58038c24c [2024-11-19 01:49:10,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6164233/279b0f6b4d2d4154bfdc0bd1f9e5dbee [2024-11-19 01:49:10,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:49:10,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:49:10,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:49:10,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:49:10,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:49:10,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:49:10" (1/1) ... [2024-11-19 01:49:10,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57320343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:10, skipping insertion in model container [2024-11-19 01:49:10,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:49:10" (1/1) ... [2024-11-19 01:49:10,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:49:11,159 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/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-19 01:49:11,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:49:11,181 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:49:11,197 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/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-19 01:49:11,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:49:11,219 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:49:11,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11 WrapperNode [2024-11-19 01:49:11,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:49:11,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:49:11,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:49:11,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:49:11,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,257 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2024-11-19 01:49:11,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:49:11,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:49:11,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:49:11,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:49:11,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,291 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 01:49:11,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:49:11,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:49:11,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:49:11,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:49:11,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (1/1) ... [2024-11-19 01:49:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:49:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:49:11,343 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-19 01:49:11,346 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-19 01:49:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:49:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:49:11,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:49:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:49:11,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:49:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:49:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:49:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:49:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:49:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 01:49:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:49:11,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:49:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:49:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:49:11,386 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:49:11,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:49:11,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:49:11,723 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:49:11,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:49:11,971 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:49:11,971 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 01:49:11,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:49:11 BoogieIcfgContainer [2024-11-19 01:49:11,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:49:11,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:49:11,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:49:11,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:49:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:49:10" (1/3) ... [2024-11-19 01:49:11,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780853dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:49:11, skipping insertion in model container [2024-11-19 01:49:11,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:49:11" (2/3) ... [2024-11-19 01:49:11,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780853dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:49:11, skipping insertion in model container [2024-11-19 01:49:11,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:49:11" (3/3) ... [2024-11-19 01:49:11,981 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-19 01:49:11,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:49:11,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:49:11,999 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:49:12,057 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 01:49:12,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2024-11-19 01:49:12,115 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-19 01:49:12,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:49:12,119 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 26 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-11-19 01:49:12,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2024-11-19 01:49:12,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 54 flow [2024-11-19 01:49:12,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:49:12,141 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;@3b90853b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:49:12,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:49:12,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:49:12,151 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-19 01:49:12,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:49:12,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:12,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:12,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1886050125, now seen corresponding path program 1 times [2024-11-19 01:49:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:12,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118521483] [2024-11-19 01:49:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:12,458 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-19 01:49:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118521483] [2024-11-19 01:49:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118521483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:49:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420437826] [2024-11-19 01:49:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:49:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:49:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:49:12,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-11-19 01:49:12,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:12,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:12,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-11-19 01:49:12,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:12,645 INFO L124 PetriNetUnfolderBase]: 147/258 cut-off events. [2024-11-19 01:49:12,645 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-19 01:49:12,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 147/258 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 845 event pairs, 42 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 480. Up to 168 conditions per place. [2024-11-19 01:49:12,653 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2024-11-19 01:49:12,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 155 flow [2024-11-19 01:49:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:49:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:49:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-11-19 01:49:12,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-11-19 01:49:12,670 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 3 states and 43 transitions. [2024-11-19 01:49:12,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 155 flow [2024-11-19 01:49:12,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 01:49:12,678 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 65 flow [2024-11-19 01:49:12,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2024-11-19 01:49:12,685 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-11-19 01:49:12,685 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 65 flow [2024-11-19 01:49:12,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:12,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:12,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:12,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:49:12,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1887543748, now seen corresponding path program 1 times [2024-11-19 01:49:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059013308] [2024-11-19 01:49:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:12,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-19 01:49:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059013308] [2024-11-19 01:49:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059013308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:49:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439739275] [2024-11-19 01:49:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:49:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:49:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:49:12,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:49:12,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-19 01:49:12,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:12,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:49:12,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:13,130 INFO L124 PetriNetUnfolderBase]: 179/352 cut-off events. [2024-11-19 01:49:13,131 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 01:49:13,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 352 events. 179/352 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1437 event pairs, 120 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 321. Up to 203 conditions per place. [2024-11-19 01:49:13,139 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 35 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2024-11-19 01:49:13,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 45 transitions, 196 flow [2024-11-19 01:49:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:49:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:49:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-11-19 01:49:13,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-19 01:49:13,142 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 65 flow. Second operand 5 states and 66 transitions. [2024-11-19 01:49:13,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 45 transitions, 196 flow [2024-11-19 01:49:13,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:49:13,145 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 98 flow [2024-11-19 01:49:13,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2024-11-19 01:49:13,146 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2024-11-19 01:49:13,147 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 98 flow [2024-11-19 01:49:13,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-19 01:49:13,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:13,147 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:49:13,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash 51907068, now seen corresponding path program 1 times [2024-11-19 01:49:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340221546] [2024-11-19 01:49:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:13,347 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-19 01:49:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340221546] [2024-11-19 01:49:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340221546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:49:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339425038] [2024-11-19 01:49:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:49:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:49:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:49:13,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:49:13,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-19 01:49:13,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:13,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:49:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:13,475 INFO L124 PetriNetUnfolderBase]: 144/283 cut-off events. [2024-11-19 01:49:13,475 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-19 01:49:13,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 283 events. 144/283 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1045 event pairs, 101 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 526. Up to 203 conditions per place. [2024-11-19 01:49:13,479 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 17 selfloop transitions, 2 changer transitions 15/39 dead transitions. [2024-11-19 01:49:13,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 203 flow [2024-11-19 01:49:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:49:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:49:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-11-19 01:49:13,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 01:49:13,482 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 98 flow. Second operand 5 states and 60 transitions. [2024-11-19 01:49:13,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 203 flow [2024-11-19 01:49:13,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 199 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 01:49:13,486 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 86 flow [2024-11-19 01:49:13,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2024-11-19 01:49:13,488 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2024-11-19 01:49:13,489 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 86 flow [2024-11-19 01:49:13,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-19 01:49:13,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:13,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:13,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:49:13,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:13,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 50348621, now seen corresponding path program 1 times [2024-11-19 01:49:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798313572] [2024-11-19 01:49:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798313572] [2024-11-19 01:49:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798313572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:49:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728742758] [2024-11-19 01:49:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:13,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:49:13,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:49:13,618 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-19 01:49:13,620 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-19 01:49:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:13,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:49:13,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:49:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:13,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:49:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:13,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728742758] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:49:13,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:49:13,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-19 01:49:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898642487] [2024-11-19 01:49:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:13,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:49:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:49:13,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:13,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:49:13,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-19 01:49:13,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:13,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:49:13,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:13,942 INFO L124 PetriNetUnfolderBase]: 118/226 cut-off events. [2024-11-19 01:49:13,943 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 01:49:13,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 226 events. 118/226 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 760 event pairs, 42 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 566. Up to 103 conditions per place. [2024-11-19 01:49:13,946 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 21 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2024-11-19 01:49:13,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 161 flow [2024-11-19 01:49:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:49:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:49:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-11-19 01:49:13,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-11-19 01:49:13,949 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 86 flow. Second operand 5 states and 52 transitions. [2024-11-19 01:49:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 161 flow [2024-11-19 01:49:13,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-19 01:49:13,951 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 91 flow [2024-11-19 01:49:13,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-11-19 01:49:13,953 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2024-11-19 01:49:13,954 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 91 flow [2024-11-19 01:49:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-19 01:49:13,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:13,954 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:13,977 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-19 01:49:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:49:14,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 468387871, now seen corresponding path program 1 times [2024-11-19 01:49:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429674985] [2024-11-19 01:49:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429674985] [2024-11-19 01:49:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429674985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:49:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379388895] [2024-11-19 01:49:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:49:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:49:14,241 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-19 01:49:14,242 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-19 01:49:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:14,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:49:14,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:49:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:14,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:49:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:49:14,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379388895] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:49:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:49:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-19 01:49:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935925684] [2024-11-19 01:49:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:14,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:49:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:14,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:49:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:14,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:49:14,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-19 01:49:14,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:14,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:49:14,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:14,512 INFO L124 PetriNetUnfolderBase]: 117/220 cut-off events. [2024-11-19 01:49:14,512 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-19 01:49:14,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 220 events. 117/220 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 709 event pairs, 36 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 550. Up to 96 conditions per place. [2024-11-19 01:49:14,514 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 24 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-11-19 01:49:14,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 184 flow [2024-11-19 01:49:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:49:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:49:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2024-11-19 01:49:14,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-11-19 01:49:14,516 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 91 flow. Second operand 5 states and 53 transitions. [2024-11-19 01:49:14,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 184 flow [2024-11-19 01:49:14,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 175 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:49:14,518 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 108 flow [2024-11-19 01:49:14,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-11-19 01:49:14,519 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2024-11-19 01:49:14,519 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 108 flow [2024-11-19 01:49:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-19 01:49:14,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:14,520 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:14,537 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-19 01:49:14,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:49:14,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:49:14,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1559466504, now seen corresponding path program 1 times [2024-11-19 01:49:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551298238] [2024-11-19 01:49:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:49:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:49:14,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:49:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:49:14,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:49:14,791 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:49:14,792 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-19 01:49:14,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-19 01:49:14,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:49:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:49:14,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 01:49:14,848 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:49:14,848 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:49:14,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:49:14 BasicIcfg [2024-11-19 01:49:14,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:49:14,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:49:14,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:49:14,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:49:14,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:49:11" (3/4) ... [2024-11-19 01:49:14,855 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:49:14,916 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:49:14,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:49:14,917 INFO L158 Benchmark]: Toolchain (without parser) took 3993.28ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 100.3MB in the beginning and 140.8MB in the end (delta: -40.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,919 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:49:14,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 86.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.67ms. Allocated memory is still 157.3MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,920 INFO L158 Benchmark]: Boogie Preprocessor took 47.72ms. Allocated memory is still 157.3MB. Free memory was 84.8MB in the beginning and 82.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,921 INFO L158 Benchmark]: RCFGBuilder took 665.81ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 82.3MB in the beginning and 144.3MB in the end (delta: -62.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,921 INFO L158 Benchmark]: TraceAbstraction took 2878.88ms. Allocated memory is still 199.2MB. Free memory was 143.2MB in the beginning and 146.0MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:49:14,921 INFO L158 Benchmark]: Witness Printer took 62.88ms. Allocated memory is still 199.2MB. Free memory was 146.0MB in the beginning and 140.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:49:14,922 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 157.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 86.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.67ms. Allocated memory is still 157.3MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.72ms. Allocated memory is still 157.3MB. Free memory was 84.8MB in the beginning and 82.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 665.81ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 82.3MB in the beginning and 144.3MB in the end (delta: -62.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2878.88ms. Allocated memory is still 199.2MB. Free memory was 143.2MB in the beginning and 146.0MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.88ms. Allocated memory is still 199.2MB. Free memory was 146.0MB in the beginning and 140.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-4, i=0, tmp=-4] [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=4, i=0, tmp=4] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=4, i=1] [L48] 1 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=4, i=1] [L48] COND FALSE 1 !(i