./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 61a67961
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.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 c9c6cc212d45f96c9e6587b0ee0d7644c3fabb2c198a03ef385d6df2e7b46689
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m
[2024-10-14 14:22:41,930 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-14 14:22:41,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-14 14:22:42,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-14 14:22:42,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-14 14:22:42,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-14 14:22:42,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-14 14:22:42,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-14 14:22:42,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-14 14:22:42,022 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-14 14:22:42,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-14 14:22:42,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-14 14:22:42,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-14 14:22:42,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-14 14:22:42,025 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-14 14:22:42,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-14 14:22:42,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-14 14:22:42,026 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-14 14:22:42,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-14 14:22:42,026 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-14 14:22:42,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-14 14:22:42,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-14 14:22:42,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-14 14:22:42,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-14 14:22:42,028 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-14 14:22:42,028 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-14 14:22:42,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-14 14:22:42,028 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-14 14:22:42,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-14 14:22:42,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-14 14:22:42,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-14 14:22:42,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-14 14:22:42,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-14 14:22:42,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-14 14:22:42,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-14 14:22:42,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-14 14:22:42,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-14 14:22:42,037 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 -> c9c6cc212d45f96c9e6587b0ee0d7644c3fabb2c198a03ef385d6df2e7b46689
[2024-10-14 14:22:42,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-14 14:22:42,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-14 14:22:42,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-14 14:22:42,246 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-14 14:22:42,247 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-14 14:22:42,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.i
[2024-10-14 14:22:43,505 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-14 14:22:43,707 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-14 14:22:43,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.i
[2024-10-14 14:22:43,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82dcb5aa4/49fd549bf4e4460783d4bc207b4629a3/FLAG782e5717a
[2024-10-14 14:22:43,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82dcb5aa4/49fd549bf4e4460783d4bc207b4629a3
[2024-10-14 14:22:43,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-14 14:22:43,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-14 14:22:43,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-14 14:22:43,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-14 14:22:43,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-14 14:22:43,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:22:43" (1/1) ...
[2024-10-14 14:22:43,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1743f579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:43, skipping insertion in model container
[2024-10-14 14:22:43,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:22:43" (1/1) ...
[2024-10-14 14:22:43,795 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-14 14:22:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.i[944,957]
[2024-10-14 14:22:44,052 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-14 14:22:44,063 INFO L200 MainTranslator]: Completed pre-run
[2024-10-14 14:22:44,073 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.i[944,957]
[2024-10-14 14:22:44,120 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-14 14:22:44,147 INFO L204 MainTranslator]: Completed translation
[2024-10-14 14:22:44,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44 WrapperNode
[2024-10-14 14:22:44,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-14 14:22:44,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-14 14:22:44,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-14 14:22:44,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-14 14:22:44,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,192 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2024-10-14 14:22:44,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-14 14:22:44,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-14 14:22:44,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-14 14:22:44,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-14 14:22:44,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,216 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-10-14 14:22:44,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-14 14:22:44,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-14 14:22:44,232 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-14 14:22:44,232 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-14 14:22:44,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (1/1) ...
[2024-10-14 14:22:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-14 14:22:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-14 14:22:44,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-14 14:22:44,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-14 14:22:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-14 14:22:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-14 14:22:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-14 14:22:44,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-14 14:22:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-14 14:22:44,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-14 14:22:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-14 14:22:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-14 14:22:44,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-14 14:22:44,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-14 14:22:44,315 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-14 14:22:44,421 INFO L238 CfgBuilder]: Building ICFG
[2024-10-14 14:22:44,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-14 14:22:44,680 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-14 14:22:44,680 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-14 14:22:44,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-14 14:22:44,893 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-14 14:22:44,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:44 BoogieIcfgContainer
[2024-10-14 14:22:44,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-14 14:22:44,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-14 14:22:44,895 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-14 14:22:44,898 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-14 14:22:44,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:22:43" (1/3) ...
[2024-10-14 14:22:44,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2e0e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:22:44, skipping insertion in model container
[2024-10-14 14:22:44,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:22:44" (2/3) ...
[2024-10-14 14:22:44,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2e0e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:22:44, skipping insertion in model container
[2024-10-14 14:22:44,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:44" (3/3) ...
[2024-10-14 14:22:44,900 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i
[2024-10-14 14:22:44,911 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-14 14:22:44,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-14 14:22:44,912 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-14 14:22:44,944 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-14 14:22:44,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow
[2024-10-14 14:22:44,993 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events.
[2024-10-14 14:22:44,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-10-14 14:22:44,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place.
[2024-10-14 14:22:44,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow
[2024-10-14 14:22:44,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow
[2024-10-14 14:22:45,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-14 14:22:45,013 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;@66cb91e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-14 14:22:45,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-10-14 14:22:45,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-10-14 14:22:45,018 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events.
[2024-10-14 14:22:45,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-10-14 14:22:45,018 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:45,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:45,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1838594265, now seen corresponding path program 1 times
[2024-10-14 14:22:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633282589]
[2024-10-14 14:22:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 14:22:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-14 14:22:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 14:22:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633282589]
[2024-10-14 14:22:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633282589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 14:22:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 14:22:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-10-14 14:22:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442873418]
[2024-10-14 14:22:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 14:22:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-14 14:22:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 14:22:45,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-14 14:22:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-14 14:22:45,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31
[2024-10-14 14:22:45,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:45,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-14 14:22:45,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31
[2024-10-14 14:22:45,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-14 14:22:45,583 INFO L124 PetriNetUnfolderBase]: 144/317 cut-off events.
[2024-10-14 14:22:45,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-10-14 14:22:45,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 317 events. 144/317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1628 event pairs, 16 based on Foata normal form. 15/326 useless extension candidates. Maximal degree in co-relation 575. Up to 213 conditions per place.
[2024-10-14 14:22:45,587 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 20 selfloop transitions, 2 changer transitions 2/35 dead transitions.
[2024-10-14 14:22:45,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 124 flow
[2024-10-14 14:22:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-14 14:22:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-14 14:22:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions.
[2024-10-14 14:22:45,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387
[2024-10-14 14:22:45,599 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 66 transitions.
[2024-10-14 14:22:45,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 124 flow
[2024-10-14 14:22:45,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-14 14:22:45,603 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 60 flow
[2024-10-14 14:22:45,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2024-10-14 14:22:45,608 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places.
[2024-10-14 14:22:45,608 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 60 flow
[2024-10-14 14:22:45,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:45,608 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:45,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-14 14:22:45,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1669036513, now seen corresponding path program 1 times
[2024-10-14 14:22:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615058361]
[2024-10-14 14:22:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 14:22:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-14 14:22:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 14:22:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615058361]
[2024-10-14 14:22:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615058361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 14:22:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 14:22:45,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-14 14:22:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037805864]
[2024-10-14 14:22:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 14:22:45,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-14 14:22:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 14:22:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-14 14:22:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-14 14:22:45,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-10-14 14:22:45,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:45,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-14 14:22:45,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-10-14 14:22:45,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-14 14:22:46,024 INFO L124 PetriNetUnfolderBase]: 191/411 cut-off events.
[2024-10-14 14:22:46,025 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-10-14 14:22:46,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 411 events. 191/411 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1982 event pairs, 31 based on Foata normal form. 24/417 useless extension candidates. Maximal degree in co-relation 789. Up to 191 conditions per place.
[2024-10-14 14:22:46,029 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 4 changer transitions 1/44 dead transitions.
[2024-10-14 14:22:46,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 174 flow
[2024-10-14 14:22:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-14 14:22:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-10-14 14:22:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions.
[2024-10-14 14:22:46,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161
[2024-10-14 14:22:46,032 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 60 flow. Second operand 4 states and 78 transitions.
[2024-10-14 14:22:46,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 174 flow
[2024-10-14 14:22:46,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-14 14:22:46,034 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow
[2024-10-14 14:22:46,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-10-14 14:22:46,036 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places.
[2024-10-14 14:22:46,036 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow
[2024-10-14 14:22:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:46,037 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:46,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:46,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-14 14:22:46,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1611496895, now seen corresponding path program 1 times
[2024-10-14 14:22:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:46,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416247100]
[2024-10-14 14:22:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 14:22:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-14 14:22:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 14:22:46,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416247100]
[2024-10-14 14:22:46,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416247100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 14:22:46,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 14:22:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-14 14:22:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141976338]
[2024-10-14 14:22:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 14:22:46,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-14 14:22:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 14:22:46,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-14 14:22:46,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-14 14:22:46,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-10-14 14:22:46,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:46,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-14 14:22:46,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-10-14 14:22:46,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-14 14:22:46,375 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events.
[2024-10-14 14:22:46,376 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES.
[2024-10-14 14:22:46,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 211 events. 97/211 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 736 event pairs, 21 based on Foata normal form. 16/221 useless extension candidates. Maximal degree in co-relation 485. Up to 86 conditions per place.
[2024-10-14 14:22:46,379 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 26 selfloop transitions, 6 changer transitions 1/41 dead transitions.
[2024-10-14 14:22:46,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 179 flow
[2024-10-14 14:22:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-14 14:22:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-10-14 14:22:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions.
[2024-10-14 14:22:46,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935
[2024-10-14 14:22:46,381 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 5 states and 85 transitions.
[2024-10-14 14:22:46,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 179 flow
[2024-10-14 14:22:46,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-10-14 14:22:46,382 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 98 flow
[2024-10-14 14:22:46,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=40, PETRI_TRANSITIONS=28}
[2024-10-14 14:22:46,383 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places.
[2024-10-14 14:22:46,385 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 98 flow
[2024-10-14 14:22:46,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:46,385 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:46,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:46,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-14 14:22:46,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:46,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash 309745009, now seen corresponding path program 1 times
[2024-10-14 14:22:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:46,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654974757]
[2024-10-14 14:22:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 14:22:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-14 14:22:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 14:22:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654974757]
[2024-10-14 14:22:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654974757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 14:22:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 14:22:46,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-14 14:22:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216186071]
[2024-10-14 14:22:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 14:22:46,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-14 14:22:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 14:22:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-14 14:22:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-14 14:22:46,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-10-14 14:22:46,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:46,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-14 14:22:46,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-10-14 14:22:46,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-14 14:22:46,966 INFO L124 PetriNetUnfolderBase]: 118/288 cut-off events.
[2024-10-14 14:22:46,967 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES.
[2024-10-14 14:22:46,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 288 events. 118/288 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1173 event pairs, 31 based on Foata normal form. 4/286 useless extension candidates. Maximal degree in co-relation 639. Up to 133 conditions per place.
[2024-10-14 14:22:46,968 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 20 selfloop transitions, 1 changer transitions 18/49 dead transitions.
[2024-10-14 14:22:46,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 226 flow
[2024-10-14 14:22:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-14 14:22:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-10-14 14:22:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-10-14 14:22:46,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505
[2024-10-14 14:22:46,973 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 98 flow. Second operand 6 states and 100 transitions.
[2024-10-14 14:22:46,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 226 flow
[2024-10-14 14:22:46,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 192 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-10-14 14:22:46,975 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 81 flow
[2024-10-14 14:22:46,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=28}
[2024-10-14 14:22:46,976 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places.
[2024-10-14 14:22:46,977 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 81 flow
[2024-10-14 14:22:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:46,977 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:46,977 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-14 14:22:46,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -102520847, now seen corresponding path program 2 times
[2024-10-14 14:22:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368306527]
[2024-10-14 14:22:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 14:22:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-14 14:22:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 14:22:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368306527]
[2024-10-14 14:22:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368306527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 14:22:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 14:22:48,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-14 14:22:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589489476]
[2024-10-14 14:22:48,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 14:22:48,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-14 14:22:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 14:22:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-14 14:22:48,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-10-14 14:22:48,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31
[2024-10-14 14:22:48,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 81 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:48,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-14 14:22:48,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31
[2024-10-14 14:22:48,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-14 14:22:49,271 INFO L124 PetriNetUnfolderBase]: 112/277 cut-off events.
[2024-10-14 14:22:49,271 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-10-14 14:22:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 277 events. 112/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1092 event pairs, 20 based on Foata normal form. 4/274 useless extension candidates. Maximal degree in co-relation 561. Up to 75 conditions per place.
[2024-10-14 14:22:49,273 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 18 selfloop transitions, 4 changer transitions 26/59 dead transitions.
[2024-10-14 14:22:49,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 245 flow
[2024-10-14 14:22:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-10-14 14:22:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-10-14 14:22:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions.
[2024-10-14 14:22:49,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516
[2024-10-14 14:22:49,276 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 81 flow. Second operand 10 states and 159 transitions.
[2024-10-14 14:22:49,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 245 flow
[2024-10-14 14:22:49,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 234 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-10-14 14:22:49,279 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 99 flow
[2024-10-14 14:22:49,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=99, PETRI_PLACES=51, PETRI_TRANSITIONS=28}
[2024-10-14 14:22:49,280 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places.
[2024-10-14 14:22:49,280 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 99 flow
[2024-10-14 14:22:49,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-14 14:22:49,280 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-14 14:22:49,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-14 14:22:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-14 14:22:49,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-14 14:22:49,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 14:22:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1849221657, now seen corresponding path program 3 times
[2024-10-14 14:22:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 14:22:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580166039]
[2024-10-14 14:22:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 14:22:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 14:22:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-14 14:22:49,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-14 14:22:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-14 14:22:49,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-14 14:22:49,452 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-14 14:22:49,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-10-14 14:22:49,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-10-14 14:22:49,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-10-14 14:22:49,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-10-14 14:22:49,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-10-14 14:22:49,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-14 14:22:49,458 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1]
[2024-10-14 14:22:49,514 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-14 14:22:49,516 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-14 14:22:49,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:22:49 BasicIcfg
[2024-10-14 14:22:49,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-14 14:22:49,523 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-14 14:22:49,523 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-14 14:22:49,524 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-14 14:22:49,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:22:44" (3/4) ...
[2024-10-14 14:22:49,524 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-14 14:22:49,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-14 14:22:49,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-14 14:22:49,605 INFO L158 Benchmark]: Toolchain (without parser) took 5865.75ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 117.1MB in the beginning and 254.5MB in the end (delta: -137.4MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,605 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-14 14:22:49,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.22ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 91.5MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 172.0MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,606 INFO L158 Benchmark]: Boogie Preprocessor took 37.95ms. Allocated memory is still 172.0MB. Free memory was 88.2MB in the beginning and 84.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,606 INFO L158 Benchmark]: RCFGBuilder took 662.00ms. Allocated memory is still 172.0MB. Free memory was 84.4MB in the beginning and 119.1MB in the end (delta: -34.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,606 INFO L158 Benchmark]: TraceAbstraction took 4627.59ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 119.1MB in the beginning and 91.8MB in the end (delta: 27.3MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,606 INFO L158 Benchmark]: Witness Printer took 81.25ms. Allocated memory is still 293.6MB. Free memory was 90.8MB in the beginning and 254.5MB in the end (delta: -163.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-10-14 14:22:49,607 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.11ms. Allocated memory is still 172.0MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 406.22ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 91.5MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 44.69ms. Allocated memory is still 172.0MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 37.95ms. Allocated memory is still 172.0MB. Free memory was 88.2MB in the beginning and 84.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 662.00ms. Allocated memory is still 172.0MB. Free memory was 84.4MB in the beginning and 119.1MB in the end (delta: -34.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 4627.59ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 119.1MB in the beginning and 91.8MB in the end (delta: 27.3MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB.
* Witness Printer took 81.25ms. Allocated memory is still 293.6MB. Free memory was 90.8MB in the beginning and 254.5MB in the end (delta: -163.8MB). Peak memory consumption was 6.3MB. 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:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L717] 0 _Bool x$flush_delayed;
[L718] 0 int x$mem_tmp;
[L719] 0 _Bool x$r_buff0_thd0;
[L720] 0 _Bool x$r_buff0_thd1;
[L721] 0 _Bool x$r_buff0_thd2;
[L722] 0 _Bool x$r_buff1_thd0;
[L723] 0 _Bool x$r_buff1_thd1;
[L724] 0 _Bool x$r_buff1_thd2;
[L725] 0 _Bool x$read_delayed;
[L726] 0 int *x$read_delayed_var;
[L727] 0 int x$w_buff0;
[L728] 0 _Bool x$w_buff0_used;
[L729] 0 int x$w_buff1;
[L730] 0 _Bool x$w_buff1_used;
[L732] 0 int y = 0;
[L733] 0 _Bool weak$$choice0;
[L734] 0 _Bool weak$$choice2;
[L810] 0 pthread_t t597;
[L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L812] 0 pthread_t t598;
[L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L758] 2 x$w_buff1 = x$w_buff0
[L759] 2 x$w_buff0 = 2
[L760] 2 x$w_buff1_used = x$w_buff0_used
[L761] 2 x$w_buff0_used = (_Bool)1
[L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L766] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L769] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L770] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L771] 2 x$flush_delayed = weak$$choice2
[L772] 2 x$mem_tmp = x
[L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L780] 2 __unbuffered_p1_EAX = x
[L781] 2 x = x$flush_delayed ? x$mem_tmp : x
[L782] 2 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L785] 2 __unbuffered_p1_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L738] 1 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L741] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L817] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L817] RET 0 assume_abort_if_not(main$tmp_guard0)
[L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L826] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 0 x$flush_delayed = weak$$choice2
[L829] 0 x$mem_tmp = x
[L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L838] 0 x = x$flush_delayed ? x$mem_tmp : x
[L839] 0 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L841] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 811]: 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: 813]: 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 5 procedures, 49 locations, 5 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: 4.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 475 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 6 mSDtfsCounter, 475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 28, 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, 2.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-10-14 14:22:49,630 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