./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:31:09,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:31:09,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:31:09,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:31:09,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:31:09,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:31:09,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:31:09,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:31:09,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:31:09,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:31:09,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:31:09,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:31:09,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:31:09,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:31:09,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:31:09,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:31:09,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:31:09,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:31:09,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:31:09,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:31:09,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:31:09,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:31:09,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:31:09,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:31:09,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:31:09,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:31:09,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:31:09,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:31:09,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:31:09,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:31:09,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:31:09,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:31:09,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:31:09,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:31:09,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:31:09,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:31:09,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:31:09,973 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2024-11-19 01:31:10,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:31:10,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:31:10,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:31:10,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:31:10,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:31:10,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2024-11-19 01:31:11,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:31:11,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:31:11,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2024-11-19 01:31:11,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f93da729/ade01ed3f48044cfaf53cbf98fd23650/FLAGc71390d92 [2024-11-19 01:31:12,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f93da729/ade01ed3f48044cfaf53cbf98fd23650 [2024-11-19 01:31:12,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:31:12,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:31:12,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:31:12,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:31:12,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:31:12,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eea77d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12, skipping insertion in model container [2024-11-19 01:31:12,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:31:12,465 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/mix002.oepc.i[945,958] [2024-11-19 01:31:12,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:31:12,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:31:12,685 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/mix002.oepc.i[945,958] [2024-11-19 01:31:12,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:31:12,796 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:31:12,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12 WrapperNode [2024-11-19 01:31:12,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:31:12,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:31:12,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:31:12,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:31:12,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,875 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-11-19 01:31:12,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:31:12,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:31:12,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:31:12,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:31:12,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,915 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-19 01:31:12,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:31:12,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:31:12,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:31:12,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:31:12,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (1/1) ... [2024-11-19 01:31:12,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:31:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:31:13,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:31:13,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:31:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:31:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:31:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 01:31:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 01:31:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 01:31:13,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 01:31:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 01:31:13,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 01:31:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:31:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:31:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:31:13,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:31:13,106 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:31:13,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:31:13,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:31:13,829 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:31:13,832 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:31:14,138 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:31:14,143 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:31:14,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:31:14 BoogieIcfgContainer [2024-11-19 01:31:14,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:31:14,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:31:14,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:31:14,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:31:14,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:31:12" (1/3) ... [2024-11-19 01:31:14,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c34cd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:31:14, skipping insertion in model container [2024-11-19 01:31:14,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:31:12" (2/3) ... [2024-11-19 01:31:14,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c34cd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:31:14, skipping insertion in model container [2024-11-19 01:31:14,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:31:14" (3/3) ... [2024-11-19 01:31:14,156 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2024-11-19 01:31:14,185 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:31:14,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:31:14,185 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:31:14,255 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:31:14,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2024-11-19 01:31:14,359 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2024-11-19 01:31:14,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:31:14,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-11-19 01:31:14,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2024-11-19 01:31:14,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2024-11-19 01:31:14,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:31:14,403 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;@20b38804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:31:14,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:31:14,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:31:14,411 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 01:31:14,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:31:14,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:14,412 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 01:31:14,412 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-19 01:31:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 11482530, now seen corresponding path program 1 times [2024-11-19 01:31:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106992314] [2024-11-19 01:31:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106992314] [2024-11-19 01:31:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106992314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:15,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 01:31:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150744146] [2024-11-19 01:31:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:31:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:31:15,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:31:15,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2024-11-19 01:31:15,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-19 01:31:15,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:15,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2024-11-19 01:31:15,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:15,534 INFO L124 PetriNetUnfolderBase]: 617/1321 cut-off events. [2024-11-19 01:31:15,535 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 01:31:15,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1321 events. 617/1321 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9054 event pairs, 95 based on Foata normal form. 45/1342 useless extension candidates. Maximal degree in co-relation 2287. Up to 763 conditions per place. [2024-11-19 01:31:15,548 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-19 01:31:15,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 185 flow [2024-11-19 01:31:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:31:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:31:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-19 01:31:15,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7906976744186046 [2024-11-19 01:31:15,561 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 102 transitions. [2024-11-19 01:31:15,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 185 flow [2024-11-19 01:31:15,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:15,566 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-19 01:31:15,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-19 01:31:15,572 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-11-19 01:31:15,572 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-19 01:31:15,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-19 01:31:15,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:15,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:15,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:31:15,573 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-19 01:31:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -397751217, now seen corresponding path program 1 times [2024-11-19 01:31:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586300203] [2024-11-19 01:31:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586300203] [2024-11-19 01:31:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586300203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:31:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609318867] [2024-11-19 01:31:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:31:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:31:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:31:15,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-19 01:31:15,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:15,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:15,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-19 01:31:15,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:16,604 INFO L124 PetriNetUnfolderBase]: 3802/5972 cut-off events. [2024-11-19 01:31:16,604 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2024-11-19 01:31:16,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11850 conditions, 5972 events. 3802/5972 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 38022 event pairs, 2060 based on Foata normal form. 0/5810 useless extension candidates. Maximal degree in co-relation 11840. Up to 3590 conditions per place. [2024-11-19 01:31:16,628 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 32 selfloop transitions, 4 changer transitions 53/100 dead transitions. [2024-11-19 01:31:16,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 404 flow [2024-11-19 01:31:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:31:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:31:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-11-19 01:31:16,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5901162790697675 [2024-11-19 01:31:16,631 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 8 states and 203 transitions. [2024-11-19 01:31:16,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 404 flow [2024-11-19 01:31:16,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:31:16,633 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 124 flow [2024-11-19 01:31:16,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2024-11-19 01:31:16,634 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-19 01:31:16,634 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 124 flow [2024-11-19 01:31:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:16,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:16,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:31:16,635 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-19 01:31:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1654739143, now seen corresponding path program 1 times [2024-11-19 01:31:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180112813] [2024-11-19 01:31:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180112813] [2024-11-19 01:31:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180112813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:31:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827017213] [2024-11-19 01:31:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:16,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:31:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:31:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:31:16,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-19 01:31:16,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:16,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:16,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-19 01:31:16,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:17,513 INFO L124 PetriNetUnfolderBase]: 2839/4518 cut-off events. [2024-11-19 01:31:17,514 INFO L125 PetriNetUnfolderBase]: For 3655/3655 co-relation queries the response was YES. [2024-11-19 01:31:17,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11529 conditions, 4518 events. 2839/4518 cut-off events. For 3655/3655 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27435 event pairs, 617 based on Foata normal form. 140/4620 useless extension candidates. Maximal degree in co-relation 11514. Up to 2843 conditions per place. [2024-11-19 01:31:17,557 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 37 selfloop transitions, 3 changer transitions 47/98 dead transitions. [2024-11-19 01:31:17,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 498 flow [2024-11-19 01:31:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:31:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:31:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-11-19 01:31:17,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6112956810631229 [2024-11-19 01:31:17,563 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 124 flow. Second operand 7 states and 184 transitions. [2024-11-19 01:31:17,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 498 flow [2024-11-19 01:31:17,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 486 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:17,592 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 135 flow [2024-11-19 01:31:17,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=7, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2024-11-19 01:31:17,595 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-19 01:31:17,595 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 135 flow [2024-11-19 01:31:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:17,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:17,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:31:17,596 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-19 01:31:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 490270560, now seen corresponding path program 1 times [2024-11-19 01:31:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698550546] [2024-11-19 01:31:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698550546] [2024-11-19 01:31:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698550546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:17,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:31:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428821164] [2024-11-19 01:31:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:17,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:31:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:31:17,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:31:17,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-19 01:31:17,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:17,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:17,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-19 01:31:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:18,466 INFO L124 PetriNetUnfolderBase]: 2463/3944 cut-off events. [2024-11-19 01:31:18,466 INFO L125 PetriNetUnfolderBase]: For 4575/4582 co-relation queries the response was YES. [2024-11-19 01:31:18,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10411 conditions, 3944 events. 2463/3944 cut-off events. For 4575/4582 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23492 event pairs, 1487 based on Foata normal form. 124/4047 useless extension candidates. Maximal degree in co-relation 10392. Up to 2261 conditions per place. [2024-11-19 01:31:18,494 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 3 changer transitions 41/95 dead transitions. [2024-11-19 01:31:18,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 486 flow [2024-11-19 01:31:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:31:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:31:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-11-19 01:31:18,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6013289036544851 [2024-11-19 01:31:18,497 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 135 flow. Second operand 7 states and 181 transitions. [2024-11-19 01:31:18,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 486 flow [2024-11-19 01:31:18,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 462 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 01:31:18,513 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 140 flow [2024-11-19 01:31:18,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=7, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2024-11-19 01:31:18,514 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-19 01:31:18,514 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 140 flow [2024-11-19 01:31:18,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:18,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:18,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:18,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:31:18,515 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-19 01:31:18,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash 477159581, now seen corresponding path program 1 times [2024-11-19 01:31:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:18,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088043143] [2024-11-19 01:31:18,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088043143] [2024-11-19 01:31:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088043143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:18,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:31:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747209097] [2024-11-19 01:31:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:18,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:31:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:31:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:31:18,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-19 01:31:18,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:18,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:18,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-19 01:31:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:19,049 INFO L124 PetriNetUnfolderBase]: 1138/2034 cut-off events. [2024-11-19 01:31:19,050 INFO L125 PetriNetUnfolderBase]: For 1549/1574 co-relation queries the response was YES. [2024-11-19 01:31:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 2034 events. 1138/2034 cut-off events. For 1549/1574 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12537 event pairs, 240 based on Foata normal form. 49/2032 useless extension candidates. Maximal degree in co-relation 4848. Up to 1256 conditions per place. [2024-11-19 01:31:19,064 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 30 selfloop transitions, 3 changer transitions 29/79 dead transitions. [2024-11-19 01:31:19,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 376 flow [2024-11-19 01:31:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:31:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:31:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-11-19 01:31:19,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-11-19 01:31:19,065 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 140 flow. Second operand 7 states and 189 transitions. [2024-11-19 01:31:19,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 376 flow [2024-11-19 01:31:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 354 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 01:31:19,071 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 145 flow [2024-11-19 01:31:19,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=7, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-11-19 01:31:19,071 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-11-19 01:31:19,072 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 145 flow [2024-11-19 01:31:19,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:19,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:19,072 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-19 01:31:19,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:31:19,073 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-19 01:31:19,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 608855257, now seen corresponding path program 1 times [2024-11-19 01:31:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:19,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376436839] [2024-11-19 01:31:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376436839] [2024-11-19 01:31:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376436839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:31:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256027705] [2024-11-19 01:31:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:31:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:31:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:31:19,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-19 01:31:19,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:19,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:19,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-19 01:31:19,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:19,459 INFO L124 PetriNetUnfolderBase]: 1598/2714 cut-off events. [2024-11-19 01:31:19,460 INFO L125 PetriNetUnfolderBase]: For 1159/1190 co-relation queries the response was YES. [2024-11-19 01:31:19,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6051 conditions, 2714 events. 1598/2714 cut-off events. For 1159/1190 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16592 event pairs, 259 based on Foata normal form. 140/2764 useless extension candidates. Maximal degree in co-relation 6030. Up to 1234 conditions per place. [2024-11-19 01:31:19,474 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 42 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-11-19 01:31:19,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 293 flow [2024-11-19 01:31:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:31:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:31:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-19 01:31:19,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2024-11-19 01:31:19,476 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 145 flow. Second operand 4 states and 121 transitions. [2024-11-19 01:31:19,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 293 flow [2024-11-19 01:31:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 275 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-19 01:31:19,482 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 165 flow [2024-11-19 01:31:19,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-19 01:31:19,482 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-19 01:31:19,483 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 165 flow [2024-11-19 01:31:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:19,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:19,483 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] [2024-11-19 01:31:19,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:31:19,483 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-19 01:31:19,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1907279697, now seen corresponding path program 1 times [2024-11-19 01:31:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:19,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303562494] [2024-11-19 01:31:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303562494] [2024-11-19 01:31:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303562494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:31:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527320158] [2024-11-19 01:31:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:19,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:31:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:19,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:31:19,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:31:19,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-19 01:31:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:19,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-19 01:31:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:19,915 INFO L124 PetriNetUnfolderBase]: 1270/2182 cut-off events. [2024-11-19 01:31:19,915 INFO L125 PetriNetUnfolderBase]: For 850/862 co-relation queries the response was YES. [2024-11-19 01:31:19,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5334 conditions, 2182 events. 1270/2182 cut-off events. For 850/862 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12651 event pairs, 200 based on Foata normal form. 110/2206 useless extension candidates. Maximal degree in co-relation 5315. Up to 674 conditions per place. [2024-11-19 01:31:19,925 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 54 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2024-11-19 01:31:19,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 382 flow [2024-11-19 01:31:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:31:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:31:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-19 01:31:19,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2024-11-19 01:31:19,927 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 165 flow. Second operand 5 states and 154 transitions. [2024-11-19 01:31:19,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 382 flow [2024-11-19 01:31:19,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 367 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:19,929 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 205 flow [2024-11-19 01:31:19,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-11-19 01:31:19,930 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-19 01:31:19,930 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 205 flow [2024-11-19 01:31:19,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:19,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:19,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:31:19,931 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-19 01:31:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1335222816, now seen corresponding path program 1 times [2024-11-19 01:31:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021293277] [2024-11-19 01:31:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021293277] [2024-11-19 01:31:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021293277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:31:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631822259] [2024-11-19 01:31:20,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:20,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:31:20,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:20,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:31:20,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:31:20,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-19 01:31:20,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:20,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:20,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-19 01:31:20,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:20,402 INFO L124 PetriNetUnfolderBase]: 1062/1790 cut-off events. [2024-11-19 01:31:20,402 INFO L125 PetriNetUnfolderBase]: For 1891/1891 co-relation queries the response was YES. [2024-11-19 01:31:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4915 conditions, 1790 events. 1062/1790 cut-off events. For 1891/1891 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9945 event pairs, 200 based on Foata normal form. 48/1752 useless extension candidates. Maximal degree in co-relation 4895. Up to 674 conditions per place. [2024-11-19 01:31:20,445 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 48 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-11-19 01:31:20,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 392 flow [2024-11-19 01:31:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:31:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:31:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-11-19 01:31:20,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6550387596899225 [2024-11-19 01:31:20,447 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 205 flow. Second operand 6 states and 169 transitions. [2024-11-19 01:31:20,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 392 flow [2024-11-19 01:31:20,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 362 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-19 01:31:20,451 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 220 flow [2024-11-19 01:31:20,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-19 01:31:20,452 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-11-19 01:31:20,452 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 220 flow [2024-11-19 01:31:20,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:20,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:20,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, 1, 1, 1, 1] [2024-11-19 01:31:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:31:20,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:31:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 257575728, now seen corresponding path program 1 times [2024-11-19 01:31:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616118076] [2024-11-19 01:31:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:31:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:31:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616118076] [2024-11-19 01:31:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616118076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:21,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:21,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:31:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830146538] [2024-11-19 01:31:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:21,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:31:21,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:31:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:31:21,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2024-11-19 01:31:21,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:21,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:21,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2024-11-19 01:31:21,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:21,982 INFO L124 PetriNetUnfolderBase]: 1019/2126 cut-off events. [2024-11-19 01:31:21,982 INFO L125 PetriNetUnfolderBase]: For 3053/3352 co-relation queries the response was YES. [2024-11-19 01:31:21,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5688 conditions, 2126 events. 1019/2126 cut-off events. For 3053/3352 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14719 event pairs, 337 based on Foata normal form. 36/1959 useless extension candidates. Maximal degree in co-relation 5669. Up to 709 conditions per place. [2024-11-19 01:31:22,008 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 49 selfloop transitions, 7 changer transitions 12/96 dead transitions. [2024-11-19 01:31:22,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 486 flow [2024-11-19 01:31:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:31:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:31:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-11-19 01:31:22,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424418604651163 [2024-11-19 01:31:22,010 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 220 flow. Second operand 8 states and 221 transitions. [2024-11-19 01:31:22,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 486 flow [2024-11-19 01:31:22,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 462 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:22,032 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 250 flow [2024-11-19 01:31:22,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2024-11-19 01:31:22,036 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-11-19 01:31:22,037 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 250 flow [2024-11-19 01:31:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:22,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:22,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:22,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:31:22,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:31:22,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1380798444, now seen corresponding path program 2 times [2024-11-19 01:31:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:22,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124151717] [2024-11-19 01:31:22,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:31:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:22,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:31:22,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:31:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124151717] [2024-11-19 01:31:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124151717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:31:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806547608] [2024-11-19 01:31:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:31:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:31:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:31:22,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-19 01:31:22,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:22,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:22,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-19 01:31:22,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:22,917 INFO L124 PetriNetUnfolderBase]: 2994/5442 cut-off events. [2024-11-19 01:31:22,917 INFO L125 PetriNetUnfolderBase]: For 5528/6255 co-relation queries the response was YES. [2024-11-19 01:31:22,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14931 conditions, 5442 events. 2994/5442 cut-off events. For 5528/6255 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 40642 event pairs, 464 based on Foata normal form. 119/5088 useless extension candidates. Maximal degree in co-relation 14906. Up to 2525 conditions per place. [2024-11-19 01:31:22,943 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 57 selfloop transitions, 14 changer transitions 15/105 dead transitions. [2024-11-19 01:31:22,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 615 flow [2024-11-19 01:31:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:31:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:31:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-11-19 01:31:22,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.53156146179402 [2024-11-19 01:31:22,945 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 250 flow. Second operand 7 states and 160 transitions. [2024-11-19 01:31:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 615 flow [2024-11-19 01:31:22,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 600 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:22,969 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 334 flow [2024-11-19 01:31:22,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2024-11-19 01:31:22,970 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-19 01:31:22,970 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 334 flow [2024-11-19 01:31:22,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:22,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:22,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:31:22,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:31:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -608424214, now seen corresponding path program 3 times [2024-11-19 01:31:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279299100] [2024-11-19 01:31:22,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:31:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:23,033 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:31:23,034 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:31:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279299100] [2024-11-19 01:31:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279299100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:23,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:31:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266996794] [2024-11-19 01:31:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:31:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:31:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:31:23,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2024-11-19 01:31:23,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:23,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:23,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2024-11-19 01:31:23,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:24,416 INFO L124 PetriNetUnfolderBase]: 1894/4003 cut-off events. [2024-11-19 01:31:24,419 INFO L125 PetriNetUnfolderBase]: For 5384/5932 co-relation queries the response was YES. [2024-11-19 01:31:24,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11489 conditions, 4003 events. 1894/4003 cut-off events. For 5384/5932 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 32629 event pairs, 697 based on Foata normal form. 101/3606 useless extension candidates. Maximal degree in co-relation 11461. Up to 2167 conditions per place. [2024-11-19 01:31:24,481 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 10 changer transitions 20/104 dead transitions. [2024-11-19 01:31:24,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 624 flow [2024-11-19 01:31:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:31:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:31:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2024-11-19 01:31:24,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-11-19 01:31:24,486 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 334 flow. Second operand 9 states and 234 transitions. [2024-11-19 01:31:24,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 624 flow [2024-11-19 01:31:24,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 614 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-19 01:31:24,549 INFO L231 Difference]: Finished difference. Result has 83 places, 67 transitions, 412 flow [2024-11-19 01:31:24,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=83, PETRI_TRANSITIONS=67} [2024-11-19 01:31:24,549 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-19 01:31:24,553 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 67 transitions, 412 flow [2024-11-19 01:31:24,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:24,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:24,554 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:24,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:31:24,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:31:24,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1116543214, now seen corresponding path program 4 times [2024-11-19 01:31:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649044056] [2024-11-19 01:31:24,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:31:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:24,574 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:31:24,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:31:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:31:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:31:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649044056] [2024-11-19 01:31:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649044056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:31:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:31:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:31:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390581322] [2024-11-19 01:31:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:31:24,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:31:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:31:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:31:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:31:24,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-19 01:31:24,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 67 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:24,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:31:24,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-19 01:31:24,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:31:25,596 INFO L124 PetriNetUnfolderBase]: 3136/6452 cut-off events. [2024-11-19 01:31:25,596 INFO L125 PetriNetUnfolderBase]: For 10402/11070 co-relation queries the response was YES. [2024-11-19 01:31:25,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19452 conditions, 6452 events. 3136/6452 cut-off events. For 10402/11070 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 56289 event pairs, 1021 based on Foata normal form. 123/5841 useless extension candidates. Maximal degree in co-relation 19419. Up to 2203 conditions per place. [2024-11-19 01:31:25,642 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 1 changer transitions 36/108 dead transitions. [2024-11-19 01:31:25,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 785 flow [2024-11-19 01:31:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:31:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:31:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-19 01:31:25,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6007751937984496 [2024-11-19 01:31:25,644 INFO L175 Difference]: Start difference. First operand has 83 places, 67 transitions, 412 flow. Second operand 6 states and 155 transitions. [2024-11-19 01:31:25,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 785 flow [2024-11-19 01:31:25,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 722 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-11-19 01:31:25,728 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 347 flow [2024-11-19 01:31:25,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2024-11-19 01:31:25,731 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-19 01:31:25,731 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 347 flow [2024-11-19 01:31:25,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:31:25,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:31:25,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:25,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:31:25,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:31:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:31:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -119347786, now seen corresponding path program 5 times [2024-11-19 01:31:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:31:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690448095] [2024-11-19 01:31:25,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:31:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:31:25,813 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:31:25,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:31:25,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:31:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:31:25,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:31:25,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:31:25,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:31:25,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-19 01:31:25,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:31:25,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 01:31:25,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 01:31:25,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:31:25,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:31:25,936 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:31:26,017 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:31:26,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:31:26,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:31:26 BasicIcfg [2024-11-19 01:31:26,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:31:26,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:31:26,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:31:26,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:31:26,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:31:14" (3/4) ... [2024-11-19 01:31:26,025 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:31:26,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:31:26,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:31:26,108 INFO L158 Benchmark]: Toolchain (without parser) took 13965.41ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 82.5MB in the beginning and 759.9MB in the end (delta: -677.4MB). Peak memory consumption was 499.5MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,108 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:31:26,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.31ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 105.7MB in the end (delta: -23.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.14ms. Allocated memory is still 153.1MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,109 INFO L158 Benchmark]: Boogie Preprocessor took 75.64ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,109 INFO L158 Benchmark]: RCFGBuilder took 1191.12ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 120.5MB in the end (delta: -20.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,109 INFO L158 Benchmark]: TraceAbstraction took 11875.97ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 119.1MB in the beginning and 774.6MB in the end (delta: -655.6MB). Peak memory consumption was 520.0MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,109 INFO L158 Benchmark]: Witness Printer took 83.61ms. Allocated memory is still 1.3GB. Free memory was 774.6MB in the beginning and 759.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:31:26,110 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.16ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.31ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 105.7MB in the end (delta: -23.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.14ms. Allocated memory is still 153.1MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.64ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1191.12ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 120.5MB in the end (delta: -20.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11875.97ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 119.1MB in the beginning and 774.6MB in the end (delta: -655.6MB). Peak memory consumption was 520.0MB. Max. memory is 16.1GB. * Witness Printer took 83.61ms. Allocated memory is still 1.3GB. Free memory was 774.6MB in the beginning and 759.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, t39=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 858]: 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: 856]: 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, 72 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: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1791 IncrementalHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 54 mSDtfsCounter, 1791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=11, InterpolantAutomatonStates: 77, 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.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 2033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-19 01:31:26,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE