./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:30:39,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:30:39,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:30:39,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:30:39,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:30:39,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:30:39,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:30:39,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:30:39,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:30:39,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:30:39,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:30:39,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:30:39,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:30:39,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:30:39,534 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:30:39,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:30:39,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:30:39,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:30:39,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:30:39,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:30:39,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:30:39,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:30:39,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:30:39,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:30:39,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:30:39,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:30:39,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:30:39,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:30:39,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:30:39,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:30:39,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:30:39,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:30:39,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:30:39,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:30:39,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:30:39,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:30:39,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:30:39,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:30:39,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:30:39,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:30:39,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:30:39,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:30:39,546 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-clean/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-clean/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 -> ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 [2024-10-11 14:30:39,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:30:39,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:30:39,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:30:39,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:30:39,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:30:39,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-10-11 14:30:41,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:30:41,472 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:30:41,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-10-11 14:30:41,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b75a25d5/e8a7694ab90a465a9d585ea0bfe6b433/FLAGbe75a8f02 [2024-10-11 14:30:41,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b75a25d5/e8a7694ab90a465a9d585ea0bfe6b433 [2024-10-11 14:30:41,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:30:41,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:30:41,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:30:41,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:30:41,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:30:41,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d214a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41, skipping insertion in model container [2024-10-11 14:30:41,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:30:41,786 WARN L248 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[2454,2467] [2024-10-11 14:30:41,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:30:41,862 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:30:41,880 WARN L248 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[2454,2467] [2024-10-11 14:30:41,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:30:41,907 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:30:41,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41 WrapperNode [2024-10-11 14:30:41,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:30:41,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:30:41,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:30:41,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:30:41,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,948 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2024-10-11 14:30:41,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:30:41,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:30:41,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:30:41,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:30:41,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,977 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-10-11 14:30:41,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:41,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:30:41,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:30:41,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:30:41,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:30:42,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (1/1) ... [2024-10-11 14:30:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:30:42,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:30:42,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:30:42,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:30:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:30:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:30:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:30:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:30:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:30:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:30:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:30:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:30:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:30:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:30:42,079 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:30:42,168 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:30:42,169 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:30:42,394 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:30:42,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:30:42,625 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:30:42,629 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:30:42,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:42 BoogieIcfgContainer [2024-10-11 14:30:42,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:30:42,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:30:42,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:30:42,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:30:42,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:30:41" (1/3) ... [2024-10-11 14:30:42,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dd3aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:42, skipping insertion in model container [2024-10-11 14:30:42,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:41" (2/3) ... [2024-10-11 14:30:42,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dd3aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:42, skipping insertion in model container [2024-10-11 14:30:42,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:42" (3/3) ... [2024-10-11 14:30:42,641 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-10-11 14:30:42,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:30:42,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:30:42,656 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:30:42,701 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:30:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 66 flow [2024-10-11 14:30:42,777 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-10-11 14:30:42,777 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:30:42,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-10-11 14:30:42,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 66 flow [2024-10-11 14:30:42,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 23 transitions, 58 flow [2024-10-11 14:30:42,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:30:42,805 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;@57355bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:30:42,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:30:42,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:30:42,817 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-10-11 14:30:42,818 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:30:42,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:42,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:30:42,819 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-10-11 14:30:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash -909110588, now seen corresponding path program 1 times [2024-10-11 14:30:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872179111] [2024-10-11 14:30:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:30:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:43,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872179111] [2024-10-11 14:30:43,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872179111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:30:43,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:30:43,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:30:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605930108] [2024-10-11 14:30:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:30:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:30:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:30:43,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2024-10-11 14:30:43,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10-11 14:30:43,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:43,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2024-10-11 14:30:43,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:43,332 INFO L124 PetriNetUnfolderBase]: 147/279 cut-off events. [2024-10-11 14:30:43,333 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 14:30:43,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 279 events. 147/279 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1049 event pairs, 42 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 501. Up to 168 conditions per place. [2024-10-11 14:30:43,339 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 29 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2024-10-11 14:30:43,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 159 flow [2024-10-11 14:30:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:30:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:30:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-10-11 14:30:43,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-10-11 14:30:43,357 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 58 flow. Second operand 3 states and 49 transitions. [2024-10-11 14:30:43,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 36 transitions, 159 flow [2024-10-11 14:30:43,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:30:43,364 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 69 flow [2024-10-11 14:30:43,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2024-10-11 14:30:43,371 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2024-10-11 14:30:43,371 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 69 flow [2024-10-11 14:30:43,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10-11 14:30:43,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:43,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:30:43,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:30:43,372 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-10-11 14:30:43,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -553407121, now seen corresponding path program 1 times [2024-10-11 14:30:43,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:43,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687417270] [2024-10-11 14:30:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:30:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:43,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687417270] [2024-10-11 14:30:43,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687417270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:30:43,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:30:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:30:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797325192] [2024-10-11 14:30:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:30:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:30:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:30:43,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-10-11 14:30:43,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:43,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:43,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-10-11 14:30:43,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:43,871 INFO L124 PetriNetUnfolderBase]: 208/434 cut-off events. [2024-10-11 14:30:43,872 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-11 14:30:43,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 434 events. 208/434 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1966 event pairs, 144 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 380. Up to 249 conditions per place. [2024-10-11 14:30:43,878 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 36 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-10-11 14:30:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 202 flow [2024-10-11 14:30:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:30:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:30:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-10-11 14:30:43,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-10-11 14:30:43,883 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 69 flow. Second operand 5 states and 72 transitions. [2024-10-11 14:30:43,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 202 flow [2024-10-11 14:30:43,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:30:43,887 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 102 flow [2024-10-11 14:30:43,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2024-10-11 14:30:43,889 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2024-10-11 14:30:43,890 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 102 flow [2024-10-11 14:30:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:43,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:43,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:30:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:30:43,891 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-10-11 14:30:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1680081727, now seen corresponding path program 1 times [2024-10-11 14:30:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088037571] [2024-10-11 14:30:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:30:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088037571] [2024-10-11 14:30:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088037571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:30:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:30:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:30:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55352593] [2024-10-11 14:30:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:30:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:30:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:30:44,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-10-11 14:30:44,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:44,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:44,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-10-11 14:30:44,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:44,188 INFO L124 PetriNetUnfolderBase]: 169/328 cut-off events. [2024-10-11 14:30:44,189 INFO L125 PetriNetUnfolderBase]: For 91/111 co-relation queries the response was YES. [2024-10-11 14:30:44,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 328 events. 169/328 cut-off events. For 91/111 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1272 event pairs, 124 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 604. Up to 250 conditions per place. [2024-10-11 14:30:44,193 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 18 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2024-10-11 14:30:44,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 209 flow [2024-10-11 14:30:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:30:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:30:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-10-11 14:30:44,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-10-11 14:30:44,196 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 102 flow. Second operand 5 states and 66 transitions. [2024-10-11 14:30:44,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 209 flow [2024-10-11 14:30:44,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 205 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:30:44,199 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 90 flow [2024-10-11 14:30:44,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2024-10-11 14:30:44,202 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2024-10-11 14:30:44,202 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 90 flow [2024-10-11 14:30:44,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:44,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:44,202 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:30:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:30:44,203 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-10-11 14:30:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -394227253, now seen corresponding path program 1 times [2024-10-11 14:30:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87650738] [2024-10-11 14:30:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:44,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:44,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87650738] [2024-10-11 14:30:44,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87650738] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029551118] [2024-10-11 14:30:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:44,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:30:44,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:30:44,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:30:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:44,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:30:44,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:30:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:44,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:30:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029551118] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:44,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:30:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-11 14:30:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774290931] [2024-10-11 14:30:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:44,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:30:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:44,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:30:44,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:30:44,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-10-11 14:30:44,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:44,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:44,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-10-11 14:30:44,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:44,698 INFO L124 PetriNetUnfolderBase]: 143/271 cut-off events. [2024-10-11 14:30:44,698 INFO L125 PetriNetUnfolderBase]: For 61/81 co-relation queries the response was YES. [2024-10-11 14:30:44,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 271 events. 143/271 cut-off events. For 61/81 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1030 event pairs, 42 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 644. Up to 138 conditions per place. [2024-10-11 14:30:44,701 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 22 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2024-10-11 14:30:44,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 165 flow [2024-10-11 14:30:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:30:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:30:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-10-11 14:30:44,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-10-11 14:30:44,704 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 90 flow. Second operand 5 states and 58 transitions. [2024-10-11 14:30:44,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 165 flow [2024-10-11 14:30:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 141 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-10-11 14:30:44,708 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 95 flow [2024-10-11 14:30:44,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-10-11 14:30:44,709 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-10-11 14:30:44,709 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 95 flow [2024-10-11 14:30:44,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:44,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:44,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:30:44,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:30:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:44,915 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-10-11 14:30:44,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1818183591, now seen corresponding path program 1 times [2024-10-11 14:30:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641080457] [2024-10-11 14:30:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641080457] [2024-10-11 14:30:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641080457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362451469] [2024-10-11 14:30:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:30:45,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:30:45,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:30:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:30:45,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:30:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:45,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:30:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:30:45,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362451469] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:45,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:30:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-11 14:30:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436172853] [2024-10-11 14:30:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:45,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:30:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:30:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:30:45,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-10-11 14:30:45,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:45,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:45,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-10-11 14:30:45,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:45,308 INFO L124 PetriNetUnfolderBase]: 144/285 cut-off events. [2024-10-11 14:30:45,312 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-10-11 14:30:45,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 285 events. 144/285 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1054 event pairs, 46 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 663. Up to 139 conditions per place. [2024-10-11 14:30:45,317 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 23 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-10-11 14:30:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 178 flow [2024-10-11 14:30:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:30:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:30:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-10-11 14:30:45,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2024-10-11 14:30:45,319 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 95 flow. Second operand 5 states and 59 transitions. [2024-10-11 14:30:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 178 flow [2024-10-11 14:30:45,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:30:45,322 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 112 flow [2024-10-11 14:30:45,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-11 14:30:45,323 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2024-10-11 14:30:45,324 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 112 flow [2024-10-11 14:30:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:30:45,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:45,325 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, 1, 1] [2024-10-11 14:30:45,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:30:45,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:45,526 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-10-11 14:30:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1425929380, now seen corresponding path program 1 times [2024-10-11 14:30:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:45,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198131958] [2024-10-11 14:30:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:30:45,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:30:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:30:45,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:30:45,613 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:30:45,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-11 14:30:45,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-11 14:30:45,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-11 14:30:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:30:45,621 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 14:30:45,678 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:30:45,679 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:30:45,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:30:45 BasicIcfg [2024-10-11 14:30:45,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:30:45,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:30:45,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:30:45,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:30:45,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:42" (3/4) ... [2024-10-11 14:30:45,688 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:30:45,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:30:45,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:30:45,763 INFO L158 Benchmark]: Toolchain (without parser) took 4264.33ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 119.0MB in the beginning and 139.2MB in the end (delta: -20.2MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,766 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:30:45,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.17ms. Allocated memory is still 188.7MB. Free memory was 118.8MB in the beginning and 155.1MB in the end (delta: -36.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.75ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 153.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:30:45,767 INFO L158 Benchmark]: Boogie Preprocessor took 47.54ms. Allocated memory is still 188.7MB. Free memory was 153.0MB in the beginning and 149.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,767 INFO L158 Benchmark]: RCFGBuilder took 630.86ms. Allocated memory is still 188.7MB. Free memory was 149.9MB in the beginning and 109.1MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,767 INFO L158 Benchmark]: TraceAbstraction took 3054.49ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 108.0MB in the beginning and 145.5MB in the end (delta: -37.5MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,768 INFO L158 Benchmark]: Witness Printer took 76.17ms. Allocated memory is still 260.0MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:30:45,769 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.17ms. Allocated memory is still 188.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.17ms. Allocated memory is still 188.7MB. Free memory was 118.8MB in the beginning and 155.1MB in the end (delta: -36.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.75ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 153.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.54ms. Allocated memory is still 188.7MB. Free memory was 153.0MB in the beginning and 149.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 630.86ms. Allocated memory is still 188.7MB. Free memory was 149.9MB in the beginning and 109.1MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3054.49ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 108.0MB in the beginning and 145.5MB in the end (delta: -37.5MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 76.17ms. Allocated memory is still 260.0MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=5] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=5, t2=6] [L62] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L49] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=0, tmp=3] [L67] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=0, tmp=-3] [L49] 1 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1] [L49] COND FALSE 1 !(i