./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:18:00,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:18:00,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:18:00,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:18:00,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:18:00,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:18:00,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:18:00,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:18:00,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:18:00,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:18:00,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:18:00,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:18:00,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:18:00,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:18:00,374 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:18:00,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:18:00,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:18:00,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:18:00,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:18:00,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:18:00,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:18:00,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:18:00,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:18:00,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:18:00,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:18:00,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:18:00,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:18:00,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:18:00,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:18:00,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:18:00,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:18:00,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:18:00,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:18:00,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:18:00,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:18:00,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:18:00,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:18:00,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:18:00,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:18:00,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:18:00,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:18:00,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:18:00,383 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-10 10:18:00,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:18:00,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:18:00,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:18:00,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:18:00,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:18:00,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-10 10:18:02,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:18:02,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:18:02,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-10 10:18:02,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e2aa160/9cd2b0282729450e8b8ed2260abe41b9/FLAGabba59211 [2024-11-10 10:18:02,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e2aa160/9cd2b0282729450e8b8ed2260abe41b9 [2024-11-10 10:18:02,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:18:02,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:18:02,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:18:02,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:18:02,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:18:02,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:18:02" (1/1) ... [2024-11-10 10:18:02,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77875f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:02, skipping insertion in model container [2024-11-10 10:18:02,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:18:02" (1/1) ... [2024-11-10 10:18:02,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:18:02,716 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-10 10:18:02,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:18:02,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:18:02,964 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-10 10:18:03,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:18:03,075 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:18:03,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03 WrapperNode [2024-11-10 10:18:03,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:18:03,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:18:03,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:18:03,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:18:03,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,141 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-10 10:18:03,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:18:03,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:18:03,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:18:03,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:18:03,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,185 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-10 10:18:03,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:18:03,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:18:03,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:18:03,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:18:03,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (1/1) ... [2024-11-10 10:18:03,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:18:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:18:03,254 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-10 10:18:03,257 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-10 10:18:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:18:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:18:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:18:03,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:18:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:18:03,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:18:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 10:18:03,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 10:18:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:18:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:18:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:18:03,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:18:03,309 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:18:03,470 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:18:03,473 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:18:03,791 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:18:03,791 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:18:04,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:18:04,040 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:18:04,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:18:04 BoogieIcfgContainer [2024-11-10 10:18:04,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:18:04,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:18:04,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:18:04,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:18:04,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:18:02" (1/3) ... [2024-11-10 10:18:04,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:18:04, skipping insertion in model container [2024-11-10 10:18:04,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:18:03" (2/3) ... [2024-11-10 10:18:04,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:18:04, skipping insertion in model container [2024-11-10 10:18:04,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:18:04" (3/3) ... [2024-11-10 10:18:04,052 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-10 10:18:04,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:18:04,069 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:18:04,069 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:18:04,128 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:18:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-10 10:18:04,223 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-10 10:18:04,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:18:04,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-10 10:18:04,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-10 10:18:04,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-10 10:18:04,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:18:04,254 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;@ffd6c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:18:04,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:18:04,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:18:04,261 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-10 10:18:04,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:18:04,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:04,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 10:18:04,263 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-10 10:18:04,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 10997193, now seen corresponding path program 1 times [2024-11-10 10:18:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259606885] [2024-11-10 10:18:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:04,791 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-10 10:18:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:04,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259606885] [2024-11-10 10:18:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259606885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:04,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:18:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927714550] [2024-11-10 10:18:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:18:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:18:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:18:04,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:04,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:18:04,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:04,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:05,882 INFO L124 PetriNetUnfolderBase]: 4775/6874 cut-off events. [2024-11-10 10:18:05,883 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-10 10:18:05,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13769 conditions, 6874 events. 4775/6874 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 38144 event pairs, 515 based on Foata normal form. 216/7081 useless extension candidates. Maximal degree in co-relation 13758. Up to 5951 conditions per place. [2024-11-10 10:18:05,937 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 47 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-10 10:18:05,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 229 flow [2024-11-10 10:18:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:18:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:18:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-10 10:18:05,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 10:18:05,950 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 78 transitions. [2024-11-10 10:18:05,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 229 flow [2024-11-10 10:18:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:18:05,958 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-10 10:18:05,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-10 10:18:05,965 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-10 10:18:05,993 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-10 10:18:05,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:18:05,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:05,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:18:05,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:18:05,994 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-10 10:18:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 856969008, now seen corresponding path program 1 times [2024-11-10 10:18:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581009116] [2024-11-10 10:18:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:06,368 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-10 10:18:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:06,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581009116] [2024-11-10 10:18:06,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581009116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:06,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:06,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:18:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642303104] [2024-11-10 10:18:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:06,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:18:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:18:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:18:06,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:06,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10 10:18:06,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:06,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:06,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:07,067 INFO L124 PetriNetUnfolderBase]: 3471/5431 cut-off events. [2024-11-10 10:18:07,067 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2024-11-10 10:18:07,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10879 conditions, 5431 events. 3471/5431 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 31101 event pairs, 535 based on Foata normal form. 216/5634 useless extension candidates. Maximal degree in co-relation 10869. Up to 3001 conditions per place. [2024-11-10 10:18:07,098 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 55 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2024-11-10 10:18:07,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 272 flow [2024-11-10 10:18:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:18:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:18:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-10 10:18:07,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-11-10 10:18:07,102 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 95 transitions. [2024-11-10 10:18:07,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 272 flow [2024-11-10 10:18:07,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:18:07,106 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-11-10 10:18:07,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-10 10:18:07,108 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-10 10:18:07,108 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-11-10 10:18:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10 10:18:07,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:07,109 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-10 10:18:07,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:18:07,109 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-10 10:18:07,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1818725647, now seen corresponding path program 1 times [2024-11-10 10:18:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368172905] [2024-11-10 10:18:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:07,477 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-10 10:18:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368172905] [2024-11-10 10:18:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368172905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:07,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:18:07,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501875624] [2024-11-10 10:18:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:18:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:07,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:18:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:18:07,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:07,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-10 10:18:07,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:07,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:07,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:07,952 INFO L124 PetriNetUnfolderBase]: 1935/3063 cut-off events. [2024-11-10 10:18:07,953 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2024-11-10 10:18:07,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6999 conditions, 3063 events. 1935/3063 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15376 event pairs, 339 based on Foata normal form. 152/3202 useless extension candidates. Maximal degree in co-relation 6987. Up to 985 conditions per place. [2024-11-10 10:18:07,973 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-11-10 10:18:07,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 381 flow [2024-11-10 10:18:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:18:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:18:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-10 10:18:07,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6205128205128205 [2024-11-10 10:18:07,976 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 121 transitions. [2024-11-10 10:18:07,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 381 flow [2024-11-10 10:18:07,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 371 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 10:18:07,982 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-11-10 10:18:07,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-10 10:18:07,984 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-10 10:18:07,984 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-11-10 10:18:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-10 10:18:07,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:07,985 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] [2024-11-10 10:18:07,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:18:07,986 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-10 10:18:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -186918117, now seen corresponding path program 1 times [2024-11-10 10:18:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083816767] [2024-11-10 10:18:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:08,381 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-10 10:18:08,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083816767] [2024-11-10 10:18:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083816767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:08,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:18:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861040335] [2024-11-10 10:18:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:08,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:18:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:18:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:18:08,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:08,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-10 10:18:08,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:08,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:08,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:08,786 INFO L124 PetriNetUnfolderBase]: 1167/1815 cut-off events. [2024-11-10 10:18:08,786 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2024-11-10 10:18:08,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4559 conditions, 1815 events. 1167/1815 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8038 event pairs, 303 based on Foata normal form. 56/1858 useless extension candidates. Maximal degree in co-relation 4545. Up to 672 conditions per place. [2024-11-10 10:18:08,800 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 59 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2024-11-10 10:18:08,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 372 flow [2024-11-10 10:18:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:18:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:18:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-11-10 10:18:08,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5170940170940171 [2024-11-10 10:18:08,802 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 121 transitions. [2024-11-10 10:18:08,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 372 flow [2024-11-10 10:18:08,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 347 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 10:18:08,816 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-11-10 10:18:08,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-10 10:18:08,817 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-10 10:18:08,817 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-11-10 10:18:08,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-10 10:18:08,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:08,818 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] [2024-11-10 10:18:08,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:18:08,819 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-10 10:18:08,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2015291949, now seen corresponding path program 1 times [2024-11-10 10:18:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:08,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882843336] [2024-11-10 10:18:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:18:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882843336] [2024-11-10 10:18:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882843336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:18:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862815307] [2024-11-10 10:18:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:18:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:18:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:18:09,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:09,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10 10:18:09,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:09,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:09,661 INFO L124 PetriNetUnfolderBase]: 1579/2459 cut-off events. [2024-11-10 10:18:09,661 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2024-11-10 10:18:09,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6292 conditions, 2459 events. 1579/2459 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11610 event pairs, 331 based on Foata normal form. 8/2456 useless extension candidates. Maximal degree in co-relation 6277. Up to 1060 conditions per place. [2024-11-10 10:18:09,675 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 50 selfloop transitions, 3 changer transitions 26/84 dead transitions. [2024-11-10 10:18:09,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 506 flow [2024-11-10 10:18:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:18:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:18:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-11-10 10:18:09,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-11-10 10:18:09,677 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 114 transitions. [2024-11-10 10:18:09,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 506 flow [2024-11-10 10:18:09,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 381 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-10 10:18:09,687 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 118 flow [2024-11-10 10:18:09,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-10 10:18:09,688 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-10 10:18:09,688 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 118 flow [2024-11-10 10:18:09,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10 10:18:09,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:09,689 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] [2024-11-10 10:18:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:18:09,690 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-10 10:18:09,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1475350133, now seen corresponding path program 2 times [2024-11-10 10:18:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547896979] [2024-11-10 10:18:09,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:10,512 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-10 10:18:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547896979] [2024-11-10 10:18:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547896979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:18:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332226798] [2024-11-10 10:18:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:18:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:18:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:18:10,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:10,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10 10:18:10,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:10,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:10,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:10,894 INFO L124 PetriNetUnfolderBase]: 1271/2023 cut-off events. [2024-11-10 10:18:10,896 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-11-10 10:18:10,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 2023 events. 1271/2023 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9291 event pairs, 284 based on Foata normal form. 8/2031 useless extension candidates. Maximal degree in co-relation 4725. Up to 1122 conditions per place. [2024-11-10 10:18:10,908 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 43 selfloop transitions, 4 changer transitions 29/81 dead transitions. [2024-11-10 10:18:10,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 81 transitions, 391 flow [2024-11-10 10:18:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:18:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:18:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-11-10 10:18:10,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2024-11-10 10:18:10,910 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 118 flow. Second operand 6 states and 113 transitions. [2024-11-10 10:18:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 81 transitions, 391 flow [2024-11-10 10:18:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 371 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 10:18:10,913 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 122 flow [2024-11-10 10:18:10,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-11-10 10:18:10,914 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-11-10 10:18:10,914 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 122 flow [2024-11-10 10:18:10,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10 10:18:10,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:10,915 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] [2024-11-10 10:18:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:18:10,915 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-10 10:18:10,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 898021415, now seen corresponding path program 3 times [2024-11-10 10:18:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085352523] [2024-11-10 10:18:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:18:12,831 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-10 10:18:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:18:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085352523] [2024-11-10 10:18:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085352523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:18:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:18:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:18:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123063943] [2024-11-10 10:18:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:18:12,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:18:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:18:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:18:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:18:12,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:18:12,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 122 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-10 10:18:12,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:18:12,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:18:12,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:18:13,434 INFO L124 PetriNetUnfolderBase]: 976/1618 cut-off events. [2024-11-10 10:18:13,434 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-11-10 10:18:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3703 conditions, 1618 events. 976/1618 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7123 event pairs, 178 based on Foata normal form. 8/1626 useless extension candidates. Maximal degree in co-relation 3689. Up to 660 conditions per place. [2024-11-10 10:18:13,443 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 80 selfloop transitions, 6 changer transitions 17/108 dead transitions. [2024-11-10 10:18:13,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 535 flow [2024-11-10 10:18:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:18:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:18:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-11-10 10:18:13,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-11-10 10:18:13,445 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 122 flow. Second operand 9 states and 156 transitions. [2024-11-10 10:18:13,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 535 flow [2024-11-10 10:18:13,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 509 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-10 10:18:13,449 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 143 flow [2024-11-10 10:18:13,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-10 10:18:13,451 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-11-10 10:18:13,451 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 143 flow [2024-11-10 10:18:13,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-10 10:18:13,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:18:13,452 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] [2024-11-10 10:18:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:18:13,452 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-10 10:18:13,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:18:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1516605321, now seen corresponding path program 4 times [2024-11-10 10:18:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:18:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605023500] [2024-11-10 10:18:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:18:13,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:18:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:18:13,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:18:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:18:13,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:18:13,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:18:13,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:18:13,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:18:13,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:18:13,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-10 10:18:13,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-10 10:18:13,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:18:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:18:13,631 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-10 10:18:13,724 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:18:13,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:18:13,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:18:13 BasicIcfg [2024-11-10 10:18:13,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:18:13,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:18:13,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:18:13,735 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:18:13,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:18:04" (3/4) ... [2024-11-10 10:18:13,736 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:18:13,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:18:13,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:18:13,836 INFO L158 Benchmark]: Toolchain (without parser) took 11386.99ms. Allocated memory was 172.0MB in the beginning and 553.6MB in the end (delta: 381.7MB). Free memory was 100.9MB in the beginning and 172.8MB in the end (delta: -71.9MB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,837 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:18:13,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.04ms. Allocated memory is still 172.0MB. Free memory was 100.7MB in the beginning and 126.1MB in the end (delta: -25.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.61ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,837 INFO L158 Benchmark]: Boogie Preprocessor took 62.45ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 119.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,838 INFO L158 Benchmark]: IcfgBuilder took 831.96ms. Allocated memory is still 172.0MB. Free memory was 119.2MB in the beginning and 61.8MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,838 INFO L158 Benchmark]: TraceAbstraction took 9689.97ms. Allocated memory was 172.0MB in the beginning and 553.6MB in the end (delta: 381.7MB). Free memory was 61.1MB in the beginning and 184.3MB in the end (delta: -123.2MB). Peak memory consumption was 257.0MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,838 INFO L158 Benchmark]: Witness Printer took 101.16ms. Allocated memory is still 553.6MB. Free memory was 184.3MB in the beginning and 172.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 10:18:13,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.04ms. Allocated memory is still 172.0MB. Free memory was 100.7MB in the beginning and 126.1MB in the end (delta: -25.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.61ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.45ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 119.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 831.96ms. Allocated memory is still 172.0MB. Free memory was 119.2MB in the beginning and 61.8MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9689.97ms. Allocated memory was 172.0MB in the beginning and 553.6MB in the end (delta: 381.7MB). Free memory was 61.1MB in the beginning and 184.3MB in the end (delta: -123.2MB). Peak memory consumption was 257.0MB. Max. memory is 16.1GB. * Witness Printer took 101.16ms. Allocated memory is still 553.6MB. Free memory was 184.3MB in the beginning and 172.8MB in the end (delta: 11.5MB). 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-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] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=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] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 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) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 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_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 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) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 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 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 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_p2_EAX=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 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) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 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 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 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_p2_EAX=1, arg={0: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0: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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 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 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 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_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] 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_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 819]: 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: 823]: 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: 821]: 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, 64 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: 9.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1039 IncrementalHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 5 mSDtfsCounter, 1039 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 39, 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.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 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-10 10:18:13,875 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