./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:13:14,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:13:14,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:13:14,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:13:14,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:13:14,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:13:14,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:13:14,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:13:14,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:13:14,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:13:14,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:13:14,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:13:14,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:13:14,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:13:14,714 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:13:14,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:13:14,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:13:14,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:13:14,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:13:14,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:13:14,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:13:14,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:13:14,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:13:14,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:13:14,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:13:14,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:13:14,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:13:14,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:13:14,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:13:14,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:13:14,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:13:14,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:13:14,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:13:14,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:13:14,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:13:14,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:13:14,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:13:14,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:13:14,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:13:14,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:13:14,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:13:14,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:13:14,728 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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b [2024-10-24 12:13:15,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:13:15,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:13:15,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:13:15,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:13:15,088 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:13:15,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2024-10-24 12:13:16,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:13:16,931 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:13:16,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2024-10-24 12:13:16,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17e89ba0/3c53884307464c9bb006f2c5898f41e8/FLAG928fbe141 [2024-10-24 12:13:17,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17e89ba0/3c53884307464c9bb006f2c5898f41e8 [2024-10-24 12:13:17,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:13:17,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:13:17,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:13:17,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:13:17,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:13:17,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641722b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17, skipping insertion in model container [2024-10-24 12:13:17,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:13:17,504 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/pthread-wmm/mix010.oepc.i[945,958] [2024-10-24 12:13:17,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:13:17,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:13:17,761 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/pthread-wmm/mix010.oepc.i[945,958] [2024-10-24 12:13:17,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:13:17,879 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:13:17,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17 WrapperNode [2024-10-24 12:13:17,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:13:17,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:13:17,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:13:17,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:13:17,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,953 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2024-10-24 12:13:17,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:13:17,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:13:17,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:13:17,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:13:17,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:17,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 12:13:18,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:13:18,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:13:18,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:13:18,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:13:18,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (1/1) ... [2024-10-24 12:13:18,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:13:18,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:13:18,102 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-10-24 12:13:18,106 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-10-24 12:13:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:13:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:13:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 12:13:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 12:13:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 12:13:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 12:13:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 12:13:18,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 12:13:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:13:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:13:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:13:18,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:13:18,184 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:13:18,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:13:18,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:13:18,710 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:13:18,710 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:13:18,923 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:13:18,924 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:13:18,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:18 BoogieIcfgContainer [2024-10-24 12:13:18,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:13:18,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:13:18,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:13:18,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:13:18,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:13:17" (1/3) ... [2024-10-24 12:13:18,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a096cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:18, skipping insertion in model container [2024-10-24 12:13:18,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:17" (2/3) ... [2024-10-24 12:13:18,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a096cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:18, skipping insertion in model container [2024-10-24 12:13:18,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:18" (3/3) ... [2024-10-24 12:13:18,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2024-10-24 12:13:18,953 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:13:18,953 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 12:13:18,954 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:13:19,003 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:13:19,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2024-10-24 12:13:19,078 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-10-24 12:13:19,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:13:19,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-10-24 12:13:19,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2024-10-24 12:13:19,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2024-10-24 12:13:19,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:13:19,134 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;@65c66a6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:13:19,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 12:13:19,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:13:19,145 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 12:13:19,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:13:19,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:19,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 12:13:19,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 11358433, now seen corresponding path program 1 times [2024-10-24 12:13:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:19,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89965185] [2024-10-24 12:13:19,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:19,700 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-24 12:13:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89965185] [2024-10-24 12:13:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89965185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:19,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 12:13:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805769970] [2024-10-24 12:13:19,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:13:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:13:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:13:19,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-24 12:13:19,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-24 12:13:19,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:19,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-24 12:13:19,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:20,199 INFO L124 PetriNetUnfolderBase]: 617/1162 cut-off events. [2024-10-24 12:13:20,200 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 12:13:20,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1162 events. 617/1162 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7381 event pairs, 95 based on Foata normal form. 45/1179 useless extension candidates. Maximal degree in co-relation 2128. Up to 763 conditions per place. [2024-10-24 12:13:20,217 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-10-24 12:13:20,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 183 flow [2024-10-24 12:13:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:13:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:13:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-24 12:13:20,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2024-10-24 12:13:20,235 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 99 transitions. [2024-10-24 12:13:20,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 183 flow [2024-10-24 12:13:20,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 12:13:20,243 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-24 12:13:20,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-24 12:13:20,252 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-10-24 12:13:20,253 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-24 12:13:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-24 12:13:20,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:20,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:13:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:13:20,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2127027653, now seen corresponding path program 1 times [2024-10-24 12:13:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25213748] [2024-10-24 12:13:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:20,527 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-24 12:13:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25213748] [2024-10-24 12:13:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25213748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:13:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864370336] [2024-10-24 12:13:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:20,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:13:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:13:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:13:20,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 12:13:20,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-24 12:13:20,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:20,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 12:13:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:21,050 INFO L124 PetriNetUnfolderBase]: 1318/2360 cut-off events. [2024-10-24 12:13:21,051 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-10-24 12:13:21,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 2360 events. 1318/2360 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15374 event pairs, 188 based on Foata normal form. 100/2319 useless extension candidates. Maximal degree in co-relation 4529. Up to 1053 conditions per place. [2024-10-24 12:13:21,068 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-10-24 12:13:21,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 234 flow [2024-10-24 12:13:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:13:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:13:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-10-24 12:13:21,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2024-10-24 12:13:21,071 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 117 transitions. [2024-10-24 12:13:21,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 234 flow [2024-10-24 12:13:21,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:13:21,076 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-24 12:13:21,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-10-24 12:13:21,078 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-10-24 12:13:21,078 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-24 12:13:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-24 12:13:21,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:21,079 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-24 12:13:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:13:21,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1785346017, now seen corresponding path program 1 times [2024-10-24 12:13:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:21,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983896267] [2024-10-24 12:13:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:21,465 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-24 12:13:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983896267] [2024-10-24 12:13:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983896267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:21,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:13:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109415154] [2024-10-24 12:13:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:13:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:13:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:13:21,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 12:13:21,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-24 12:13:21,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:21,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 12:13:21,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:21,861 INFO L124 PetriNetUnfolderBase]: 886/1574 cut-off events. [2024-10-24 12:13:21,862 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-10-24 12:13:21,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 1574 events. 886/1574 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8800 event pairs, 100 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 3539. Up to 465 conditions per place. [2024-10-24 12:13:21,874 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 52 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-10-24 12:13:21,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 327 flow [2024-10-24 12:13:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:13:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:13:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-10-24 12:13:21,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-10-24 12:13:21,880 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 148 transitions. [2024-10-24 12:13:21,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 327 flow [2024-10-24 12:13:21,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 317 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 12:13:21,885 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-24 12:13:21,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-10-24 12:13:21,886 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-10-24 12:13:21,886 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-24 12:13:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-24 12:13:21,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:21,887 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, 1, 1] [2024-10-24 12:13:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:13:21,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 436745538, now seen corresponding path program 1 times [2024-10-24 12:13:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088617560] [2024-10-24 12:13:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:22,316 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-24 12:13:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088617560] [2024-10-24 12:13:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088617560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:22,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:13:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220602046] [2024-10-24 12:13:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:22,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:13:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:13:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:13:22,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 12:13:22,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-24 12:13:22,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:22,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 12:13:22,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:22,614 INFO L124 PetriNetUnfolderBase]: 557/947 cut-off events. [2024-10-24 12:13:22,614 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-10-24 12:13:22,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 947 events. 557/947 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4402 event pairs, 83 based on Foata normal form. 40/937 useless extension candidates. Maximal degree in co-relation 2427. Up to 308 conditions per place. [2024-10-24 12:13:22,621 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 45 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-10-24 12:13:22,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 334 flow [2024-10-24 12:13:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:13:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:13:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-10-24 12:13:22,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-10-24 12:13:22,623 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 161 transitions. [2024-10-24 12:13:22,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 334 flow [2024-10-24 12:13:22,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 309 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 12:13:22,630 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-24 12:13:22,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-10-24 12:13:22,631 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-10-24 12:13:22,631 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-24 12:13:22,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-24 12:13:22,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:22,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:13:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:13:22,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1367372118, now seen corresponding path program 1 times [2024-10-24 12:13:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196190594] [2024-10-24 12:13:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:24,090 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-24 12:13:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196190594] [2024-10-24 12:13:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196190594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:13:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469321615] [2024-10-24 12:13:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:13:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:13:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:13:24,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-10-24 12:13:24,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 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-24 12:13:24,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:24,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-10-24 12:13:24,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:24,813 INFO L124 PetriNetUnfolderBase]: 894/1579 cut-off events. [2024-10-24 12:13:24,813 INFO L125 PetriNetUnfolderBase]: For 738/748 co-relation queries the response was YES. [2024-10-24 12:13:24,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1579 events. 894/1579 cut-off events. For 738/748 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8558 event pairs, 148 based on Foata normal form. 8/1543 useless extension candidates. Maximal degree in co-relation 3740. Up to 465 conditions per place. [2024-10-24 12:13:24,826 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 58 selfloop transitions, 13 changer transitions 15/104 dead transitions. [2024-10-24 12:13:24,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 484 flow [2024-10-24 12:13:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:13:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:13:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-10-24 12:13:24,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2024-10-24 12:13:24,830 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 10 states and 237 transitions. [2024-10-24 12:13:24,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 484 flow [2024-10-24 12:13:24,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 420 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-24 12:13:24,845 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 192 flow [2024-10-24 12:13:24,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=192, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-10-24 12:13:24,848 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2024-10-24 12:13:24,849 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 192 flow [2024-10-24 12:13:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 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-24 12:13:24,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:24,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:13:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:13:24,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -926603740, now seen corresponding path program 2 times [2024-10-24 12:13:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555628097] [2024-10-24 12:13:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:25,260 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-24 12:13:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555628097] [2024-10-24 12:13:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555628097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:13:25,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264736214] [2024-10-24 12:13:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:13:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:13:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:13:25,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-10-24 12:13:25,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-24 12:13:25,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:25,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-10-24 12:13:25,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:25,835 INFO L124 PetriNetUnfolderBase]: 1542/2783 cut-off events. [2024-10-24 12:13:25,836 INFO L125 PetriNetUnfolderBase]: For 1527/1539 co-relation queries the response was YES. [2024-10-24 12:13:25,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6792 conditions, 2783 events. 1542/2783 cut-off events. For 1527/1539 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16951 event pairs, 439 based on Foata normal form. 11/2738 useless extension candidates. Maximal degree in co-relation 6775. Up to 1228 conditions per place. [2024-10-24 12:13:25,851 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 5 changer transitions 38/102 dead transitions. [2024-10-24 12:13:25,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 540 flow [2024-10-24 12:13:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:13:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 12:13:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-10-24 12:13:25,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-10-24 12:13:25,854 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 192 flow. Second operand 8 states and 188 transitions. [2024-10-24 12:13:25,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 540 flow [2024-10-24 12:13:25,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 519 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 12:13:25,859 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 190 flow [2024-10-24 12:13:25,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2024-10-24 12:13:25,860 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-10-24 12:13:25,861 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 190 flow [2024-10-24 12:13:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-24 12:13:25,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:25,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:13:25,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:13:25,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1401526500, now seen corresponding path program 3 times [2024-10-24 12:13:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453900956] [2024-10-24 12:13:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:13:26,222 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-24 12:13:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:13:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453900956] [2024-10-24 12:13:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453900956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:13:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:13:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:13:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837071807] [2024-10-24 12:13:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:13:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:13:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:13:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:13:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:13:26,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-10-24 12:13:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-24 12:13:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:13:26,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-10-24 12:13:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:13:26,714 INFO L124 PetriNetUnfolderBase]: 1111/2007 cut-off events. [2024-10-24 12:13:26,715 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2024-10-24 12:13:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4773 conditions, 2007 events. 1111/2007 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11642 event pairs, 187 based on Foata normal form. 8/1935 useless extension candidates. Maximal degree in co-relation 4753. Up to 1008 conditions per place. [2024-10-24 12:13:26,727 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 37 selfloop transitions, 10 changer transitions 21/85 dead transitions. [2024-10-24 12:13:26,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 440 flow [2024-10-24 12:13:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:13:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 12:13:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-10-24 12:13:26,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-10-24 12:13:26,729 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 190 flow. Second operand 7 states and 160 transitions. [2024-10-24 12:13:26,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 440 flow [2024-10-24 12:13:26,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 425 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 12:13:26,736 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 229 flow [2024-10-24 12:13:26,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-10-24 12:13:26,737 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2024-10-24 12:13:26,737 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 229 flow [2024-10-24 12:13:26,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-24 12:13:26,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:13:26,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:13:26,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:13:26,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:13:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:13:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 842546660, now seen corresponding path program 4 times [2024-10-24 12:13:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:13:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690833705] [2024-10-24 12:13:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:13:26,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:13:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:13:26,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:13:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:13:26,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:13:26,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:13:26,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-24 12:13:26,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-24 12:13:26,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-24 12:13:26,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-24 12:13:26,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-24 12:13:26,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-24 12:13:26,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:13:26,956 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-10-24 12:13:27,075 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 12:13:27,075 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:13:27,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:13:27 BasicIcfg [2024-10-24 12:13:27,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:13:27,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:13:27,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:13:27,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:13:27,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:18" (3/4) ... [2024-10-24 12:13:27,083 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 12:13:27,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 12:13:27,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:13:27,175 INFO L158 Benchmark]: Toolchain (without parser) took 9949.30ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 131.0MB in the beginning and 332.8MB in the end (delta: -201.8MB). Peak memory consumption was 228.3kB. Max. memory is 16.1GB. [2024-10-24 12:13:27,175 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:13:27,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.01ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 105.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.62ms. Allocated memory is still 184.5MB. Free memory was 105.1MB in the beginning and 102.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,176 INFO L158 Benchmark]: Boogie Preprocessor took 100.05ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 151.8MB in the end (delta: -49.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,176 INFO L158 Benchmark]: RCFGBuilder took 865.90ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 102.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,176 INFO L158 Benchmark]: TraceAbstraction took 8153.84ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 102.1MB in the beginning and 347.4MB in the end (delta: -245.3MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,177 INFO L158 Benchmark]: Witness Printer took 93.16ms. Allocated memory is still 388.0MB. Free memory was 347.4MB in the beginning and 332.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 12:13:27,178 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.19ms. Allocated memory is still 100.7MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.01ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 105.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.62ms. Allocated memory is still 184.5MB. Free memory was 105.1MB in the beginning and 102.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.05ms. Allocated memory is still 184.5MB. Free memory was 102.4MB in the beginning and 151.8MB in the end (delta: -49.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 865.90ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 102.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8153.84ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 102.1MB in the beginning and 347.4MB in the end (delta: -245.3MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. * Witness Printer took 93.16ms. Allocated memory is still 388.0MB. Free memory was 347.4MB in the beginning and 332.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t257=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t257=-3, t258=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t257=-3, t258=-2, t259=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257=-3, t258=-2, t259=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257=-3, t258=-2, t259=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257=-3, t258=-2, t259=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 405 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 31 mSDtfsCounter, 972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 12:13:27,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE