./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.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 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:31:33,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:31:33,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:31:33,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:31:33,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:31:33,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:31:33,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:31:33,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:31:33,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:31:33,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:31:33,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:31:33,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:31:33,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:31:33,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:31:33,505 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:31:33,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:31:33,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:31:33,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:31:33,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:31:33,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:31:33,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:31:33,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:31:33,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:31:33,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:31:33,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:31:33,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:31:33,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:31:33,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:31:33,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:31:33,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:31:33,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:31:33,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:31:33,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:31:33,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:31:33,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:31:33,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:31:33,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:31:33,514 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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2024-11-22 13:31:33,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:31:33,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:31:33,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:31:33,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:31:33,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:31:33,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 13:31:35,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:31:35,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:31:35,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 13:31:35,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4931a6021/bba40e079234466c932a0e083840ac7f/FLAG7ba1dae90 [2024-11-22 13:31:35,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4931a6021/bba40e079234466c932a0e083840ac7f [2024-11-22 13:31:35,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:31:35,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:31:35,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:31:35,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:31:35,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:31:35,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648ff465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35, skipping insertion in model container [2024-11-22 13:31:35,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:31:35,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-22 13:31:35,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:31:35,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:31:35,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-22 13:31:35,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:31:35,806 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:31:35,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35 WrapperNode [2024-11-22 13:31:35,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:31:35,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:31:35,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:31:35,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:31:35,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,868 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-22 13:31:35,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:31:35,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:31:35,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:31:35,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:31:35,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,906 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 13:31:35,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:31:35,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:31:35,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:31:35,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:31:35,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (1/1) ... [2024-11-22 13:31:35,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:31:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:31:36,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:31:36,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:31:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:31:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:31:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 13:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 13:31:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 13:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 13:31:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 13:31:36,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 13:31:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:31:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:31:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:31:36,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:31:36,076 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:31:36,179 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:31:36,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:31:36,452 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:31:36,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:31:36,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:31:36,588 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 13:31:36,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:31:36 BoogieIcfgContainer [2024-11-22 13:31:36,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:31:36,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:31:36,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:31:36,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:31:36,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:31:35" (1/3) ... [2024-11-22 13:31:36,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ead95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:31:36, skipping insertion in model container [2024-11-22 13:31:36,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:31:35" (2/3) ... [2024-11-22 13:31:36,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ead95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:31:36, skipping insertion in model container [2024-11-22 13:31:36,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:31:36" (3/3) ... [2024-11-22 13:31:36,594 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 13:31:36,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:31:36,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 13:31:36,607 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:31:36,647 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 13:31:36,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-22 13:31:36,700 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-22 13:31:36,700 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:31:36,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-22 13:31:36,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-22 13:31:36,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-22 13:31:36,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:31:36,730 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;@1758087e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:31:36,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 13:31:36,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:31:36,735 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 13:31:36,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:31:36,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:36,737 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 13:31:36,737 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-11-22 13:31:36,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash 11170846, now seen corresponding path program 1 times [2024-11-22 13:31:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318809846] [2024-11-22 13:31:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:31:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:31:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318809846] [2024-11-22 13:31:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318809846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 13:31:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123437664] [2024-11-22 13:31:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:37,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:31:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:31:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:31:37,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-11-22 13:31:37,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:37,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:37,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-11-22 13:31:37,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:37,571 INFO L124 PetriNetUnfolderBase]: 617/1104 cut-off events. [2024-11-22 13:31:37,571 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 13:31:37,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1104 events. 617/1104 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6399 event pairs, 343 based on Foata normal form. 45/1125 useless extension candidates. Maximal degree in co-relation 2070. Up to 763 conditions per place. [2024-11-22 13:31:37,582 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-11-22 13:31:37,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 181 flow [2024-11-22 13:31:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:31:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:31:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-22 13:31:37,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7804878048780488 [2024-11-22 13:31:37,595 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 96 transitions. [2024-11-22 13:31:37,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 181 flow [2024-11-22 13:31:37,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:31:37,600 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-22 13:31:37,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-22 13:31:37,607 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-22 13:31:37,607 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-22 13:31:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:37,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:37,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:31:37,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:31:37,608 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-11-22 13:31:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1425101444, now seen corresponding path program 1 times [2024-11-22 13:31:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547084122] [2024-11-22 13:31:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:31:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:31:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547084122] [2024-11-22 13:31:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547084122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:31:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190944204] [2024-11-22 13:31:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:37,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:31:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:31:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:31:37,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-22 13:31:37,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:37,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:37,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-22 13:31:37,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:38,063 INFO L124 PetriNetUnfolderBase]: 1318/2357 cut-off events. [2024-11-22 13:31:38,063 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-22 13:31:38,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 2357 events. 1318/2357 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15199 event pairs, 188 based on Foata normal form. 100/2324 useless extension candidates. Maximal degree in co-relation 4526. Up to 1053 conditions per place. [2024-11-22 13:31:38,074 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-22 13:31:38,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 232 flow [2024-11-22 13:31:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:31:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:31:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-22 13:31:38,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6890243902439024 [2024-11-22 13:31:38,077 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 113 transitions. [2024-11-22 13:31:38,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 232 flow [2024-11-22 13:31:38,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:31:38,081 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-11-22 13:31:38,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-11-22 13:31:38,082 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-11-22 13:31:38,082 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-11-22 13:31:38,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:38,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:38,082 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-11-22 13:31:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:31:38,083 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-11-22 13:31:38,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 23320236, now seen corresponding path program 1 times [2024-11-22 13:31:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414474633] [2024-11-22 13:31:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:31:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:31:38,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-11-22 13:31:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414474633] [2024-11-22 13:31:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414474633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:38,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:31:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416964456] [2024-11-22 13:31:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:38,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:31:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:38,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:31:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:31:38,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-22 13:31:38,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:38,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:38,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-22 13:31:38,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:38,595 INFO L124 PetriNetUnfolderBase]: 886/1571 cut-off events. [2024-11-22 13:31:38,596 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-11-22 13:31:38,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 1571 events. 886/1571 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8838 event pairs, 100 based on Foata normal form. 82/1570 useless extension candidates. Maximal degree in co-relation 3536. Up to 465 conditions per place. [2024-11-22 13:31:38,604 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-11-22 13:31:38,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 325 flow [2024-11-22 13:31:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:31:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:31:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-22 13:31:38,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2024-11-22 13:31:38,607 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 143 transitions. [2024-11-22 13:31:38,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 325 flow [2024-11-22 13:31:38,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 13:31:38,610 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-11-22 13:31:38,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-22 13:31:38,612 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-22 13:31:38,612 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-11-22 13:31:38,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:38,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:38,613 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-11-22 13:31:38,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:31:38,613 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-11-22 13:31:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1223296971, now seen corresponding path program 1 times [2024-11-22 13:31:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346762279] [2024-11-22 13:31:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:31:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:31:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346762279] [2024-11-22 13:31:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346762279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:31:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224670802] [2024-11-22 13:31:38,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:38,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:31:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:31:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:31:38,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-22 13:31:38,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:38,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-22 13:31:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:39,042 INFO L124 PetriNetUnfolderBase]: 557/944 cut-off events. [2024-11-22 13:31:39,043 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-22 13:31:39,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 944 events. 557/944 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4412 event pairs, 83 based on Foata normal form. 40/938 useless extension candidates. Maximal degree in co-relation 2424. Up to 308 conditions per place. [2024-11-22 13:31:39,048 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-22 13:31:39,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 332 flow [2024-11-22 13:31:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:31:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:31:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-22 13:31:39,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2024-11-22 13:31:39,051 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 155 transitions. [2024-11-22 13:31:39,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 332 flow [2024-11-22 13:31:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-22 13:31:39,058 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-11-22 13:31:39,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-11-22 13:31:39,059 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-11-22 13:31:39,059 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-11-22 13:31:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:39,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:39,060 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] [2024-11-22 13:31:39,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:31:39,060 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-11-22 13:31:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1416933658, now seen corresponding path program 1 times [2024-11-22 13:31:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044348268] [2024-11-22 13:31:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:31:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:31:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044348268] [2024-11-22 13:31:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044348268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:41,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:31:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735126575] [2024-11-22 13:31:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:41,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:31:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:31:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:31:41,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-22 13:31:41,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:41,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:41,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-22 13:31:41,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:42,373 INFO L124 PetriNetUnfolderBase]: 1753/3065 cut-off events. [2024-11-22 13:31:42,374 INFO L125 PetriNetUnfolderBase]: For 1317/1349 co-relation queries the response was YES. [2024-11-22 13:31:42,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 3065 events. 1753/3065 cut-off events. For 1317/1349 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18122 event pairs, 376 based on Foata normal form. 16/3013 useless extension candidates. Maximal degree in co-relation 7168. Up to 651 conditions per place. [2024-11-22 13:31:42,389 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 85 selfloop transitions, 23 changer transitions 24/148 dead transitions. [2024-11-22 13:31:42,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 148 transitions, 684 flow [2024-11-22 13:31:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:31:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-22 13:31:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 303 transitions. [2024-11-22 13:31:42,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5684803001876173 [2024-11-22 13:31:42,392 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 13 states and 303 transitions. [2024-11-22 13:31:42,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 148 transitions, 684 flow [2024-11-22 13:31:42,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 148 transitions, 604 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-22 13:31:42,408 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 284 flow [2024-11-22 13:31:42,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=284, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-11-22 13:31:42,409 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2024-11-22 13:31:42,409 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 284 flow [2024-11-22 13:31:42,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:42,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:42,410 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] [2024-11-22 13:31:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:31:42,411 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-11-22 13:31:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1172286394, now seen corresponding path program 2 times [2024-11-22 13:31:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118870581] [2024-11-22 13:31:42,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:31:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:42,487 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:31:42,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:31:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:42,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118870581] [2024-11-22 13:31:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118870581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:42,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:31:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706528495] [2024-11-22 13:31:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:42,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:31:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:31:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:31:42,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-22 13:31:42,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:42,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:42,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-22 13:31:42,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:43,224 INFO L124 PetriNetUnfolderBase]: 2687/4649 cut-off events. [2024-11-22 13:31:43,225 INFO L125 PetriNetUnfolderBase]: For 3186/3186 co-relation queries the response was YES. [2024-11-22 13:31:43,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12614 conditions, 4649 events. 2687/4649 cut-off events. For 3186/3186 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 29974 event pairs, 463 based on Foata normal form. 16/4504 useless extension candidates. Maximal degree in co-relation 12593. Up to 1811 conditions per place. [2024-11-22 13:31:43,246 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 55 selfloop transitions, 22 changer transitions 29/121 dead transitions. [2024-11-22 13:31:43,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 761 flow [2024-11-22 13:31:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:31:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 13:31:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-11-22 13:31:43,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5470383275261324 [2024-11-22 13:31:43,248 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 284 flow. Second operand 7 states and 157 transitions. [2024-11-22 13:31:43,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 761 flow [2024-11-22 13:31:43,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 121 transitions, 749 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-22 13:31:43,256 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 409 flow [2024-11-22 13:31:43,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-11-22 13:31:43,257 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2024-11-22 13:31:43,258 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 409 flow [2024-11-22 13:31:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:43,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:43,259 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] [2024-11-22 13:31:43,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:31:43,259 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-11-22 13:31:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash -326495906, now seen corresponding path program 3 times [2024-11-22 13:31:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369148845] [2024-11-22 13:31:43,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:31:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:43,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:31:43,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:31:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:31:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:31:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369148845] [2024-11-22 13:31:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369148845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:31:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:31:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:31:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776147929] [2024-11-22 13:31:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:31:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:31:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:31:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:31:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:31:44,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-22 13:31:44,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 409 flow. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:44,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:31:44,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-22 13:31:44,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:31:44,533 INFO L124 PetriNetUnfolderBase]: 1545/3062 cut-off events. [2024-11-22 13:31:44,534 INFO L125 PetriNetUnfolderBase]: For 2810/3062 co-relation queries the response was YES. [2024-11-22 13:31:44,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8123 conditions, 3062 events. 1545/3062 cut-off events. For 2810/3062 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21551 event pairs, 415 based on Foata normal form. 135/3039 useless extension candidates. Maximal degree in co-relation 8099. Up to 801 conditions per place. [2024-11-22 13:31:44,552 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 38 selfloop transitions, 7 changer transitions 23/109 dead transitions. [2024-11-22 13:31:44,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 688 flow [2024-11-22 13:31:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:31:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:31:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-22 13:31:44,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-11-22 13:31:44,555 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 409 flow. Second operand 9 states and 222 transitions. [2024-11-22 13:31:44,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 688 flow [2024-11-22 13:31:44,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 674 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-11-22 13:31:44,562 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 443 flow [2024-11-22 13:31:44,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2024-11-22 13:31:44,563 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2024-11-22 13:31:44,564 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 443 flow [2024-11-22 13:31:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:31:44,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:31:44,564 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] [2024-11-22 13:31:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:31:44,565 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-11-22 13:31:44,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:31:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2146067576, now seen corresponding path program 4 times [2024-11-22 13:31:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:31:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576772695] [2024-11-22 13:31:44,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:31:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:31:44,641 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:31:44,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 13:31:44,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:31:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:31:44,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:31:44,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:31:44,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-22 13:31:44,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-22 13:31:44,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-22 13:31:44,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 13:31:44,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 13:31:44,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-22 13:31:44,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:31:44,754 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-22 13:31:44,836 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 13:31:44,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:31:44,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:31:44 BasicIcfg [2024-11-22 13:31:44,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:31:44,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:31:44,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:31:44,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:31:44,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:31:36" (3/4) ... [2024-11-22 13:31:44,845 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 13:31:44,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 13:31:44,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:31:44,915 INFO L158 Benchmark]: Toolchain (without parser) took 9610.63ms. Allocated memory was 161.5MB in the beginning and 507.5MB in the end (delta: 346.0MB). Free memory was 102.9MB in the beginning and 447.3MB in the end (delta: -344.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 120.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.27ms. Allocated memory is still 161.5MB. Free memory was 102.4MB in the beginning and 76.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.64ms. Allocated memory is still 161.5MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: Boogie Preprocessor took 60.28ms. Allocated memory is still 161.5MB. Free memory was 73.6MB in the beginning and 70.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: RCFGBuilder took 655.41ms. Allocated memory is still 161.5MB. Free memory was 70.2MB in the beginning and 77.8MB in the end (delta: -7.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,916 INFO L158 Benchmark]: TraceAbstraction took 8252.19ms. Allocated memory was 161.5MB in the beginning and 507.5MB in the end (delta: 346.0MB). Free memory was 77.2MB in the beginning and 460.0MB in the end (delta: -382.7MB). Peak memory consumption was 257.9MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,917 INFO L158 Benchmark]: Witness Printer took 72.93ms. Allocated memory is still 507.5MB. Free memory was 460.0MB in the beginning and 447.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 13:31:44,918 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.12ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 120.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.27ms. Allocated memory is still 161.5MB. Free memory was 102.4MB in the beginning and 76.4MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.64ms. Allocated memory is still 161.5MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.28ms. Allocated memory is still 161.5MB. Free memory was 73.6MB in the beginning and 70.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 655.41ms. Allocated memory is still 161.5MB. Free memory was 70.2MB in the beginning and 77.8MB in the end (delta: -7.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8252.19ms. Allocated memory was 161.5MB in the beginning and 507.5MB in the end (delta: 346.0MB). Free memory was 77.2MB in the beginning and 460.0MB in the end (delta: -382.7MB). Peak memory consumption was 257.9MB. Max. memory is 16.1GB. * Witness Printer took 72.93ms. Allocated memory is still 507.5MB. Free memory was 460.0MB in the beginning and 447.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, t154=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 848]: 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: 846]: 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: 844]: 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, 68 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: 8.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 59 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, InterpolantAutomatonStates: 47, 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.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1734 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-11-22 13:31:44,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE