./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX --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 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:24:48,009 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:24:48,112 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:24:48,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:24:48,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:24:48,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:24:48,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:24:48,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:24:48,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:24:48,164 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:24:48,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:24:48,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:24:48,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:24:48,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:24:48,168 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:24:48,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:24:48,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:24:48,169 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:24:48,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:24:48,170 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:24:48,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:24:48,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:24:48,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:24:48,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:24:48,175 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:24:48,175 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:24:48,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:24:48,176 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:24:48,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:24:48,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:24:48,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:24:48,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:24:48,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:24:48,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:24:48,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:24:48,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:24:48,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:24:48,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:24:48,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:24:48,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:24:48,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:24:48,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:24:48,185 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX
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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f
[2024-11-08 18:24:48,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:24:48,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:24:48,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:24:48,506 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:24:48,506 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:24:48,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i
Unable to find full path for "g++"
[2024-11-08 18:24:50,466 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:24:50,850 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:24:50,850 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2024-11-08 18:24:50,877 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/data/6ee10058f/6e803583c08f4f539dea6967f27800ed/FLAGa5409487b
[2024-11-08 18:24:50,900 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/data/6ee10058f/6e803583c08f4f539dea6967f27800ed
[2024-11-08 18:24:50,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:24:50,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:24:50,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:24:50,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:24:50,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:24:50,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:24:50" (1/1) ...
[2024-11-08 18:24:50,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418fb692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:50, skipping insertion in model container
[2024-11-08 18:24:50,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:24:50" (1/1) ...
[2024-11-08 18:24:50,988 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:24:51,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996]
[2024-11-08 18:24:51,666 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:24:51,695 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:24:51,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996]
[2024-11-08 18:24:51,817 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:24:51,906 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:24:51,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51 WrapperNode
[2024-11-08 18:24:51,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:24:51,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:24:51,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:24:51,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:24:51,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:51,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,058 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130
[2024-11-08 18:24:52,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:24:52,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:24:52,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:24:52,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:24:52,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,132 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-08 18:24:52,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:24:52,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:24:52,154 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:24:52,154 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:24:52,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (1/1) ...
[2024-11-08 18:24:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:24:52,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:24:52,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:24:52,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:24:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:24:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:24:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 18:24:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 18:24:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 18:24:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 18:24:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:24:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:24:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:24:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:24:52,274 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:24:52,486 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:24:52,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:24:52,944 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:24:52,944 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:24:53,362 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:24:53,363 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:24:53,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:24:53 BoogieIcfgContainer
[2024-11-08 18:24:53,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:24:53,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:24:53,368 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:24:53,372 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:24:53,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:24:50" (1/3) ...
[2024-11-08 18:24:53,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51caad92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:24:53, skipping insertion in model container
[2024-11-08 18:24:53,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:24:51" (2/3) ...
[2024-11-08 18:24:53,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51caad92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:24:53, skipping insertion in model container
[2024-11-08 18:24:53,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:24:53" (3/3) ...
[2024-11-08 18:24:53,379 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2024-11-08 18:24:53,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:24:53,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-08 18:24:53,403 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:24:53,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 18:24:53,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow
[2024-11-08 18:24:53,553 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events.
[2024-11-08 18:24:53,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:24:53,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place.
[2024-11-08 18:24:53,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow
[2024-11-08 18:24:53,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow
[2024-11-08 18:24:53,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:24:53,579 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;@789219bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:24:53,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-08 18:24:53,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:24:53,588 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-11-08 18:24:53,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:24:53,588 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:24:53,589 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 18:24:53,590 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-11-08 18:24:53,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:24:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 834187690, now seen corresponding path program 1 times
[2024-11-08 18:24:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:24:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817151162]
[2024-11-08 18:24:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:24:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:24:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:24:54,273 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-08 18:24:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:24:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817151162]
[2024-11-08 18:24:54,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817151162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:24:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:24:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:24:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367882289]
[2024-11-08 18:24:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:24:54,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:24:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:24:54,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:24:54,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:24:54,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32
[2024-11-08 18:24:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-11-08 18:24:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:24:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32
[2024-11-08 18:24:54,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:24:54,658 INFO L124 PetriNetUnfolderBase]: 112/306 cut-off events.
[2024-11-08 18:24:54,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:24:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 306 events. 112/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1667 event pairs, 16 based on Foata normal form. 12/312 useless extension candidates. Maximal degree in co-relation 511. Up to 160 conditions per place.
[2024-11-08 18:24:54,665 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 19 selfloop transitions, 2 changer transitions 2/36 dead transitions.
[2024-11-08 18:24:54,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 124 flow
[2024-11-08 18:24:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:24:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:24:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-11-08 18:24:54,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334
[2024-11-08 18:24:54,682 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions.
[2024-11-08 18:24:54,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 124 flow
[2024-11-08 18:24:54,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:24:54,689 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow
[2024-11-08 18:24:54,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27}
[2024-11-08 18:24:54,695 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places.
[2024-11-08 18:24:54,697 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow
[2024-11-08 18:24:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-11-08 18:24:54,697 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:24:54,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:24:54,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:24:54,699 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-11-08 18:24:54,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:24:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -808504978, now seen corresponding path program 1 times
[2024-11-08 18:24:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:24:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074543817]
[2024-11-08 18:24:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:24:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:24:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:24:55,178 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-08 18:24:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:24:55,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074543817]
[2024-11-08 18:24:55,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074543817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:24:55,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:24:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:24:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822141474]
[2024-11-08 18:24:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:24:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:24:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:24:55,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:24:55,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:24:55,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32
[2024-11-08 18:24:55,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-08 18:24:55,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:24:55,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32
[2024-11-08 18:24:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:24:55,487 INFO L124 PetriNetUnfolderBase]: 161/353 cut-off events.
[2024-11-08 18:24:55,488 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-11-08 18:24:55,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 353 events. 161/353 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1717 event pairs, 24 based on Foata normal form. 20/349 useless extension candidates. Maximal degree in co-relation 679. Up to 166 conditions per place.
[2024-11-08 18:24:55,492 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 28 selfloop transitions, 4 changer transitions 1/43 dead transitions.
[2024-11-08 18:24:55,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 166 flow
[2024-11-08 18:24:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:24:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 18:24:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions.
[2024-11-08 18:24:55,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484375
[2024-11-08 18:24:55,495 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 4 states and 83 transitions.
[2024-11-08 18:24:55,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 166 flow
[2024-11-08 18:24:55,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:24:55,498 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 84 flow
[2024-11-08 18:24:55,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=29}
[2024-11-08 18:24:55,499 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2024-11-08 18:24:55,499 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 84 flow
[2024-11-08 18:24:55,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-08 18:24:55,500 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:24:55,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:24:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:24:55,501 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-11-08 18:24:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:24:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1203523660, now seen corresponding path program 1 times
[2024-11-08 18:24:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:24:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178950330]
[2024-11-08 18:24:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:24:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:24:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:24:55,930 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-08 18:24:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:24:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178950330]
[2024-11-08 18:24:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178950330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:24:55,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:24:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:24:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566775074]
[2024-11-08 18:24:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:24:55,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:24:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:24:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:24:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:24:55,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32
[2024-11-08 18:24:55,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-08 18:24:55,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:24:55,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32
[2024-11-08 18:24:55,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:24:56,139 INFO L124 PetriNetUnfolderBase]: 84/190 cut-off events.
[2024-11-08 18:24:56,139 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES.
[2024-11-08 18:24:56,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 190 events. 84/190 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 641 event pairs, 16 based on Foata normal form. 14/192 useless extension candidates. Maximal degree in co-relation 433. Up to 71 conditions per place.
[2024-11-08 18:24:56,143 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 24 selfloop transitions, 6 changer transitions 1/41 dead transitions.
[2024-11-08 18:24:56,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 175 flow
[2024-11-08 18:24:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:24:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:24:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions.
[2024-11-08 18:24:56,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.58125
[2024-11-08 18:24:56,147 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 84 flow. Second operand 5 states and 93 transitions.
[2024-11-08 18:24:56,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 175 flow
[2024-11-08 18:24:56,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 18:24:56,153 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 100 flow
[2024-11-08 18:24:56,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=29}
[2024-11-08 18:24:56,154 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places.
[2024-11-08 18:24:56,155 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 100 flow
[2024-11-08 18:24:56,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-08 18:24:56,155 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:24:56,155 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-08 18:24:56,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:24:56,156 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-11-08 18:24:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:24:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 123161291, now seen corresponding path program 1 times
[2024-11-08 18:24:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:24:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503280214]
[2024-11-08 18:24:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:24:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:24:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:24:56,651 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-08 18:24:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:24:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503280214]
[2024-11-08 18:24:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503280214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:24:56,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:24:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:24:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680304723]
[2024-11-08 18:24:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:24:56,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:24:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:24:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:24:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:24:56,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32
[2024-11-08 18:24:56,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-08 18:24:56,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:24:56,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32
[2024-11-08 18:24:56,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:24:56,924 INFO L124 PetriNetUnfolderBase]: 108/268 cut-off events.
[2024-11-08 18:24:56,924 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES.
[2024-11-08 18:24:56,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 268 events. 108/268 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1043 event pairs, 30 based on Foata normal form. 4/265 useless extension candidates. Maximal degree in co-relation 595. Up to 118 conditions per place.
[2024-11-08 18:24:56,926 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 19 selfloop transitions, 1 changer transitions 17/49 dead transitions.
[2024-11-08 18:24:56,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 222 flow
[2024-11-08 18:24:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:24:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:24:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-11-08 18:24:56,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666
[2024-11-08 18:24:56,928 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 100 flow. Second operand 6 states and 110 transitions.
[2024-11-08 18:24:56,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 222 flow
[2024-11-08 18:24:56,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 188 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-08 18:24:56,933 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 83 flow
[2024-11-08 18:24:56,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=83, PETRI_PLACES=44, PETRI_TRANSITIONS=29}
[2024-11-08 18:24:56,934 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places.
[2024-11-08 18:24:56,934 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 83 flow
[2024-11-08 18:24:56,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-08 18:24:56,935 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:24:56,935 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-08 18:24:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:24:56,935 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-11-08 18:24:56,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:24:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 661104163, now seen corresponding path program 2 times
[2024-11-08 18:24:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:24:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057751578]
[2024-11-08 18:24:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:24:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:24:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:24:59,945 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-08 18:24:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:24:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057751578]
[2024-11-08 18:24:59,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057751578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:24:59,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:24:59,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:24:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431108152]
[2024-11-08 18:24:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:24:59,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:24:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:24:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:24:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:24:59,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-08 18:24:59,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 83 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-08 18:24:59,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:24:59,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-08 18:24:59,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:25:00,479 INFO L124 PetriNetUnfolderBase]: 117/294 cut-off events.
[2024-11-08 18:25:00,480 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-08 18:25:00,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 294 events. 117/294 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1207 event pairs, 39 based on Foata normal form. 4/287 useless extension candidates. Maximal degree in co-relation 589. Up to 106 conditions per place.
[2024-11-08 18:25:00,482 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 18 selfloop transitions, 5 changer transitions 22/56 dead transitions.
[2024-11-08 18:25:00,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 233 flow
[2024-11-08 18:25:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:25:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 18:25:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-11-08 18:25:00,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222
[2024-11-08 18:25:00,486 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 83 flow. Second operand 9 states and 145 transitions.
[2024-11-08 18:25:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 233 flow
[2024-11-08 18:25:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 222 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-08 18:25:00,489 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 98 flow
[2024-11-08 18:25:00,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=29}
[2024-11-08 18:25:00,492 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places.
[2024-11-08 18:25:00,494 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 98 flow
[2024-11-08 18:25:00,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-08 18:25:00,494 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:25:00,495 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-08 18:25:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:25:00,495 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-11-08 18:25:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:25:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1945866811, now seen corresponding path program 3 times
[2024-11-08 18:25:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:25:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395243155]
[2024-11-08 18:25:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:25:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:25:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:25:00,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:25:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:25:00,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:25:00,747 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:25:00,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-08 18:25:00,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-11-08 18:25:00,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-08 18:25:00,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-08 18:25:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-11-08 18:25:00,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:25:00,755 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1]
[2024-11-08 18:25:00,850 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:25:00,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:25:00,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:25:00 BasicIcfg
[2024-11-08 18:25:00,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:25:00,858 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:25:00,858 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:25:00,858 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:25:00,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:24:53" (3/4) ...
[2024-11-08 18:25:00,860 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 18:25:00,970 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 18:25:00,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:25:00,971 INFO L158 Benchmark]: Toolchain (without parser) took 10066.68ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 158.9MB in the beginning and 107.6MB in the end (delta: 51.2MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,971 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 121.6MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:25:00,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1000.58ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 145.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.22ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 142.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,973 INFO L158 Benchmark]: Boogie Preprocessor took 88.82ms. Allocated memory is still 192.9MB. Free memory was 142.8MB in the beginning and 139.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,973 INFO L158 Benchmark]: RCFGBuilder took 1210.58ms. Allocated memory is still 192.9MB. Free memory was 139.6MB in the beginning and 92.4MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,974 INFO L158 Benchmark]: TraceAbstraction took 7489.88ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 91.4MB in the beginning and 117.1MB in the end (delta: -25.7MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,974 INFO L158 Benchmark]: Witness Printer took 112.26ms. Allocated memory is still 310.4MB. Free memory was 116.0MB in the beginning and 107.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 18:25:00,976 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.27ms. Allocated memory is still 121.6MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1000.58ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 145.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 153.22ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 142.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 88.82ms. Allocated memory is still 192.9MB. Free memory was 142.8MB in the beginning and 139.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1210.58ms. Allocated memory is still 192.9MB. Free memory was 139.6MB in the beginning and 92.4MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 7489.88ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 91.4MB in the beginning and 117.1MB in the end (delta: -25.7MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB.
* Witness Printer took 112.26ms. Allocated memory is still 310.4MB. Free memory was 116.0MB in the beginning and 107.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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;
[L718] 0 int y = 0;
[L719] 0 _Bool y$flush_delayed;
[L720] 0 int y$mem_tmp;
[L721] 0 _Bool y$r_buff0_thd0;
[L722] 0 _Bool y$r_buff0_thd1;
[L723] 0 _Bool y$r_buff0_thd2;
[L724] 0 _Bool y$r_buff1_thd0;
[L725] 0 _Bool y$r_buff1_thd1;
[L726] 0 _Bool y$r_buff1_thd2;
[L727] 0 _Bool y$read_delayed;
[L728] 0 int *y$read_delayed_var;
[L729] 0 int y$w_buff0;
[L730] 0 _Bool y$w_buff0_used;
[L731] 0 int y$w_buff1;
[L732] 0 _Bool y$w_buff1_used;
[L734] 0 int z = 0;
[L735] 0 _Bool weak$$choice0;
[L736] 0 _Bool weak$$choice2;
[L802] 0 pthread_t t1603;
[L803] FCALL, FORK 0 pthread_create(&t1603, ((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, t1603=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L804] 0 pthread_t t1604;
[L805] FCALL, FORK 0 pthread_create(&t1604, ((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, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L760] 2 y$w_buff1 = y$w_buff0
[L761] 2 y$w_buff0 = 2
[L762] 2 y$w_buff1_used = y$w_buff0_used
[L763] 2 y$w_buff0_used = (_Bool)1
[L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L768] 2 y$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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L771] 2 z = 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L774] 2 __unbuffered_p1_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L777] 2 __unbuffered_p1_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L740] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L743] 1 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L809] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L809] RET 0 assume_abort_if_not(main$tmp_guard0)
[L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L818] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L819] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L820] 0 y$flush_delayed = weak$$choice2
[L821] 0 y$mem_tmp = y
[L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L830] 0 y = y$flush_delayed ? y$mem_tmp : y
[L831] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L833] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 803]: 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: 805]: 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, 51 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: 7.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 8 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 567 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-11-08 18:25:01,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6552113-41d3-4374-8911-5c2cc3057bd1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE